Christian Uhrig

1999
17		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)
1998
16		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)
1997
15		Kurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform of Combinatorial and Geometric Computing. ICALP 1997: 7-16
14	EE	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
13		Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17(2): 183-198 (1997)
1996
12		Kurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung 1996: 43-50
11	EE	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
1995
10	EE	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
9		Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig: Lower Bounds for Set Intersection Queries. Algorithmica 14(2): 154-168 (1995)
1994
8		Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. SODA 1994: 213-222
1993
7		Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig: Lower Bounds for Set Intersection Queries. SODA 1993: 194-201
6		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)
1992
5		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
4		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)
3		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)
1990
2	EE	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
1		Kurt Mehlhorn, Stefan Näher, Christian Uhrig: Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. 35(3): 137-143 (1990)

Coauthor Index

1	Helmut Alt	[2] [4]
2	Christoph Burnikel	[10]
3	Paul F. Dietz	[7] [9]
4	Rudolf Fleischer	[2] [4] [5] [6]
5	Otfried Fries	[5]
6	Michael Kaufmann	[2] [4]
7	Jochen Könemann	[10]
8	Kurt Mehlhorn	[1] [2] [3] [4] [5] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17]
9	Stefan Meiser	[5]
10	Michael Müller	[14] [16]
11	Stefan Näher	[1] [2] [4] [5] [10] [11] [12] [14] [15] [16] [17]
12	Wolfgang J. Paul	[3]
13	Rajeev Raman	[7] [9]
14	Hans Rohnert	[5]
15	Thomas Schilz	[11] [17]
16	Stefan Schirra	[2] [4] [5] [10] [11] [14] [16] [17]
17	Michael Seel	[11] [14] [16] [17]
18	Raimund Seidel	[11] [17]
19	Klaus Simon	[5]
20	B. P. Sinha	[6]
21	R. Sundar	[8] [13]
22	Athanasios K. Tsakalidis	[5]
23	Joachim Ziegler	[14] [16]