Christian Uhrig

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): 85-103 (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): 289-303 (1998)

Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17(2): 183-198 (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. Symposium on Computational Geometry 1997: 254-263

Kurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform of Combinatorial and Geometric Computing. ICALP 1997: 7-16

Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig: Checking Geometric Programs or Verification of Geometric Structures. Symposium on Computational Geometry 1996: 159-165

Kurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung 1996: 43-50

Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig: Lower Bounds for Set Intersection Queries. Algorithmica 14(2): 154-168 (1995)

Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Exact Geometric Computation in LEDA. Symposium on Computational Geometry 1995: C18-C19

Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. SODA 1994: 213-222

Rudolf Fleischer, B. P. Sinha, Christian Uhrig: A Lower Bound for the Worst Case of Bottom-Up-Heapsort. Inf. Comput. 102(2): 263-279 (1993)

Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig: Lower Bounds for Set Intersection Queries. SODA 1993: 194-201

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): 391-406 (1992)

Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig: k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs. Inf. Comput. 101(1): 123-129 (1992)

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: 25-43

Kurt Mehlhorn, Stefan Näher, Christian Uhrig: Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. 35(3): 137-143 (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. Symposium on Computational Geometry 1990: 281-289