default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 56 matches
- 1993
- Pankaj K. Agarwal, Micha Sharir:
Ray Shooting Amidst Convex Polytopes in Three Dimensions. SODA 1993: 260-270 - Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser:
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. SODA 1993: 371-381 - Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer:
Improved Dynamic Dictionary Matching. SODA 1993: 392-401 - Sunil Arya, David M. Mount:
Approximate Nearest Neighbor Queries in Fixed Dimensions. SODA 1993: 271-280 - Yossi Azar, Andrei Z. Broder, Mark S. Manasse:
On-line Choice of On-line Algorithms. SODA 1993: 432-440 - Egon Balas, Sebastián Ceria, Gérard Cornuéjols:
Solving Mixed 0-1 Programs by a Lift-and-Project Method. SODA 1993: 232-242 - Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA 1993: 322-330 - Adam L. Buchsbaum, Robert Endre Tarjan:
Confluently Persistent Deques via Data Structural Bootstrapping. SODA 1993: 155-164 - Paul B. Callahan, S. Rao Kosaraju:
Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. SODA 1993: 291-300 - Bernard Chazelle, Jirí Matousek:
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. SODA 1993: 281-290 - Joseph Cheriyan:
Random Weighted Laplacians, Lovász Minimum Digraphs and Finding Minimum Separators. SODA 1993: 31-40 - Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia:
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. SODA 1993: 44-53 - Ka Wong Chong, Tak Wah Lam:
Finding Connected Components in O(log n log log n) Time on the EREW PRAM. SODA 1993: 11-20 - Xiaotie Deng, Elias Koutsoupias:
Competitive Implementation of Parallel Programs. SODA 1993: 455-461 - Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig:
Lower Bounds for Set Intersection Queries. SODA 1993: 194-201 - David Eppstein, Jeff Erickson:
Iterated Nearest Neighbors and Finding Minimal Polytopes. SODA 1993: 64-73 - Elaine M. Eschen, Jeremy P. Spinrad:
An O(n2) Algorithm for Circular-Arc Graph Recognition. SODA 1993: 128-137 - Michael J. Fischer, Rebecca N. Wright:
An Efficient Protocol for Unconditionally Secure Secret Key Exchange. SODA 1993: 475-483 - Greg N. Frederickson:
A Data Structure for Dynamically Maintaining Rooted Trees. SODA 1993: 175-184 - Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. SODA 1993: 145-154 - Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. SODA 1993: 341-351 - Harold N. Gabow:
A Representation for Crossing Set Families with Applications to Submodular Flow Problems. SODA 1993: 202-211 - Igal Galperin, Ronald L. Rivest:
Scapegoat Trees. SODA 1993: 165-174 - Naveen Garg, Santosh S. Vempala, Aman Singla:
Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. SODA 1993: 103-111 - Raffaele Giancarlo:
The Suffix of a Square Matrix, with Applications. SODA 1993: 402-411 - Andrew V. Goldberg:
Scaling Algorithms for the Shortest Paths Problem. SODA 1993: 222-231 - Mordecai J. Golin:
Maxima in Convex Regions. SODA 1993: 352-360 - Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA 1993: 301-310 - Torben Hagerup:
Fast Deterministic Processor Allocation. SODA 1993: 1-10 - Jörg Heistermann, Thomas Lengauer:
Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces. SODA 1993: 251-259
skipping 26 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-17 12:58 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint