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