SODA A*

56 papers

YearTitle / Authors
1993A Data Structure for Dynamically Maintaining Rooted Trees.
Greg N. Frederickson
1993A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity.
David W. Matula
1993A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation.
Jim Ruppert
1993A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk.
John Hershberger, Subhash Suri
1993A Representation for Crossing Set Families with Applications to Submodular Flow Problems.
Harold N. Gabow
1993A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps.
Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia
1993An Efficient Protocol for Unconditionally Secure Secret Key Exchange.
Michael J. Fischer, Rebecca N. Wright
1993An O(n
Elaine M. Eschen, Jeremy P. Spinrad
1993Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs.
Alan M. Frieze, A. J. Radcliffe, Stephen Suen
1993Approximate Nearest Neighbor Queries in Fixed Dimensions.
Sunil Arya, David M. Mount
1993Balancing Minimum Spanning and Shortest Path Trees.
Samir Khuller, Balaji Raghavachari, Neal E. Young
1993Chernoff-Hoeffding Bounds for Applications with Limited Independence.
Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
1993Competitive Implementation of Parallel Programs.
Xiaotie Deng, Elias Koutsoupias
1993Confluently Persistent Deques via Data Structural Bootstrapping.
Adam L. Buchsbaum, Robert Endre Tarjan
1993Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces.
Peter N. Yianilos
1993Data Structures for Traveling Salesmen.
Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer
1993Dynamic Generation of Discrete Random Variates.
Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni
1993Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces.
Jörg Heistermann, Thomas Lengauer
1993Efficient Randomized Algorithms for the Repeated Median Line Estimator.
Jirí Matousek, David M. Mount, Nathan S. Netanyahu
1993Equidistribution of Point Sets for the Traveling Salesman and Related Problems.
Timothy Law Snyder, J. Michael Steele
1993Fast Construction of Irreducible Polynomials over Finite Fields.
Victor Shoup
1993Fast Deterministic Processor Allocation.
Torben Hagerup
1993Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions.
Paul B. Callahan, S. Rao Kosaraju
1993Finding Connected Components in O(log n log log n) Time on the EREW PRAM.
Ka Wong Chong, Tak Wah Lam
1993Finding Near-Optimal Cuts: An Empirical Evaluation.
Kevin J. Lang, Satish Rao
1993Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm.
David R. Karger
1993Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques.
Naveen Garg, Santosh S. Vempala, Aman Singla
1993Improved Dynamic Dictionary Matching.
Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer
1993Iterated Nearest Neighbors and Finding Minimal Polytopes.
David Eppstein, Jeff Erickson
1993Lower Bounds for Set Intersection Queries.
Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
1993Maxima in Convex Regions.
Mordecai J. Golin
1993Non-Clairvoyant Scheduling.
Rajeev Motwani, Steven J. Phillips, Eric Torng
1993On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions.
Bernard Chazelle, Jirí Matousek
1993On Traversing Layered Graphs On-line.
H. Ramesh
1993On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas.
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1993On-line Choice of On-line Algorithms.
Yossi Azar, Andrei Z. Broder, Mark S. Manasse
1993Optimal Edge Ranking of Trees in Polynomial Time.
Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer
1993Optimistic Sorting and Information Theoretic Complexity.
Peter M. McIlroy
1993Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology.
Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser
1993Polygonal Approximations that Minimize the Number of Inflections.
John D. Hobby
1993Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs.
Franz Höfting, Egon Wanke
1993Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA.
Vijaya Ramachandran
1993Random Weighted Laplacians, Lovász Minimum Digraphs and Finding Minimum Separators.
Joseph Cheriyan
1993Randomized Data Structures for the Dynamic Closest-Pair Problem.
Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1993Ray Shooting Amidst Convex Polytopes in Three Dimensions.
Pankaj K. Agarwal, Micha Sharir
1993Scaling Algorithms for the Shortest Paths Problem.
Andrew V. Goldberg
1993Scapegoat Trees.
Igal Galperin, Ronald L. Rivest
1993Scheduling Unrelated Machines with Costs.
David B. Shmoys, Éva Tardos
1993Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem.
Ming-Yang Kao, John H. Reif, Stephen R. Tate
1993Solving Mixed 0-1 Programs by a Lift-and-Project Method.
Egon Balas, Sebastián Ceria, Gérard Cornuéjols
1993The Stanford GraphBase: A Platform for Combinatorial Algorithms.
Donald E. Knuth
1993The Suffix of a Square Matrix, with Applications.
Raffaele Giancarlo
1993The Vertex-Disjoint Menger Problem in Planar Graphs.
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1993Tree Compatibility and Inferring Evoluationary History.
Tandy J. Warnow
1993Triangulating Vertex Colored Graphs.
Fred R. McMorris, Tandy J. Warnow, Thomas Wimer
1993Upper and Lower Bounds on Constructing Alphabetic Binary Trees.
Maria M. Klawe, Brendan Mumey