Journal: ACM Transactions on Algorithms

Volume 2, Issue 4

491 -- 0Alejandro López-Ortiz, J. Ian Munro. Foreword
492 -- 509David Eppstein. Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
510 -- 534Richard F. Geary, Rajeev Raman, Venkatesh Raman. Succinct ordinal trees with level-ancestor queries
535 -- 556Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick. Melding priority queues
557 -- 577Surender Baswana, Sandeep Sen. Approximate distance oracles for unweighted graphs in expected ::::O::::(::::n:::::::2:::) time
578 -- 601Camil Demetrescu, Giuseppe F. Italiano. Experimental analysis of dynamic all pairs shortest path algorithms
602 -- 610Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. Rank-maximal matchings
611 -- 639Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter. When indexing equals compression: Experiments with compressing suffix arrays and applications
640 -- 660Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor. A general approach to online network optimization problems
661 -- 678William S. Evans, David G. Kirkpatrick. Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ
679 -- 706René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking. Computing equilibria for a service provider game with (Im)perfect information
707 -- 723Cristopher Moore, Daniel N. Rockmore, Alexander Russell. Generic quantum Fourier transforms