The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Symposium on Discrete Algorithms (SODA) (soda)
1994 (conf/soda/94)

  1. Daniel P. Huttenlocher, Jon M. Kleinberg
    Comparing Point Sets Under Projection. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:1-7 [Conf]
  2. Jon M. Kleinberg
    On-line Search in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:8-15 [Conf]
  3. Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra
    On Degeneracy in Geometric Computations. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:16-23 [Conf]
  4. Pankaj K. Agarwal, Subhash Suri
    Surface Approximation and Geometric Partitions. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:24-33 [Conf]
  5. Sigal Ar, Jin-yi Cai
    Reliable Benchmarks Using Numerical Instability. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:34-43 [Conf]
  6. Mihail N. Kolountzakis
    An Effective Additive Basis for the Integers. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:44-47 [Conf]
  7. Eric Bach
    Exact Analysis of a Priority Queue Algorithm for Random Variate Generation. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:48-56 [Conf]
  8. Katalin Friedl, Zsolt Hátsági, Alexander Shen
    Low-degree Tests. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:57-64 [Conf]
  9. Samuel R. Buss, Peter N. Yianilos
    Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:65-76 [Conf]
  10. David Eppstein
    Average Case Analysis of Dynamic Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:77-86 [Conf]
  11. Alon Efrat, Micha Sharir
    A Near-Linear Algorithm for the Planar Segment Center Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:87-97 [Conf]
  12. Rex A. Dwyer, William F. Eddy
    Maximal Empty Ellipsoids. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:98-102 [Conf]
  13. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
    Recognizing Balanced 0, +/- Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:103-111 [Conf]
  14. John Turek, Uwe Schwiegelshohn, Joel L. Wolf, Philip S. Yu
    Scheduling Parallel Tasks to Minimize Average Response Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:112-121 [Conf]
  15. David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter
    Minimizing Channel Density by Lateral Shifting of Components. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:122-131 [Conf]
  16. David R. Karger, Steven J. Phillips, Eric Torng
    A Better Algorithm for an Ancient Scheduling Problem. [Citation Graph (1, 0)][DBLP]
    SODA, 1994, pp:132-140 [Conf]
  17. Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
    On the Greedy Heuristic for Matchings. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:141-149 [Conf]
  18. Barun Chandra, Howard J. Karloff, Craig A. Tovey
    New Results on the Old k-Opt Algorithm for the TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:150-159 [Conf]
  19. David Eppstein
    Clustering for Faster Network Simplex Pivots. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:160-166 [Conf]
  20. Walter Ludwig, Prasoon Tiwari
    Scheduling Malleable and Nonmalleable Parallel Tasks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:167-176 [Conf]
  21. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Approximating the Minimum Equivalent Diagraph. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:177-186 [Conf]
  22. Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
    Approximate Data Structures with Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:187-194 [Conf]
  23. S. Rao Kosaraju
    An Optimal RAM Implementation of Catenable Min Double-ended Queues. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:195-203 [Conf]
  24. Johannes A. La Poutré, Jeffery Westbrook
    Dynamic Two-Connectivity with Backtracking. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:204-212 [Conf]
  25. Kurt Mehlhorn, R. Sundar, Christian Uhrig
    Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:213-222 [Conf]
  26. Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
    Improved Approximation Algorithms for Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:223-232 [Conf]
  27. Manica Aggarwal, Naveen Garg
    A Scaling Technique for Better Network Design. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:233-240 [Conf]
  28. Michael T. Goodrich, Yossi Matias, Uzi Vishkin
    Optimal Parallel Approximation for Prefix Sums and Integer Sorting. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:241-250 [Conf]
  29. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
    Neighborhood Preserving Hashing and Approximate Queries. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:251-259 [Conf]
  30. Victor Y. Pan
    New Techniques for Approximating Complex Polynomial Zeros. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:260-270 [Conf]
  31. Don Coppersmith, C. Andrew Neff
    Roots of a Polynomial and its Derivatives. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:271-279 [Conf]
  32. Giovanni Gallo, Bhubaneswar Mishra
    The Complexity of Resolvent Resolved. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:280-289 [Conf]
  33. John H. Reif, Stephen R. Tate
    Dynamic Algebraic Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:290-301 [Conf]
  34. Richard J. Lipton, Andrew Tomkins
    Online Interval Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:302-311 [Conf]
  35. Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén
    Competitive Non-Preemptive Call Control. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:312-320 [Conf]
  36. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
    Competitive Routing of Virtual Circuits with Unknown Duration. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:321-327 [Conf]
  37. Lisa Hellerstein, Collette R. Coullard
    Learning Binary Matroid Ports. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:328-335 [Conf]
  38. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    Approximately Counting Hamilton Cycles in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:336-343 [Conf]
  39. Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
    Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:344-354 [Conf]
  40. David P. Williamson, Michel X. Goemans
    Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:355-364 [Conf]
  41. Piotr Berman, Martin Fürer
    Approximating Maximum Independent Set in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:365-371 [Conf]
  42. Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
    Optimal Constructions of Hybrid Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:372-381 [Conf]
  43. Carsten Lund, Nick Reingold
    Linear Programs for Randomized On-Line Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:382-391 [Conf]
  44. P. Krishnan, Jeffrey Scott Vitter
    Optimal Prediction for Prefetching in the Worst Case. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:392-401 [Conf]
  45. Prasad Tetali
    Design of On-line Algorithms Using Hitting Times. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:402-411 [Conf]
  46. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
    Efficient Routing and Scheduling Algorithms for Optical Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:412-423 [Conf]
  47. David R. Karger
    Using Randomized Sparsification to Approximate Minimum Cuts. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:424-432 [Conf]
  48. Bruce Hoppe, Éva Tardos
    Polynomial Time Algorithms for Some Evacuation Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:433-441 [Conf]
  49. Joseph Cheriyan
    A Las Vegas O(n2.38) Algorithm for the Cardinality of a Maximum Matching. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:442-451 [Conf]
  50. Keith D. Gremban, Gary L. Miller, Shang-Hua Teng
    Moments of Inertia and Graph Separators. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:452-461 [Conf]
  51. Serge A. Plotkin, Satish Rao, Warren D. Smith
    Shallow Excluded Minors and Improved Graph Decompositions. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:462-470 [Conf]
  52. John D. Kececioglu, Dan Gusfield
    Reconstructing a History of Recombinations from a Set of Sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:471-480 [Conf]
  53. Martin Farach, Mikkel Thorup
    Fast Comparison of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:481-488 [Conf]
  54. Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig
    Physical Mapping of Chromosomes Using Unique Probes. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:489-500 [Conf]
  55. Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
    The Subtree Max Gap Problem with Application to Parallel String Covering. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:501-510 [Conf]
  56. Dennis Moore, William F. Smyth
    Computing the Covers of a String in Linear Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:511-515 [Conf]
  57. Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
    Shortest Paths Algorithms: Theory and Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:516-525 [Conf]
  58. Andrew V. Goldberg, Alexander V. Karzanov
    Path Problems in Skew-Symmetric Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:526-535 [Conf]
  59. Ross M. McConnell, Jeremy Spinrad
    Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:536-545 [Conf]
  60. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Spanning Trees Short or Small. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:546-555 [Conf]
  61. Guy Kortsarz, David Peleg
    Generating Low-Degree 2-Spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:556-563 [Conf]
  62. Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon
    Selection in the Presence of Noise: The Design of Playoff Systems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:564-572 [Conf]
  63. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
    An Optimal Algorithm for Approximate Nearest Neighbor Searching. [Citation Graph (2, 0)][DBLP]
    SODA, 1994, pp:573-582 [Conf]
  64. Mor Harchol-Balter, Paul E. Black
    Queueing Analysis of Oblivious Packet-Routing Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:583-592 [Conf]
  65. Dana Randall, Alistair Sinclair
    Testable Algorithms for Self-Avoiding Walks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:593-602 [Conf]
  66. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    Optimal Construction of Edge-Disjoint Paths in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:603-612 [Conf]
  67. Rajeev Raman, Uzi Vishkin
    Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:613-621 [Conf]
  68. Vijaya Ramachandran, Honghua Yang
    An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:622-631 [Conf]
  69. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
    A Sublinear Parallel Algorithm for Stable Matching. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:632-637 [Conf]
  70. Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
    The QRQW PRAM: Accounting for Contention in Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:638-648 [Conf]
  71. Victor Y. Pan, Isdor Sobze, Antoine Atinkpahoun
    Optimum Parallel Computations with Banded Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:649-658 [Conf]
  72. Alok Aggarwal, C. Greg Plaxton
    Optimal Parallel Sorting in Multi-Level Storage. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:659-668 [Conf]
  73. Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
    Derandomizing Algorithms for Routing and Sorting on Meshes. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:669-679 [Conf]
  74. S. Muthukrishnan
    On Optimal Strategies for Searching in Presence of Errors. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:680-689 [Conf]
  75. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
    Matching Nuts and Bolts. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:690-696 [Conf]
  76. Ming Gu, Martin Farach, Richard Beigel
    An Efficient Algorithm for Dynamic Text Indexing. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:697-704 [Conf]
  77. Amihood Amir, Gary Benson, Martin Farach
    Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:705-714 [Conf]
  78. Juha Kärkkäinen, Esko Ukkonen
    Two and Higher Dimensional Pattern Matching in Optimal Expected Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:715-723 [Conf]
  79. Michael Luby, Joseph Naor, Ariel Orda
    Tight Bounds for Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:724-732 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002