default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Uhrig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
[j8]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
- [j7]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
- [j6]Kurt Mehlhorn, R. Sundar, Christian Uhrig:
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17(2): 183-198 (1997) - [c9]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: 254-263 - [c8]Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
The LEDA Platform of Combinatorial and Geometric Computing. ICALP 1997: 7-16 - 1996
- [c7]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: 159-165 - [c6]Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung 1996: 43-50 - 1995
- [j5]Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman
, Christian Uhrig:
Lower Bounds for Set Intersection Queries. Algorithmica 14(2): 154-168 (1995) - [c5]Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Exact Geometric Computation in LEDA. SCG 1995: C18-C19 - 1994
- [c4]Kurt Mehlhorn, R. Sundar, Christian Uhrig:
Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. SODA 1994: 213-222 - 1993
- [b1]Christian Uhrig:
Lower and upper bounds for operations on sets. Saarland University, Saarbrücken, Germany, 1993, pp. 1-43 - [j4]Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig:
A Lower Bound for the Worst Case of Bottom-Up-Heapsort. Inf. Comput. 102(2): 263-279 (1993) - [c3]Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig:
Lower Bounds for Set Intersection Queries. SODA 1993: 194-201 - 1992
- [j3]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) - [j2]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) - [c2]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 - 1990
- [j1]Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. 35(3): 137-143 (1990) - [c1]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: 281-289
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
