Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd SODA 1991: San Francisco, California, USA
- Alok Aggarwal:
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 28-30 January 1991, San Francisco, California, USA. ACM/SIAM 1991, ISBN 0-89791-376-0 - Michiel H. M. Smid:
Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. 1-6 - Siu-Wing Cheng, Ravi Janardan:
Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications. 7-16 - Kenneth L. Clarkson:
Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations. 17-23 - Marco Pellegrini, Peter W. Shor:
Finding Stabbing Lines in 3-Dimensional Space. 24-31 - John Hershberger, Subhash Suri:
Offline Maintenance of Planar Configurations. 32-41 - Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman:
Matching Points into Noise Regions: Combinatorial Bounds and Algorithms. 42-51 - Robert F. Cohen, Roberto Tamassia:
Dynamic Expression Trees and their Applications (Extended Abstract). 52-61 - Jingsen Chen, Svante Carlsson:
On Partitions and Presortedness of Sequences. 62-71 - Tony W. Lai, Derick Wood:
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. 72-77 - Paul F. Dietz, Rajeev Raman:
Persistence, Amortization and Randomization. 78-88 - James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan:
Fully Persistent Lists with Catenation. 89-99 - Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson:
The Analysis of Multidimensional Searching in Quad-Trees. 100-109 - Tomasz Radzik, Andrew V. Goldberg:
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. 110-119 - Edith Cohen, Nimrod Megiddo:
Algorithms and Complexity Analysis for Some Flow Problems. 120-130 - Murali S. Kodialam, James B. Orlin:
Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming. 131-135 - Bonnie Berger, Lenore Cowen:
Complexity Results and Algorithms for { <, <=, = }-Constrained Scheduling. 137-147 - David B. Shmoys
, Clifford Stein, Joel Wein:
Improved Approximation Algorithms for Shop Scheduling Problems. 148-157 - Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung:
Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. 158-167 - Greg N. Frederickson:
Optimal Algorithms for Tree Partitioning. 168-177 - Pierre Kelsen, Vijaya Ramachandran:
On Finding Minimal 2-Connected Subgraphs. 178-187 - Farid Alizadeh:
A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs. 188-194 - Lenwood S. Heath:
Edge Coloring Planar Graphs with Two Outerplanar Subgraphs. 195-202 - Michael D. Hutton, Anna Lubiw:
Upward Planar Drawing of Single Source Acyclic Digraphs. 203-211 - Amihood Amir, Martin Farach:
Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. 212-223 - Richard Cole:
Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. 224-233 - Bala Kalyanasundaram, Kirk Pruhs:
On-Line Weighted Matching. 234-240 - Neal E. Young:
On-Line Caching as Cache Size Varies. 241-250 - Sandy Irani, Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator:
Randomized Competitive Algorithms for the List Update Problem. 251-260 - Amotz Bar-Noy, Baruch Schieber:
The Canadian Traveller Problem. 261-270 - Joseph Gil, Yossi Matias:
Fast Hashing on a PRAM - Designing by Expectation. 271-280 - Prakash V. Ramanan:
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem. 281-290 - William Aiello, Milena Mihail:
Learning the Fourier Spectrum of Probabilistic Lists and Trees. 291-299 - Marek Karpinski, Michael Luby:
Approximating the Number of Zeroes of a GF[2] Polynomial. 300-303 - Brendan D. McKay, Stanislaw P. Radziszowski:
The First Classical Ramsey Number for Hypergraphs is Computed. 304-308 - János Csirik, David S. Johnson:
Bounded Space On-Line Bin Packing: Best is Better than First. 309-319 - Nathan Linial, Michael E. Saks:
Decomposing Graphs into Regions of Small Diameter. 320-330 - Gary L. Miller, Stephen A. Vavasis:
Density Graphs and Separators. 331-336 - Sampath Kannan, Tandy J. Warnow:
Triangulating Three-Colored Graphs. 337-343 - Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu:
Tight Bounds for On-Line Tree Embeddings. 344-350 - Michael E. Saks, Nir Shavit, Heather Woll:
Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice. 351-362 - Tze-Heng Ma, Jeremy P. Spinrad:
An O(n2) Time Algorithm for the 2-Chain Cover Problem and Related Problems. 363-372 - Bonnie Berger:
The Fourth Moment Method. 373-383 - Dario Bini, Victor Y. Pan:
Parallel Complexity of Tridiagonal Symmetric Eigenvalue Problem. 384-393 - Mikhail J. Atallah, S. Rao Kosaraju:
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. 394-403 - Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal:
On the Parallel Complexity of Evaluating Game Trees. 404-413 - Philip D. MacKenzie, Quentin F. Stout:
Ultra-Fast Expected Time Parallel Algorithms. 414-423 - Thomas H. Spencer:
Time-Work Tradeoffs for Parallel Graph Algorithms. 425-432 - V. Chandru, R. Venkataraman:
Circular Hulls and Orbiforms of Simple Polygons. 433-440 - Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink:
Computing a Face in an Arrangement of Line Segments. 441-448 - Pankaj K. Agarwal, Micha Sharir:
Planar Geometric Location Problems and Maintaining the Width of a Planar Set. 449-458 - Jurek Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia:
The Aquarium Keeper's Problem. 459-464 - Yitzhak Birk, Jeffrey B. Lotspiech:
A Fast Algorithm for Connecting Grid Points to the Boundary with Nonintersecting Straight Lines. 465-474 - Michael Formann, Dorothea Wagner, Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length. 475-482
a service of 
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-09-07 00:47 CEST 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:
