Christian Uhrig

Publication Activity (10 Years)

Years Active: 1990-1999
Publications (10 Years): 0

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

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

Christian Uhrig.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Christian Uhrig