The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Discrete Algorithms (SODA) (soda)
1990 (conf/soda/90)

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