The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian Uhrig: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:281-289 [Conf]
  2. Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
    Exact Geometric Computation in LEDA. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:254-263 [Conf]
  4. Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig
    Checking Geometric Programs or Verification of Geometric Structures. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:159-165 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:25-43 [Conf]
  6. Kurt Mehlhorn, Stefan Näher, Christian Uhrig
    The LEDA Platform for Combinatorial and Geometric Computing. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1996, pp:43-50 [Conf]
  7. Kurt Mehlhorn, Stefan Näher, Christian Uhrig
    The LEDA Platform of Combinatorial and Geometric Computing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:7-16 [Conf]
  8. Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
    Lower Bounds for Set Intersection Queries. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:194-201 [Conf]
  9. Kurt Mehlhorn, R. Sundar, Christian Uhrig
    Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:213-222 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:391-406 [Journal]
  11. Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
    Lower Bounds for Set Intersection Queries. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:2, pp:154-168 [Journal]
  12. Kurt Mehlhorn, R. Sundar, Christian Uhrig
    Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:2, pp:183-198 [Journal]
  13. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:4, pp:289-303 [Journal]
  14. Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig
    Checking geometric programs or verification of geometric structures. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:1-2, pp:85-103 [Journal]
  15. Rudolf Fleischer, B. P. Sinha, Christian Uhrig
    A Lower Bound for the Worst Case of Bottom-Up-Heapsort [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:102, n:2, pp:263-279 [Journal]
  16. Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig
    k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:101, n:1, pp:123-129 [Journal]
  17. Kurt Mehlhorn, Stefan Näher, Christian Uhrig
    Hidden Line Elimination for Isooriented Rectangels. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:3, pp:137-143 [Journal]

Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002