| 2006 |
|---|
| 12 | | Joseph S. Szakas,
Christian Trefftz:
Voronoi-diagram based heuristics for the location of mobile and unreliable service providers.
ACST 2006: 73-78 |
| 2004 |
|---|
| 11 | EE | Joseph S. Szakas,
Christian Trefftz:
Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull.
IPDPS 2004 |
| 10 | EE | D. Robert Adams,
Christian Trefftz:
Using XML in a compiler course.
ITiCSE 2004: 4-6 |
| 2003 |
|---|
| 9 | EE | Christian Trefftz,
Joseph S. Szakas:
Parallel Algorithms to Find the Voronoi Diagram and the Order-k Voronoi Diagram.
IPDPS 2003: 270 |
| 2002 |
|---|
| 8 | EE | Christian Trefftz,
Helmuth Trefftz:
Observations about an Approximate Algorithm for the Point Robot Motion Planning Problem.
SCCC 2002: 52- |
| 1995 |
|---|
| 7 | | Christian Trefftz,
Philip K. McKinley,
Tien-Yien Li,
Z. Zeng:
A Parallel Algorithm for the Singular Value Problem in Bidiagonal Matrices.
PPSC 1995: 62-67 |
| 6 | | Christian Trefftz,
C. C. Huang,
Philip K. McKinley,
Tien-Yien Li,
Z. Zeng:
A Scalable Eigenvalue Solver for Symmetric Tridiagonal Matrices.
Parallel Computing 21(8): 1213-1240 (1995) |
| 1994 |
|---|
| 5 | | Christian Trefftz,
C. C. Huang,
Philip K. McKinley,
Tien-Yien Li,
Z. Zeng:
Design and Performance Evaluation of a Distributed Eigenvalue Solver on a Workstation Cluster.
ICDCS 1994: 608-615 |
| 1993 |
|---|
| 4 | | Philip K. McKinley,
Christian Trefftz:
Efficient Broadcast in All-Port Wormhole-Routed Hypercubes.
ICPP 1993: 288-291 |
| 3 | | Philip K. McKinley,
Christian Trefftz:
MultiSim: A Simulation Tool for the Study of Large-Scale Multiprocessors.
MASCOTS 1993: 57-62 |
| 2 | | Christian Trefftz,
Philip K. McKinley,
Tien-Yien Li,
Zhonggang Zeng:
A Scalable Eigenvalue Solver for Symmetric Tridiagonal Matrices.
PPSC 1993: 602-609 |
| 1990 |
|---|
| 1 | EE | Joseph S. Szakas,
Christian Trefftz:
Cooperation of the Pattern Recognition Techniques of Dirichlet Tessellations with Political Science to Produce Ward Partitioning of Cities Without Bias (Abstract).
ACM Conference on Computer Science 1990: 439 |
