The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Discrete Algorithms (SODA) (soda)
1995 (conf/soda/95)

  1. William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan
    Design of Practical and Provably Good Random Number Generators (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:1-9 [Conf]
  2. Alan Siegel
    On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:10-19 [Conf]
  3. Arne Andersson, Ola Petersson
    On-line Approximate List Indexing with Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:20-27 [Conf]
  4. Dorit Dor, Uri Zwick
    Selecting the Median. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:28-37 [Conf]
  5. Gene Myers, Webb Miller
    Chaining Multiple-Alignment Fragments in Sub-Quadratic Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:38-47 [Conf]
  6. Martin Farach, Michiel O. Noordewier, Serap A. Savari, Larry A. Shepp, Aaron D. Wyner, Jacob Ziv
    On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:48-57 [Conf]
  7. Bonnie Berger, David Bruce Wilson
    Improved Algorithms for Protein Motif Recognition. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:58-67 [Conf]
  8. Sampath Kannan, Tandy Warnow, Shibu Yooseph
    Computing the Local Consensus of Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:68-77 [Conf]
  9. Alexander V. Karzanov, S. Thomas McCormick
    Polynomial Methods for Separable Convex Optimization in Unimodular Spaces. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:78-87 [Conf]
  10. Harold N. Gabow
    Algorithms for Graphic Polymatroids and Parametric s-Sets. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:88-97 [Conf]
  11. Maurice Queyranne
    A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:98-101 [Conf]
  12. Dimitris Bertsimas, Chung-Piaw Teo
    From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:102-111 [Conf]
  13. Olivier Coudert
    Doing Two-Level Logic Minimization 100 Times Faster. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:112-121 [Conf]
  14. Xiao Zhou, Takao Nishizeki
    Finding Optimal Edge-Rankings of Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:122-131 [Conf]
  15. Wayne Eberly
    Efficient Parallel Computations for Singular Band Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:132-138 [Conf]
  16. Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter
    External-Memory Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:139-149 [Conf]
  17. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
    Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:150-159 [Conf]
  18. Magnús M. Halldórsson
    Approximating Discrete Collections via Local Improvements. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:160-169 [Conf]
  19. Neal E. Young
    Randomized Rounding Without Solving the Linear Program. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:170-178 [Conf]
  20. George S. Lueker
    Average-Case Analysis of Off-Line and On-Line Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:179-188 [Conf]
  21. Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert
    Dihedral Bounds for Mesh Generation in High Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:189-196 [Conf]
  22. L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
    Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:197-204 [Conf]
  23. Karen Daniels, Victor Milenkovic
    Multiple Translational Containment: Approximate and Exact Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:205-214 [Conf]
  24. Gautam Das, Giri Narasimhan, Jeffrey S. Salowe
    A New Way to Weigh Malnourished Euclidean Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:215-222 [Conf]
  25. Jonathan W. Berry, Mark K. Goldberg
    Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:223-232 [Conf]
  26. Stephen Guattery, Gary L. Miller
    On the Performance of Spectral Graph Partitioning Methods. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:233-242 [Conf]
  27. Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
    Guaranteeing Fair Service to Persistent Dependent Tasks. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:243-252 [Conf]
  28. David Keith Maslen, Daniel N. Rockmore
    Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:253-262 [Conf]
  29. Paul B. Callahan, S. Rao Kosaraju
    Algorithms for Dynamic Closest Pair and n-Body Potential Fields. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:263-272 [Conf]
  30. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
    Circular Separability of Polygon. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:273-281 [Conf]
  31. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
    Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:282-291 [Conf]
  32. Danny Z. Chen
    On the All-Pairs Euclidean Short Path Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:292-301 [Conf]
  33. Yefim Dinitz, Alek Vainshtein
    Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:302-311 [Conf]
  34. David Alberts, Monika Rauch Henzinger
    Average Case Analysis of Dynamic Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:312-321 [Conf]
  35. Robert J. Cimikowski
    An Analysis of Some Heuristics for the Maximum Planar Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:322-331 [Conf]
  36. R. Ravi
    David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:332-341 [Conf]
  37. Vijay Chandru, Abhi Dattasharma, S. Sathiya Keerthi, N. K. Sancheti, V. Vinay
    Algorithms for the Optimal Loading of Recursive Neural Nets. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:342-349 [Conf]
  38. Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
    Using Network Flows for Surface Modeling. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:350-359 [Conf]
  39. Sampath Kannan, Todd A. Proebsting
    Register Allocation in Structured Programs. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:360-368 [Conf]
  40. Emanuel Knill
    Lower Bounds for Identifying Subset Members with Subset Queries. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:369-377 [Conf]
  41. Sairam Subramanian, Sridhar Ramaswamy
    The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. [Citation Graph (7, 0)][DBLP]
    SODA, 1995, pp:378-387 [Conf]
  42. Jeff Erickson
    Lower Bounds for Linear Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:388-395 [Conf]
  43. John Hershberger, Subhash Suri
    Morphing Binary Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:396-404 [Conf]
  44. Baruch Schieber
    Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:405-411 [Conf]
  45. Susanne Albers
    Improved Randomized On-Line Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:412-419 [Conf]
  46. William R. Burley, Sandy Irani
    On Algorithm Design for Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:420-429 [Conf]
  47. Edward F. Grove
    Online Bin Packing with Lookahead. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:430-436 [Conf]
  48. Gregory Dudek, Kathleen Romanik, Sue Whitesides
    Localizing a Robot with Minimum Travel. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:437-446 [Conf]
  49. John Hershberger, Subhash Suri
    Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:447-456 [Conf]
  50. Ernest F. Brickell, Peter Gemmell, David W. Kravitz
    Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:457-466 [Conf]
  51. Andrew Chou, Jeremy R. Cooperstock, Ran El-Yaniv, Michael Klugerman, Frank Thomson Leighton
    The Statistical Adversary Allows Optimal Money-Making Trading Strategies. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:467-476 [Conf]
  52. Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
    Fairness in Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:477-485 [Conf]
  53. Tomasz Radzik
    Fast Deterministic Approximation for the Multicommodity Flow Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:486-492 [Conf]
  54. Anil Kamath, Omri Palmon, Serge A. Plotkin
    Fast Approximation Algorithm for Minimum Cost Multicommodity Flow. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:493-501 [Conf]
  55. Anil Kamath, Omri Palmon
    Improved Interior Point Algorithms for Exact and Approximate Solution of Multicommodity Flow Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:502-511 [Conf]
  56. Bruce Hoppe, Éva Tardos
    The Quickest Transshipment Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:512-521 [Conf]
  57. Dennis Grinberg, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan, Victor K. Wei
    Splay Trees for Data Compression. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:522-530 [Conf]
  58. Paolo Ferragina, Roberto Grossi
    Fast Incremental Text Editing. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:531-540 [Conf]
  59. Brenda S. Baker
    Parameterized Pattern Matching by Boyer-Moore-Type Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:541-550 [Conf]
  60. Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney
    Counting and Random Generation of Strings in Regular Languages. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:551-557 [Conf]
  61. Nabil Kahale, Frank Thomson Leighton
    Greedy Dynamic Routing on Arrays. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:558-566 [Conf]
  62. Yonatan Aumann, Yuval Rabani
    Improved Bounds for All Optical Routing. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:567-576 [Conf]
  63. Iris Gaber, Yishay Mansour
    Broadcast in Radio Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:577-585 [Conf]
  64. James D. Fix, Richard E. Ladner
    Optimal One-Way Sorting on a One-Dimensional Sub-Bus Array. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:586-594 [Conf]
  65. Sampath Kannan, Tandy Warnow
    A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:595-603 [Conf]
  66. John D. Kececioglu, R. Ravi
    Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:604-613 [Conf]
  67. Vineet Bafna, Pavel A. Pevzner
    Sorting Permutations by Transpositions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:614-623 [Conf]
  68. Martin Fürer
    Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:624-631 [Conf]
  69. David Eppstein
    Subgraph Isomorphism in Planar Graphs and Related Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:632-640 [Conf]
  70. Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
    Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:641-649 [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