Christian Uhrig

18 papers A* 3Journal 8Unranked 6
YearRankTypeTitle / Venue / Authors
1999 J jnl
Checking geometric programs or verification of geometric structures.
Comput. Geom.
Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig
1998 J jnl
A computational basis for higher-dimensional computational geometry and applications.
Comput. Geom.
Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler
1997 — conf
A Computational Basis for Higher-Dimensional Computational Geometry and Applications.
SCG
Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler
1997 J jnl
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time.
Algorithmica
Kurt Mehlhorn, R. Sundar, Christian Uhrig
1997 A* conf
The LEDA Platform of Combinatorial and Geometric Computing.
ICALP
Kurt Mehlhorn, Stefan Näher, Christian Uhrig
1996 — conf
Checking Geometric Programs or Verification of Geometric Structures.
SCG
Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig
1996 — conf
The LEDA Platform for Combinatorial and Geometric Computing.
GI Jahrestagung
Kurt Mehlhorn, Stefan Näher, Christian Uhrig
1995 — conf
Exact Geometric Computation in LEDA.
SCG
Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1995 J jnl
Lower Bounds for Set Intersection Queries.
Algorithmica
Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
1994 A* conf
Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time.
SODA
Kurt Mehlhorn, R. Sundar, Christian Uhrig
1993 J jnl
A Lower Bound for the Worst Case of Bottom-Up-Heapsort
Inf. Comput.
Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig
1993 A* conf
Lower Bounds for Set Intersection Queries.
SODA
Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
1993 — —
Lower and upper bounds for operations on sets.
Christian Uhrig
1992 J jnl
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Algorithmica
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1992 — conf
Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Data Structures and Efficient Algorithms
Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig
1992 J jnl
k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs
Inf. Comput.
Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig
1990 — conf
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
SCG
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1990 J jnl
Hidden Line Elimination for Isooriented Rectangels.
Inf. Process. Lett.
Kurt Mehlhorn, Stefan Näher, Christian Uhrig