The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Discrete Algorithms (SODA) (soda)
1991 (conf/soda/91)

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