default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th SODA 1993: Austin, Texas, USA
- Vijaya Ramachandran:
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA. ACM/SIAM 1993, ISBN 0-89791-562-3 - Torben Hagerup:
Fast Deterministic Processor Allocation. 1-10 - Ka Wong Chong, Tak Wah Lam:
Finding Connected Components in O(log n log log n) Time on the EREW PRAM. 11-20 - David R. Karger:
Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm. 21-30 - Joseph Cheriyan:
Random Weighted Laplacians, Lovász Minimum Digraphs and Finding Minimum Separators. 31-40 - Donald E. Knuth:
The Stanford GraphBase: A Platform for Combinatorial Algorithms. 41-43 - Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia:
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. 44-53 - John Hershberger, Subhash Suri:
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. 54-63 - David Eppstein, Jeff Erickson:
Iterated Nearest Neighbors and Finding Minimal Polytopes. 64-73 - Jirí Matousek, David M. Mount, Nathan S. Netanyahu:
Efficient Randomized Algorithms for the Repeated Median Line Estimator. 74-82 - Jim Ruppert:
A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation. 83-92 - John D. Hobby:
Polygonal Approximations that Minimize the Number of Inflections. 93-102 - Naveen Garg, Santosh S. Vempala, Aman Singla:
Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. 103-111 - Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
The Vertex-Disjoint Menger Problem in Planar Graphs. 112-119 - Fred R. McMorris, Tandy J. Warnow, Thomas Wimer:
Triangulating Vertex Colored Graphs. 120-127 - Elaine M. Eschen, Jeremy P. Spinrad:
An O(n2) Algorithm for Circular-Arc Graph Recognition. 128-137 - Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer:
Optimal Edge Ranking of Trees in Polynomial Time. 138-144 - Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. 145-154 - Adam L. Buchsbaum, Robert Endre Tarjan:
Confluently Persistent Deques via Data Structural Bootstrapping. 155-164 - Igal Galperin, Ronald L. Rivest:
Scapegoat Trees. 165-174 - Greg N. Frederickson:
A Data Structure for Dynamically Maintaining Rooted Trees. 175-184 - Maria M. Klawe, Brendan Mumey:
Upper and Lower Bounds on Constructing Alphabetic Binary Trees. 185-193 - Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig:
Lower Bounds for Set Intersection Queries. 194-201 - Harold N. Gabow:
A Representation for Crossing Set Families with Applications to Submodular Flow Problems. 202-211 - Kevin J. Lang, Satish Rao:
Finding Near-Optimal Cuts: An Empirical Evaluation. 212-221 - Andrew V. Goldberg:
Scaling Algorithms for the Shortest Paths Problem. 222-231 - Egon Balas, Sebastián Ceria, Gérard Cornuéjols:
Solving Mixed 0-1 Programs by a Lift-and-Project Method. 232-242 - Samir Khuller, Balaji Raghavachari, Neal E. Young:
Balancing Minimum Spanning and Shortest Path Trees. 243-250 - Jörg Heistermann, Thomas Lengauer:
Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces. 251-259 - Pankaj K. Agarwal, Micha Sharir:
Ray Shooting Amidst Convex Polytopes in Three Dimensions. 260-270 - Sunil Arya, David M. Mount:
Approximate Nearest Neighbor Queries in Fixed Dimensions. 271-280 - Bernard Chazelle, Jirí Matousek:
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. 281-290 - Paul B. Callahan, S. Rao Kosaraju:
Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. 291-300 - Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. 301-310 - Peter N. Yianilos:
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. 311-321 - Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. 322-330 - Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan:
Chernoff-Hoeffding Bounds for Applications with Limited Independence. 331-340 - Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. 341-351 - Mordecai J. Golin:
Maxima in Convex Regions. 352-360 - Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni:
Dynamic Generation of Discrete Random Variates. 361-370 - Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser:
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. 371-381 - Tandy J. Warnow:
Tree Compatibility and Inferring Evoluationary History. 382-391 - Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer:
Improved Dynamic Dictionary Matching. 392-401 - Raffaele Giancarlo:
The Suffix of a Square Matrix, with Applications. 402-411 - H. Ramesh:
On Traversing Layered Graphs On-line. 412-421 - Rajeev Motwani, Steven J. Phillips, Eric Torng:
Non-Clairvoyant Scheduling. 422-431 - Yossi Azar, Andrei Z. Broder, Mark S. Manasse:
On-line Choice of On-line Algorithms. 432-440 - Ming-Yang Kao, John H. Reif, Stephen R. Tate:
Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. 441-447 - David B. Shmoys
, Éva Tardos:
Scheduling Unrelated Machines with Costs. 448-454 - Xiaotie Deng, Elias Koutsoupias:
Competitive Implementation of Parallel Programs. 455-461 - Timothy Law Snyder, J. Michael Steele:
Equidistribution of Point Sets for the Traveling Salesman and Related Problems. 462-466 - Peter M. McIlroy:
Optimistic Sorting and Information Theoretic Complexity. 467-474 - Michael J. Fischer, Rebecca N. Wright:
An Efficient Protocol for Unconditionally Secure Secret Key Exchange. 475-483 - Victor Shoup:
Fast Construction of Irreducible Polynomials over Finite Fields. 484-492 - Franz Höfting, Egon Wanke:
Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs. 493-499 - David W. Matula:
A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity. 500-504
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.
last updated on 2026-02-10 22:36 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:
