Journal: Journal of the ACM

Volume 51, Issue 6

851 -- 898Cynthia Dwork, Moni Naor, Amit Sahai. Concurrent zero-knowledge
899 -- 942Oded Regev. New lattice-based cryptographic constructions
943 -- 967David Kempe, Jon M. Kleinberg, Alan J. Demers. Spatial gossip and resource location protocols
968 -- 992Camil Demetrescu, Giuseppe F. Italiano. A new approach to dynamic all pairs shortest paths
993 -- 1024Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs
1025 -- 1041Alan M. Frieze, Ravi Kannan, Santosh Vempala. Fast monte-carlo algorithms for finding low-rank approximations

Volume 51, Issue 5

699 -- 730Vladlen Koltun. Almost tight upper bounds for vertical decompositions in four dimensions
731 -- 779Valter Crescenzi, Giansalvatore Mecca. Automatic information extraction from large websites
780 -- 799Shlomi Dolev, Jennifer L. Welch. Self-stabilizing clock synchronization in the presence of Byzantine faults
800 -- 849Robert C. Steinke, Gary J. Nutt. A unified theory of shared memory consistency

Volume 51, Issue 4

517 -- 539Luca Becchetti, Stefano Leonardi. Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
540 -- 556Dimitris Bertsimas, Santosh Vempala. Solving convex programs by random walks
557 -- 594Ran Canetti, Oded Goldreich, Shai Halevi. The random oracle methodology, revisited
595 -- 605Scott Aaronson, Yaoyun Shi. Quantum lower bounds for the collision and the element distinctness problems
606 -- 635Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan. Approximating extent measures of points
636 -- 670Jan M. Hochstein, Karsten Weihe. Edge-disjoint routing in plane switch graphs in linear time
671 -- 697Mark Jerrum, Alistair Sinclair, Eric Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

Volume 51, Issue 3

363 -- 384Jochen Alber, Michael R. Fellows, Rolf Niedermeier. Polynomial-time data reduction for dominating set
385 -- 463Daniel A. Spielman, Shang-Hua Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
464 -- 482Peter Bürgisser, Martin Lotz. Lower bounds on the bounded coefficient complexity of bilinear maps
483 -- 496Wojciech Plandowski. Satisfiability of word equations with constants is in PSPACE
497 -- 515Ravi Kannan, Santosh Vempala, Adrian Vetta. On clusterings: Good, bad and spectral

Volume 51, Issue 2

115 -- 138Ran Raz. Resolution lower bounds for the weak pigeonhole principle
139 -- 186Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky. Lenses in arrangements of pseudo-circles and their applications
187 -- 230Johan Håstad, Mats Näslund. The security of all RSA and discrete log bits
231 -- 262Moni Naor, Omer Reingold. Number-theoretic constructions of efficient pseudo-random functions
263 -- 280Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan. Segmentation problems
281 -- 311Albert Atserias. On sufficient conditions for unsatisfiability of random formulas
312 -- 362Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick. Existential second-order logic over graphs: Charting the tractability frontier

Volume 51, Issue 1

1 -- 0. Foreword
2 -- 45Gerome Miklau, Dan Suciu. Containment and equivalence for a fragment of XPath
46 -- 73Chung-Min Chen, Christine T. Cheng. From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries
74 -- 113Georg Gottlob, Christoph Koch. Monadic datalog and the expressive power of languages for Web information extraction