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