Journal: Journal of the ACM

Volume 42, Issue 6

1115 -- 1145Michel X. Goemans, David P. Williamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
1146 -- 1168Rusins Freivalds, Efim B. Kinber, Carl H. Smith. On the Impact of Forgetting on Learning Machines
1169 -- 1193Joan Boyar, Gilles Brassard, René Peralta. Subquadratic Zero-Knowledge
1194 -- 1230Jan A. Bergstra, J. V. Tucker. Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras
1231 -- 1274Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld. Computing With Faulty Shared Objects
1275 -- 1304Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt. Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems

Volume 42, Issue 5

935 -- 970Gagan L. Choudhury, Kin K. Leung, Ward Whitt. Calculating Normalization Constants of Closed Queueing Networks by Numerically Inverting Their Generating Functions
971 -- 983Elias Koutsoupias, Christos H. Papadimitriou. On the k-Server Conjecture
984 -- 1020Rakesh M. Verma. A Theory of Using History for Equational Systems with Applications
1021 -- 1058Baruch Awerbuch, David Peleg. Online Tracking of Mobile Users
1059 -- 1090Ewan D. Tempero, Richard E. Ladner. Recoverable Sequence Transmission Protocols
1091 -- 1106Nabil Kahale. Eigenvalues and Expansion of Regular Graphs
1107 -- 1113Michele Conforti, Gérard Cornuéjols. A Class of Logic Problems Solvable by Linear Programming

Volume 42, Issue 4

711 -- 740Georg Gottlob. Translating Default Logic into Standard Autoepistemic Logic
741 -- 843Michael Kifer, Georg Lausen, James Wu. Logical Foundations of Object-Oriented and Frame-Based Languages
844 -- 856Noga Alon, Raphael Yuster, Uri Zwick. Color-Coding
857 -- 907Costas Courcoubetis, Mihalis Yannakakis. The Complexity of Probabilistic Verification
908 -- 918Zvi Galil. A Constant-Time Optimal Parallel String-Matching Algorithm
919 -- 933Mark H. Nodine, Jeffrey Scott Vitter. Greed Sort: Optimal Deterministic Sorting on Parallel Disks

Volume 42, Issue 3

543 -- 561Peter van Beek, Rina Dechter. On the Minimality and Decomposability of Row-Convex Constraint Networks
562 -- 583Kevin J. Compton, Chinya V. Ravishankar. Expected Deadlock Time in a Multiprocessing System
584 -- 613Yannis A. Korilis, Aurel A. Lazar. On the Existence of Equilibria in Noncooperative Optimal Flow Control
614 -- 640Paul Bay, Gianfranco Bilardi. Deterministic On-Line Routing on Area-Universal Networks
641 -- 657Alexander Birman, H. Richard Gail, Sidney L. Hantler, Zvi Rosberg, Moshe Sidi. An Optimal Service Policy for Buffer Systems
658 -- 709Peter W. O Hearn, Robert D. Tennent. Parametricity and Local Variables

Volume 42, Issue 2

293 -- 320Fangzhen Lin, Yoav Shoham. Provably Correct Theories of Action
321 -- 328David R. Karger, Philip N. Klein, Robert Endre Tarjan. A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees
329 -- 381Ke Wang, Weining Zhang, Siu-Cheung Chau. Decomposition of Magic Rewriting
382 -- 400John N. Tsitsiklis, George D. Stamoulis. On the Average Communication Complexity of Asynchronous Distributed Algorithms
401 -- 420Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer. The Isomorphism Conjecture Fails Relative to a Random Oracle
421 -- 457Georg Gottlob. NP Trees and Carnap s Modal Logic
458 -- 487Rocco De Nicola, Frits W. Vaandrager. Three Logics for Branching Bisimulation
488 -- 499Kenneth L. Clarkson. Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small
500 -- 542Bonnie Berger, Martin L. Brady, Donna J. Brown, Frank Thomson Leighton. Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing

Volume 42, Issue 1

3 -- 42Thomas Eiter, Georg Gottlob. The Complexity of Logic-Based Abduction
43 -- 66Bernhard Nebel, Hans-Jürgen Bürckert. Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen s Interval Algebra
67 -- 90Paul B. Callahan, S. Rao Kosaraju. A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields
91 -- 123Andrew A. Chien, Jae H. Kim. Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors
124 -- 142Hagit Attiya, Amotz Bar-Noy, Danny Dolev. Sharing Memory Robustly in Message-Passing Systems
143 -- 185Danny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong. Dynamic Fault-Tolerant Clock Synchronization
186 -- 203Sibsankar Haldar, K. Vidyasankar. Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables
204 -- 231C. S. Chang, R. Nelson. Bounds on the Speedup and Efficiency of Partial Synchronization in Parallel Processing Systems
232 -- 268Bard Bloom, Sorin Istrail, Albert R. Meyer. Bisimulation Can t be Traced
269 -- 291Manuel Blum, Sampath Kannan. Designing Programs that Check Their Work