Table Of Content

SUBJECT INDEX CORRIGENDUM R. Fagin and J. Y. Halpern—Reasoning about Knowledge and Probability DEDICATION In Memorium—Paris C. Kanellakis EDITORIAL J. Y. Halpern—Time to Publication: A Progress Report COMPLEXITY OF S. Arora—Polynomial Time Approximation Schemes for ALGORITHMS Euclidean Traveling Salesman and Other Geometric Problems X. Deng, T. Kameda, and C. Papadimitriou—How to Learn an Unknown Environment I: The Rectilinear Case D. Karger, R. Motwani, and M. Sudan—Approximate Graph Coloring by Semidefinite Programming COMPUTATIONAL S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and GEOMETRY A. Y. Wu—An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions T. K. Dey and S. Guha—Computing Homology Groups of Simpiicial Complexes in R® M. Pellegrini—Electrostatic Fields without Singularities: Theory, Algorithms and Error Analysis COMPUTER F. Pong and M. Dubois—Formal Verification of Complex ARCHITECTURE Coherence Protocols Using Symbolic State Models COMPUTER SYSTEM P. Fernandes, B. Plateau, and W. J. Stewart—Efficient MODELING AND Descriptor-Vector Multiplications in Stochastic Automata ANALYSIS Networks CRYPTOLOGY B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan—Private Information Retrieval DATA STRUCTURE AND A. V. Goldberg and S. Rao—Beyond the Flow ANALYSIS OF Decomposition Barrier ALGORITHMS C. Martinez and S. Roura—Randomized Binary Search Trees DATABASE THEORY S. Abiteboul and P. C. Kanellakis—Object Identity as a Query Language Primitive M. Benedikt, G. Dong, L. Libkin, and L. Wong—Relational Expressive Power of Constraint Query Languages M. Kifer—On the Decidability and Axiomatization of Query Finiteness in Deductive Databases DISTRIBUTED J. Aspnes—Lower Bounds for Distributed Coin-Flipping and COMPUTING Randomized Consensus A. Fekete, M. F. Kaashoek, and N. Lynch—Implementing Sequentially Consistent Shared Objects using Broadcast and Point-To-Point Communication F. Fich, M. Herlihy, and N. Shavit—On the Space Complexity of Randomized Synchronization P. Jayanti, T. D. Chandra, and S. Toueg—Fault-Tolerant Wait-Free Shared Objects FORMAL LANGUAGES S. Arora, C. Lund, R. Motwani, M. Sudan, and M. AND COMPLEXITY Szegedy—Proof Verification and the Hardness of THEORY Approximation Problems S. Arora and S. Safra—Probabilistic Checking of Proofs: A New Characterization of NP U. Feige—A Threshold of In n for Approximating Set Cover SUBJECT INDEX CORRIGENDUM R. Fagin and J. Y. Halpern—Reasoning about Knowledge and Probability DEDICATION In Memorium—Paris C. Kanellakis EDITORIAL J. Y. Halpern—Time to Publication: A Progress Report COMPLEXITY OF S. Arora—Polynomial Time Approximation Schemes for ALGORITHMS Euclidean Traveling Salesman and Other Geometric Problems X. Deng, T. Kameda, and C. Papadimitriou—How to Learn an Unknown Environment I: The Rectilinear Case D. Karger, R. Motwani, and M. Sudan—Approximate Graph Coloring by Semidefinite Programming COMPUTATIONAL S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and GEOMETRY A. Y. Wu—An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions T. K. Dey and S. Guha—Computing Homology Groups of Simpiicial Complexes in R® M. Pellegrini—Electrostatic Fields without Singularities: Theory, Algorithms and Error Analysis COMPUTER F. Pong and M. Dubois—Formal Verification of Complex ARCHITECTURE Coherence Protocols Using Symbolic State Models COMPUTER SYSTEM P. Fernandes, B. Plateau, and W. J. Stewart—Efficient MODELING AND Descriptor-Vector Multiplications in Stochastic Automata ANALYSIS Networks CRYPTOLOGY B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan—Private Information Retrieval DATA STRUCTURE AND A. V. Goldberg and S. Rao—Beyond the Flow ANALYSIS OF Decomposition Barrier ALGORITHMS C. Martinez and S. Roura—Randomized Binary Search Trees DATABASE THEORY S. Abiteboul and P. C. Kanellakis—Object Identity as a Query Language Primitive M. Benedikt, G. Dong, L. Libkin, and L. Wong—Relational Expressive Power of Constraint Query Languages M. Kifer—On the Decidability and Axiomatization of Query Finiteness in Deductive Databases DISTRIBUTED J. Aspnes—Lower Bounds for Distributed Coin-Flipping and COMPUTING Randomized Consensus A. Fekete, M. F. Kaashoek, and N. Lynch—Implementing Sequentially Consistent Shared Objects using Broadcast and Point-To-Point Communication F. Fich, M. Herlihy, and N. Shavit—On the Space Complexity of Randomized Synchronization P. Jayanti, T. D. Chandra, and S. Toueg—Fault-Tolerant Wait-Free Shared Objects FORMAL LANGUAGES S. Arora, C. Lund, R. Motwani, M. Sudan, and M. AND COMPLEXITY Szegedy—Proof Verification and the Hardness of THEORY Approximation Problems S. Arora and S. Safra—Probabilistic Checking of Proofs: A New Characterization of NP U. Feige—A Threshold of In n for Approximating Set Cover O. Goldreich, S. Goldwasser, and D. Ron—Property Testing and Its Connection to Learning and Approximation M. Kearns—Efficient Noise-Tolerant Learning from Statistical Queries M. Saks, A. Srinivasan, and S. Zhou—Explicit OR- Dispersers with Polygarithmic Degree J. Sima and J. Wiedermann—tTheory of Neuromata GRAPH THEORY AND A. E. Andreev, A. E. F. Clementi, and J. D. P. Rolim—A New COMBINATORIAL General Derandomization Method STRUCTURES LOGIC IN COMPUTER L. Bachmair and H. Ganzinger—Ordered Chaining Calculi SCIENCE for First-Order Theories of Transitive Relations MACHINE LEARNING N. H. Bshouty, S. A. Goldman, H. D. Mathias, S. Suri, and AND COMPUTATIONAL H. Tamaki—Noise-Tolerant Distribution-Free Learning of LEARNING General Geometric Concepts PARALLEL R. M. Karp and Y. Zhang—On Parallel Evaluation of Game ALGORITHMS Trees PARALLEL P. D. MacKenzie, C. G. Plaxton, and R. Rajaraman—On COMPUTATION Contention Resolution Protocols and Associated Probabilistic Phenomena AUTHOR INDEX In Memorium—Paris C. Kanellakis ABITEBOUL, S. Object Identity as a Query Language Primitive ANDREEV, A. E. A New General Derandomization Method ARORA, S. Probabilistic Checking of Proofs: A New Characterization of NP Proof Verification and the Hardness of Approximation Problems Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems ARYA, S. An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions ASPNES, J. Lower Bounds for Distributed Coin-Flipping and Randomized Consensus BACHMAIR, L. Ordered Chaining Calculi for First-Order Theories of Transitive Relations BENEDIKT, M. Relational Expressive Power of Constraint Query Languages BSHOUTY, N. H. Noise-Tolerant Distribution-Free Learning of General Geometric Concepts CHANDRA, T. D. See Jayanti, P. CHOR, B. Private Information Retrieval CLEMENTI, A. E. F. See Andreev, A. E. DENG, X. How to Learn an Unknown Environment |: The Rectilinear Case DEY, T. K. Computing Homology Groups of Simplicial Complexes in R® DONG, G. See Benedikt, M. DUBOIS, M. See Pong, F. FAGIN, R. Reasoning about Knowledge and Probability (corrigendum) FEIGE, U. A Threshold of In n for Approximating Set Cover FEKETE, A. Implementing Sequentially Consistent Shared Objects using Broadcast and Point-To-Point Communication FERNANDES, P. Efficient Descriptor-Vector Multiplications in Stochastic Automata Networks FICH, F. On the Space Complexity of Randomized Synchronization GANZINGER, H. See Bachmair, L. GOLDBERG, A. V. Beyond the Flow Decomposition Barrier GOLDMAN, S. A. See Bshouty, N. H. GOLDREICH, O. Property Testing and Its Connection to Learning and Approximation See Chor, B. GOLDWASSER, S. See Goldreich, O. GUHA, S. See Dey, T. K. HALPERN, J. Y. See Fagin, R. Time to Publication: A Progress Report HERLIHY, M. See Fich, F. JAYANTI, P. Fault-Tolerant Wait-Free Shared Objects KAASHOEK, M. F. See Fekete, A. KAMEDA, T. See Deng, X. KANELLAKIS, P. C. See Abiteboul, S. KARGER, D. Approximate Graph Coloring by Semidefinite Programming KARP, R. M. On Parallel Evaluation of Game Trees KEARNS, M. Efficient Noise-Tolerant Learning from Statistical Queries KIFER, M. On the Decidability and Axiomatization of Query Finiteness in Deductive Databases KUSHILEVITZ, E. See Chor, B. LIBKIN, L. See Benedikt, M. LUND, C. See Arora, S.—Proof Verification and the Hardness of Approximation Problems LYNCH, N. See Fekete, A. MACKENZIE, P. D. On Contention Resolution Protocols and Associated Probabilistic Phenomena MARTINEZ, C. Randomized Binary Search Trees MATHIAS, H. D. See Bshouty, N. H. MOTWANI, R. See Karger, D. : See Arora, S.—Proof Verification and the Hardness of Approximation Problems MOUNT, D. M. See Arya, S. NETANYAHU, N. S. See Arya, S. PAPADIMITRIOU, C. See Deng, X. PELLEGRINI, M. Electrostatic Fields without Singularities: Theory, Algorithms and Error Analysis PLATEAU, B. See Fernandes, P. PLAXTON, C. G. See MacKenzie, P. D. PONG, F. Formal Verification of Complex Coherence Protocols Using Symbolic State Models RAJARAMAN, R. See MacKenzie, P. D. RAO, S. See Goldberg, A. V. ROLIM, J. D. P. See Andreev, A. E. RON, D. See Goldreich, O. ROURA, S. See Martinez, C. SAFRA, S. See Arora, S.—Probabilistic Checking of Proofs: A New Characterization of NP SAKS, M. Explicit OR-Dispersers with Polygarithmic Degree SHAVIT, N. See Fich, F. SILVERMAN, R. See Arya, S. SiMA, J. Theory of Neuromata SRINIVASAN, A. See Saks, M. STEWART, W. J. See Fernandes, P. SUDAN, M. See Karger, D. See Arora, S.—Proof Verification and the Hardness of Approximation Problems See Chor, B. SURI, S. See Bshouty, N. H. SZEGEDY, M. See Arora, S.—Proof Verification and the Hardness of Approximation Problems TAMAKI, H. See Bshouty, N. H. TOUEG, S. See Jayanti, P. WIEDERMANN, J. See Sima, J. WONG, L. See Benedikt, M. WU, A. Y. See Arya, S. ZHANG, Y. See Karp, R. M. ZHOU, S. See Saks, M.