Journal: Journal of the ACM

Volume 45, Issue 6

891 -- 923Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu. An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions
924 -- 964Marco Pellegrini. Electrostatic Fields Without Singularities: Theory, Algorithms and Error Analysis
965 -- 981Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan. Private Information Retrieval
983 -- 1006Michael J. Kearns. Efficient Noise-Tolerant Learning from Statistical Queries
1007 -- 1049Leo Bachmair, Harald Ganzinger. Ordered Chaining Calculi for First-Order Theories of Transitive Relations
1050 -- 1075Richard M. Karp, Yangun Zhang. On Parallel Evaluation of Game Trees

Volume 45, Issue 5

753 -- 782Sanjeev Arora. Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems
783 -- 797Andrew V. Goldberg, Satish Rao. Beyond the Flow Decomposition Barrier
798 -- 842Serge Abiteboul, Paris C. Kanellakis. Object Identity as a Query Language Primitive
843 -- 862Faith Ellen Fich, Maurice Herlihy, Nir Shavit. On the Space Complexity of Randomized Synchronization
863 -- 890Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki. Noise-Tolerant Distribution-Free Learning of General Geometric Concepts

Volume 45, Issue 4

557 -- 587Fong Pong, Michel Dubois. Formal Verification of Complex Coherence Protocols Using Symbolic State Models
588 -- 633Michael Kifer. On the Decidability and Axiomatization of Query Finiteness in Deductive Databases
634 -- 652Uriel Feige. A Threshold of ln ::::n:::: for Approximating Set Cover
653 -- 750Oded Goldreich, Shafi Goldwasser, Dana Ron. Property Testing and its Connection to Learning and Approximation

Volume 45, Issue 3

379 -- 380Joseph Y. Halpern. Time to Publication: A Progress Report
381 -- 414Paulo Fernandes, Brigitte Plateau, William J. Stewart. Efficient Descriptor-Vector Multiplications in Stochastic Automata Networks
415 -- 450James Aspnes. Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
451 -- 500Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg. Fault-Tolerant Wait-Free Shared Objects
501 -- 555Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy. Proof Verification and the Hardness of Approximation Problems

Volume 45, Issue 2

215 -- 245Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou. How to Learn an Unknown Environment I: The Rectilinear Case
246 -- 265David R. Karger, Rajeev Motwani, Madhu Sudan. Approximate Graph Coloring by Semidefinite Programming
266 -- 287Tamal K. Dey, Sumanta Guha. Computing Homology Groups of Simplicial Complexes in R:::3:::
288 -- 323Conrado Martínez, Salvador Roura. Randomized Binary Search Trees
324 -- 378Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman. On Contention Resolution Protocols and Associated Probabilistic Phenomena

Volume 45, Issue 1

1 -- 34Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong. Relational Expressive Power of Constraint Query Languages
35 -- 69Alan Fekete, M. Frans Kaashoek, Nancy A. Lynch. Implementing Sequentially Consistent Shared Objects using Broadcast and Point-to-Point Communication
70 -- 122Sanjeev Arora, Shmuel Safra. Probabilistic Checking of Proofs: A New Characterization of NP
123 -- 154Michael E. Saks, Aravind Srinivasan, Shiyu Zhou. Explicit OR-Dispersers with Polylogarithmic Degree
155 -- 178Jirí Síma, Jirí Wiedermann. Theory of Neuromata
179 -- 213Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. A New General Derandomization Method