default search action
Christian Schwarz 0002
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Other persons with the same name
- Christian Schwarz — disambiguation page
- Christian Schwarz 0001 — University of Potsdam, Hasso Plattner Institute, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1993
- [b1]Christian Schwarz:
Data structures and algorithms for the dynamic closest pair problem. Saarland University, Saarbrücken, Germany, 1993, pp. 1-310
Journal Articles
- 1998
- [j4]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. 27(4): 1036-1072 (1998) - 1995
- [j3]Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid:
Static and Dynamic Algorithms for k-Point Clustering Problems. J. Algorithms 19(3): 474-503 (1995) - [j2]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. 2(1): 3-27 (1995) - 1994
- [j1]Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink:
An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica 12(1): 18-29 (1994)
Conference and Workshop Papers
- 1995
- [c7]Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans:
Minimal Enclosing Parallelogram with Application. SCG 1995: C34-C35 - 1993
- [c6]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. CCCG 1993: 246-251 - [c5]Günter Rote, Christian Schwarz, Jack Snoeyink:
Maintaining the Approximate Width of a Set of Points in the Plane. CCCG 1993: 258-263 - [c4]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA 1993: 301-310 - [c3]Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid:
Static and Dynamic Algorithms for k-Point Clustering Problems. WADS 1993: 265-276 - 1992
- [c2]Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink:
An Optimal Algorithm for the On-Line Closest-Pair Problem. SCG 1992: 330-336 - [c1]Christian Schwarz, Michiel H. M. Smid:
An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. SODA 1992: 280-285
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 2024-10-15 21:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint