Christian Uhrig

According to our database1, Christian Uhrig authored at least 12 papers between 1990 and 1997.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1997
A Computational Basis for Higher-Dimensional Computational Geometry and Applications.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
The LEDA Platform for Combinatorial and Geometric Computing.
Proceedings of the Beherrschung von Informationssystemen, 1996

Checking Geometric Programs or Verification of Geometric Structures.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
Exact Geometric Computation in LEDA.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
A Lower Bound for the Worst Case of Bottom-Up-Heapsort
Inf. Comput., February, 1993

Lower and upper bounds for operations on sets.
PhD thesis, 1993

Lower Bounds for Set Intersection Queries.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs
Inf. Comput., November, 1992

Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1990
Hidden Line Elimination for Isooriented Rectangels.
Inf. Process. Lett., 1990

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990


  Loading...