Conferences in DBLP
William Aiello , Sivaramakrishnan Rajagopalan , Ramarathnam Venkatesan Design of Practical and Provably Good Random Number Generators (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Alan Siegel On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Ola Petersson On-line Approximate List Indexing with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit Dor , Uri Zwick Selecting the Median. [Citation Graph (0, 0)][DBLP ] Conf ] Gene Myers , Webb Miller Chaining Multiple-Alignment Fragments in Sub-Quadratic Time. [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] Bonnie Berger , David Bruce Wilson Improved Algorithms for Protein Motif Recognition. [Citation Graph (0, 0)][DBLP ] Conf ] Sampath Kannan , Tandy Warnow , Shibu Yooseph Computing the Local Consensus of Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander V. Karzanov , S. Thomas McCormick Polynomial Methods for Separable Convex Optimization in Unimodular Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow Algorithms for Graphic Polymatroids and Parametric s-Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Queyranne A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions. [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] Olivier Coudert Doing Two-Level Logic Minimization 100 Times Faster. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Zhou , Takao Nishizeki Finding Optimal Edge-Rankings of Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Wayne Eberly Efficient Parallel Computations for Singular Band Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] Magnús M. Halldórsson , Kazuo Iwano , Naoki Katoh , Takeshi Tokuyama Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson Approximating Discrete Collections via Local Improvements. [Citation Graph (0, 0)][DBLP ] Conf ] Neal E. Young Randomized Rounding Without Solving the Linear Program. [Citation Graph (0, 0)][DBLP ] Conf ] George S. Lueker Average-Case Analysis of Off-Line and On-Line Knapsack Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , L. Paul Chew , David Eppstein , Jim Ruppert Dihedral Bounds for Mesh Generation in High Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] Karen Daniels , Victor Milenkovic Multiple Translational Containment: Approximate and Exact Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Gautam Das , Giri Narasimhan , Jeffrey S. Salowe A New Way to Weigh Malnourished Euclidean Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan W. Berry , Mark K. Goldberg Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Guattery , Gary L. Miller On the Performance of Spectral Graph Partitioning Methods. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Alain J. Mayer , Baruch Schieber , Madhu Sudan Guaranteeing Fair Service to Persistent Dependent Tasks. [Citation Graph (0, 0)][DBLP ] Conf ] David Keith Maslen , Daniel N. Rockmore Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Paul B. Callahan , S. Rao Kosaraju Algorithms for Dynamic Closest Pair and n-Body Potential Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Jurek Czyzowicz , Olivier Devillers , Mariette Yvinec Circular Separability of Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] Danny Z. Chen On the All-Pairs Euclidean Short Path Problem. [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] David Alberts , Monika Rauch Henzinger Average Case Analysis of Dynamic Graph Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Robert J. Cimikowski An Analysis of Some Heuristics for the Maximum Planar Subgraph Problem. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ravi David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] Rolf H. Möhring , Matthias Müller-Hannemann , Karsten Weihe Using Network Flows for Surface Modeling. [Citation Graph (0, 0)][DBLP ] Conf ] Sampath Kannan , Todd A. Proebsting Register Allocation in Structured Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Emanuel Knill Lower Bounds for Identifying Subset Members with Subset Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Sairam Subramanian , Sridhar Ramaswamy The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. [Citation Graph (7, 0)][DBLP ] Conf ] Jeff Erickson Lower Bounds for Linear Satisfiability Problems. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Subhash Suri Morphing Binary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Schieber Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers Improved Randomized On-Line Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP ] Conf ] William R. Burley , Sandy Irani On Algorithm Design for Metrical Task Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Edward F. Grove Online Bin Packing with Lookahead. [Citation Graph (0, 0)][DBLP ] Conf ] Gregory Dudek , Kathleen Romanik , Sue Whitesides Localizing a Robot with Minimum Travel. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Subhash Suri Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3 . [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] 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 ] Conf ] Miklós Ajtai , James Aspnes , Moni Naor , Yuval Rabani , Leonard J. Schulman , Orli Waarts Fairness in Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Radzik Fast Deterministic Approximation for the Multicommodity Flow Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Anil Kamath , Omri Palmon , Serge A. Plotkin Fast Approximation Algorithm for Minimum Cost Multicommodity Flow. [Citation Graph (0, 0)][DBLP ] Conf ] Anil Kamath , Omri Palmon Improved Interior Point Algorithms for Exact and Approximate Solution of Multicommodity Flow Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Bruce Hoppe , Éva Tardos The Quickest Transshipment Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Dennis Grinberg , Sivaramakrishnan Rajagopalan , Ramarathnam Venkatesan , Victor K. Wei Splay Trees for Data Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Ferragina , Roberto Grossi Fast Incremental Text Editing. [Citation Graph (0, 0)][DBLP ] Conf ] Brenda S. Baker Parameterized Pattern Matching by Boyer-Moore-Type Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Sampath Kannan , Z. Sweedyk , Stephen R. Mahaney Counting and Random Generation of Strings in Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Nabil Kahale , Frank Thomson Leighton Greedy Dynamic Routing on Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Yonatan Aumann , Yuval Rabani Improved Bounds for All Optical Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Iris Gaber , Yishay Mansour Broadcast in Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] James D. Fix , Richard E. Ladner Optimal One-Way Sorting on a One-Dimensional Sub-Bus Array. [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] John D. Kececioglu , R. Ravi Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation. [Citation Graph (0, 0)][DBLP ] Conf ] Vineet Bafna , Pavel A. Pevzner Sorting Permutations by Transpositions. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Subgraph Isomorphism in Planar Graphs and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] 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 ] Conf ] 