Journal: Journal of the ACM

Volume 53, Issue 6

881 -- 917Yehuda Lindell, Anna Lysyanskaya, Tal Rabin. On the composition of authenticated Byzantine Agreement
918 -- 936Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt. Linear work suffix array construction
937 -- 977Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(::::T::::)
978 -- 1012David B. Shmoys, Chaitanya Swamy. An approximation scheme for stochastic linear programming and its application to stochastic integer programs

Volume 53, Issue 5

707 -- 721Julia Chuzhoy, Joseph Naor. New hardness results for congestion minimization and machine scheduling
722 -- 744Benny Chor, Tamir Tuller. Finding a maximum likelihood tree is hard
745 -- 761Matthew Andrews, Lisa Zhang. Logarithmic hardness of the undirected edge-disjoint paths problem
762 -- 799Daniela Pucci de Farias, Nimrod Megiddo. Combining expert advice in reactive environments
800 -- 844Harold N. Gabow. Using expander graphs to find vertex connectivity
845 -- 879Avrim Blum, Tuomas Sandholm, Martin Zinkevich. Online algorithms for market clearing

Volume 53, Issue 4

533 -- 557Jinbo Xu, Bonnie Berger. Fast and accurate algorithms for protein side-chain packing
558 -- 655Oded Goldreich, Madhu Sudan. Locally testable codes and PCPs of almost-linear length
656 -- 680Jeffrey Scott Vitter, David A. Hutchinson. Distribution sort with randomized cycling
681 -- 705Amir M. Ben-Amram, Holger Petersen. Backing up in singly linked lists

Volume 53, Issue 3

307 -- 323Piotr Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation
324 -- 360Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan. Dependent rounding and its applications to approximation algorithms
361 -- 378Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph. Interface surfaces for protein-protein complexes
379 -- 405Ori Shalev, Nir Shavit. Split-ordered lists: Lock-free extensible hash tables
406 -- 436Mark-Jan Nederhof, Giorgio Satta. Probabilistic parsing strategies
437 -- 458René A. Sitters, Leen Stougie. The generalized two-server problem
459 -- 506Andrew M. Pitts. Alpha-structural recursion and induction
507 -- 531Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani. Computing with highly mixed states

Volume 53, Issue 2

207 -- 0Dan Suciu, Victor Vianu. Introduction
208 -- 237Albert Atserias, Anuj Dawar, Phokion G. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries
238 -- 272Georg Gottlob, Christoph Koch, Klaus U. Schulz. Conjunctive queries over trees
273 -- 305Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke. A characterization of first-order topological properties of planar spatial data

Volume 53, Issue 1

1 -- 65János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber. On the Sum-of-Squares algorithm for bin packing
66 -- 120Andrei A. Bulatov. A dichotomy theorem for constraint satisfaction problems on a 3-element set
121 -- 146Mark Scharbrodt, Thomas Schickinger, Angelika Steger. A new average case analysis for completion time scheduling
147 -- 183Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée. Hidden word statistics
184 -- 206Ashwin Nayak, Julia Salzman. Limits on the ability of quantum states to convey classical messages