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 37 matches
- 1993
- Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri:
Selecting Distances in the Plane. Algorithmica 9(5): 495-514 (1993) - Richard Anderson, Simon Kahan, Martine D. F. Schlag:
Single-Layer Cylindrical Compaction. Algorithmica 9(3): 293-312 (1993) - Tetsuo Asano, Takeshi Tokuyama:
Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. Algorithmica 9(6): 572-590 (1993) - Mikhail J. Atallah:
A Faster Parallel Algorithm for a Matrix Searching Problem. Algorithmica 9(2): 156-167 (1993) - Eric Bach, Jonathan P. Sorenson:
Sieve Algorithms for Perfect Power Testing. Algorithmica 9(4): 313-328 (1993) - Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine:
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. Algorithmica 9(2): 168-183 (1993) - Toby Berger, A. Hekstra, Alon Orlitsky:
Asymptotic Component Densities in Programmable Gate Arrays Realizing All Circuits of a Given Size. Algorithmica 9(2): 101-127 (1993) - Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud:
A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis. Algorithmica 9(4): 329-356 (1993) - Robert A. Bosch, Kurt M. Anstreicher:
On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise. Algorithmica 9(2): 184-197 (1993) - Svante Carlsson, Christos Levcopoulos, Ola Petersson:
Sublinear Merging and Natural Mergesort. Algorithmica 9(6): 629-648 (1993) - Mee Yee Chan, Francis Y. L. Chin:
Schedulers for Larger Classes of Pinwheel Instances. Algorithmica 9(5): 425-462 (1993) - Lin Chen:
Efficient Parallel Recognition of Some Circular Arc Graphs, I. Algorithmica 9(3): 217-238 (1993) - Edward G. Coffman Jr., Peter W. Shor:
Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms. Algorithmica 9(3): 253-277 (1993) - David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri:
Computing the Intersection-Depth of Polyhedra. Algorithmica 9(6): 518-533 (1993) - Feng Gao, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe:
Finding Extrema with Unary Predicates. Algorithmica 9(6): 591-600 (1993) - Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap:
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica 9(2): 128-141 (1993) - Michael T. Goodrich, Steven B. Shauck, Sumanta Guha:
An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. Algorithmica 9(5): 515-516 (1993) - Leonidas J. Guibas, David Salesin, Jorge Stolfi:
Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives. Algorithmica 9(6): 534-560 (1993) - R. Z. Hwang, R. C. Chang, Richard C. T. Lee:
The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time. Algorithmica 9(4): 398-423 (1993) - R. Z. Hwang, Richard C. T. Lee, R. C. Chang:
The Slab Dividing Approach To Solve the Euclidean P-Center Problem. Algorithmica 9(1): 1-22 (1993) - Barry Joe, Cao An Wang:
Duality of Constrained Voronoi Diagrams and Delaunay Triangulations. Algorithmica 9(2): 142-155 (1993) - Michael Kaufmann, F. Miller Maley:
Parity Conditions in Homotopic Knock-Knee Routing. Algorithmica 9(1): 47-63 (1993) - Richard W. Kenyon:
Tiling a Polygon with Parallelograms. Algorithmica 9(4): 382-397 (1993) - Philip N. Klein, Clifford Stein:
A Parallel Algorithm for Approximating the Minimum Cycle Cover. Algorithmica 9(1): 23-31 (1993) - Manfred Kunde:
Packet Routing on Grids of Processors. Algorithmica 9(1): 32-46 (1993) - Tak Wah Lam, Kwong-fai Chan:
Finding Least-Weight Subsequences with Fewer Processors. Algorithmica 9(6): 615-628 (1993) - Richard J. Lipton, Jeffrey F. Naughton:
Clocked Adversaries for Hashing. Algorithmica 9(3): 239-252 (1993) - Walter Meyer:
Seven Fingers Allow Force-Torque Closure Grasps on Any Convex Polyhedron. Algorithmica 9(3): 278-292 (1993) - Kazumiti Numata, Takeshi Tokuyama:
Splitting a Configuration in a Simplex. Algorithmica 9(6): 649-668 (1993) - János Pach, Richard Pollack, Emo Welzl:
Weaving Patterns of Lines and Line Segments in Space. Algorithmica 9(6): 561-571 (1993)
skipping 7 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-09-13 03:53 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