default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st SODA 1990: San Francisco, California, USA
- David S. Johnson:
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1990, San Francisco, California, USA. SIAM 1990, ISBN 0-89871-251-3 - David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. 1-11 - Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Incremental Algorithms for Minimal Length Paths. 12-21 - Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter:
A Data Structure for Arc Insertion and Regular Path Finding. 22-31 - Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck:
Incremental Evaluation of Computational Circuits. 32-42 - Andrei Z. Broder, Anna R. Karlin:
Multilevel Adaptive Hashing. 43-53 - Johannes A. La Poutré:
New Techniques for the Union-Find Problems. 54-63 - Daniel M. Yellin:
Representing Sets with Constant Time Equality Testing. 64-73 - Siu-Wing Cheng, Ravi Janardan:
Efficient Maintenance of the Union Intervals on a Line, with Applications. 74-83 - Kenneth J. Supowit:
New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems. 84-90 - Jon Louis Bentley:
Experiments on Traveling Salesman Heuristics. 91-99 - Mike Paterson, F. Frances Yao:
Optimal Binary Space Partitions for Orthogonal Objects. 100-106 - Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman:
Visibility with a Moving Point of View. 107-117 - Michael T. Goodrich:
Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry. 118-128 - Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes. 129-137 - Walter Schnyder:
Embedding Planar Graphs on the Grid. 138-148 - Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee:
An Optimal Algorithm for the Maximum Two-Chain Problem. 149-158 - Robert L. (Scot) Drysdale III:
A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions. 159-168 - Leonidas J. Guibas, John Hershberger, Jack Snoeyink:
Compact Interval Trees: A Data Structure for Convex Hulls. 169-178 - Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine:
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. 179-187 - John Cremona, Susan Landau:
Shrinking Lattice Polyhedra. 188-193 - James L. Hafner, Kevin S. McCurley:
Asymptotically Fast Triangularization of Matrices Over Rings. 194-200 - Eric Bach, James R. Driscoll, Jeffrey O. Shallit:
Factor Refinement. 201-211 - Paul Beame, Michael Luby:
Parallel Search for Maximal Independence Given Minimal Dependence. 212-218 - Mark K. Goldberg, Thomas H. Spencer:
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. 219-225 - Craig A. Morgenstern, Harry Shapiro:
Coloration Neighborhood Structures for General Graph Coloring. 226-235 - Bonnie Berger, Peter W. Shor:
Approximation Algorithms for the Maximum Acyclic Subgraph Problem. 236-243 - Elias Dahlhaus, Marek Karpinski, Mark B. Novick:
Fast Parallel Algorithms for the Clique Separator Decomposition. 244-251 - Tze-Heng Ma, Jeremy P. Spinrad:
Split Decomposition of Undirected Graphs. 252-260 - Wansoo T. Rhee, Michel Talagrand:
Packing Random Items of Three Colors. 261-271 - Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton:
First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space. 272-279 - Piotr Berman, Howard J. Karloff, Gábor Tardos:
A Competitive 3-Server Algorithm. 280-290 - Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan:
New Results on Server Problems. 291-300 - Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
Competitive Randomized Algorithms for Non-Uniform Problems. 301-309 - Lawrence L. Larmore, Daniel S. Hirschberg:
Length-Limited Coding. 310-318 - Udi Manber, Gene Myers:
Suffix Arrays: A New Method for On-Line String Searches. 319-327 - Ricardo A. Baeza-Yates, Gaston H. Gonnet, Mireille Régnier:
Analysis of Boyer-Moore-Type String Searching Algorithms. 328-343 - Amihood Amir, Gad M. Landau, Uzi Vishkin:
Efficient Pattern Matching with Scaling. 344-357 - Ron Shamir, Brenda L. Dietrich:
Characterization and Algorithms for Greedily Solvable Transportation Problems. 358-366 - Serge A. Plotkin, Éva Tardos:
Improved Dual Network Simplex. 367-376 - Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos:
Using Separation Algorithms in Fixed Dimension. 377-387 - Michel X. Goemans, Dimitris Bertsimas:
On the Parsimonious Property of Connectivity Problems. 388-396 - Donald E. Knuth, Rajeev Motwani, Boris G. Pittel:
Stable Husbands. 397-404 - Christos H. Papadimitriou, Martha Sideri:
The Bisection Width of Grid Graphs. 405-410 - Arkady Kanevsky:
On the Number of Minimum Size Separating Vertex Sets in a Graph and How to Find All of Them. 411-421 - Dan Gusfield, Dalit Naor:
Efficient Algorithms for Generalized Cut Trees. 422-433 - Harold N. Gabow:
Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. 434-443 - Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki:
Finding Steiner Forests in Planar Graphs. 444-453 - Vwani P. Roychowdhury, Jehoshua Bruck:
On Finding Non-Intersecting Paths in Grids and Its Application in Reconfiguring VLSI/WSI Arrays. 454-464 - Charlotte Wieners-Lummer:
Manhattan Channel Routing with Good Theoretical and Practical Performance. 465-474 - Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow:
Determining the Evolutionary Tree. 475-484 - Maria M. Klawe:
Superlinear Bounds on Matrix Searching. 485-493 - Dina Kravets, James K. Park:
Selection and Sorting in Totally Monotone Arrays. 494-502 - Lawrence L. Larmore, Baruch Schieber:
On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. 503-512 - David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano:
Sparse Dynamic Programming. 513-522
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 2024-10-31 20:20 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:
