ACM Transactions on Algorithms, Volume 4

Volume 4, Number 1, March 2008

• Milan Ruzic:
  Uniform deterministic dictionaries.
  Electronic Edition (ACM DL) BibTeX
• Gianni Franceschini, Roberto Grossi:
  No sorting? better searching!.
  Electronic Edition (ACM DL) BibTeX
• Haim Kaplan, Robert Endre Tarjan:
  Thin heaps, thick heaps.
  Electronic Edition (ACM DL) BibTeX
• Jérémy Barbay, Claire Kenyon:
  Alternation and redundancy analysis of the intersection problem.
  Electronic Edition (ACM DL) BibTeX
• Seth Pettie, Vijaya Ramachandran:
  Randomized minimum spanning tree algorithms using exponentially fewer random bits.
  Electronic Edition (ACM DL) BibTeX
• Liam Roditty:
  A faster and simpler fully dynamic transitive closure.
  Electronic Edition (ACM DL) BibTeX
• Harold N. Gabow, Shuxin Nie:
  Finding a long directed cycle.
  Electronic Edition (ACM DL) BibTeX
• Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian:
  Rectangular layouts and contact graphs.
  Electronic Edition (ACM DL) BibTeX
• Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
  The priority R-tree: A practically efficient and worst-case optimal R-tree.
  Electronic Edition (ACM DL) BibTeX
• Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
  Approximate distance oracles for geometric spanners.
  Electronic Edition (ACM DL) BibTeX
• Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
  Improved bounds for scheduling conflicting jobs with minsum criteria.
  Electronic Edition (ACM DL) BibTeX
• Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Jim Pugh:
  The collective memory of amnesic processes.
  Electronic Edition (ACM DL) BibTeX
• George Karakostas:
  Faster approximation schemes for fractional multicommodity flow problems.
  Electronic Edition (ACM DL) BibTeX
• Daniel Lemire, Owen Kaser:
  Hierarchical bin buffering: Online local moments for dynamic external memory arrays.
  Electronic Edition (ACM DL) BibTeX
• Elliot Anshelevich, Lisa Zhang:
  Path decomposition under a new cost measure with applications to optical network design.
  Electronic Edition (ACM DL) BibTeX

Volume 4, Number 2, May 2008

• Adam L. Buchsbaum:
  Guest editorial.
  Electronic Edition (ACM DL) BibTeX
• Daniel K. Blandford, Guy E. Blelloch:
  Compact dictionaries for variable-length keys and data with applications.
  Electronic Edition (ACM DL) BibTeX
• Ravi Krishna Kolluri:
  Provably good moving least squares.
  Electronic Edition (ACM DL) BibTeX
• Éric Fusy, Gilles Schaeffer, Dominique Poulalhon:
  Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling.
  Electronic Edition (ACM DL) BibTeX
• László A. Végh, András A. Benczúr:
  Primal-dual approach for directed vertex connectivity augmentation and generalizations.
  Electronic Edition (ACM DL) BibTeX
• Peter Sanders, David Steurer:
  An asymptotic approximation scheme for multigraph edge coloring.
  Electronic Edition (ACM DL) BibTeX
• Shuchi Chawla, Anupam Gupta, Harald Räcke:
  Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut.
  Electronic Edition (ACM DL) BibTeX
• Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha:
  On the approximability of some network design problems.
  Electronic Edition (ACM DL) BibTeX
• Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni:
  Limitations of cross-monotonic cost-sharing schemes.
  Electronic Edition (ACM DL) BibTeX

Volume 4, Number 3, June 2008

• Yefim Dinitz, Shay Solomon:
  Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem.
  Electronic Edition (ACM DL) BibTeX
• Laurent Alonso, Edward M. Reingold:
  Determining plurality.
  Electronic Edition (ACM DL) BibTeX
• Laurent Alonso, Edward M. Reingold:
  Average-case lower bounds for the plurality problem.
  Electronic Edition (ACM DL) BibTeX
• Hsueh-I Lu, Chia-Chi Yeh:
  Balanced parentheses strike back.
  Electronic Edition (ACM DL) BibTeX
• Liam Roditty, Mikkel Thorup, Uri Zwick:
  Roundtrip spanners and roundtrip routing in directed graphs.
  Electronic Edition (ACM DL) BibTeX
• Qian-Ping Gu, Hisao Tamaki:
  Optimal branch-decomposition of planar graphs in O(n³) Time.
  Electronic Edition (ACM DL) BibTeX
• Artur Czumaj, Christian Sohler:
  Testing Euclidean minimum spanning trees in the plane.
  Electronic Edition (ACM DL) BibTeX
• Veli Mäkinen, Gonzalo Navarro:
  Dynamic entropy-compressed sequences and full-text indexes.
  Electronic Edition (ACM DL) BibTeX
• Dariusz R. Kowalski, Alexander A. Shvartsman:
  Writing-all deterministically and optimally using a nontrivial number of asynchronous processors.
  Electronic Edition (ACM DL) BibTeX
• Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko:
  Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.
  Electronic Edition (ACM DL) BibTeX
• Cun-Quan Zhang, Yongbin Ou:
  Clustering, community partition and disjoint spanning trees.
  Electronic Edition (ACM DL) BibTeX
• Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang:
  Improved algorithms for the minmax-regret 1-center and 1-median problems.
  Electronic Edition (ACM DL) BibTeX
• Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
  Compact name-independent routing with minimum stretch.
  Electronic Edition (ACM DL) BibTeX
• Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
  Getting the best response for your erg.
  Electronic Edition (ACM DL) BibTeX