Journal: Journal of the ACM

Volume 40, Issue 5

991 -- 1018Edward G. Coffman Jr., M. R. Garey. Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling
1019 -- 1047Zhi-Quan Luo, John N. Tsitsiklis. On the Communication Complexity of Distributed Algebraic Computation
1048 -- 1066Bruce Randall Donald, Patrick G. Xavier, John F. Canny, John H. Reif. Kinodynamic Motion Planning
1067 -- 1086Y. C. Tay. On the Optimality of Strategies for Multiple Joins
1087 -- 1107Alan Fekete, Nancy A. Lynch, Yishay Mansour, John Spinelli. The Impossibility of Implementing Reliable Communication in the Face of Crashes
1108 -- 1133Martin Charles Golumbic, Ron Shamir. Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach
1134 -- 1164Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese. An Algebraic Theory of Graph Reduction
1165 -- 1187Jean Fonlupt, Armand Nachef. Dynamic Programming and the Graphical Traveling Salesman Problem
1188 -- 1208Alain Jean-Marie, Levent Gün. Parallel Queues with Resequencing
1209 -- 1237François Baccelli, Zhen Liu, Donald F. Towsley. Extremal Scheduling of Parallel Processing with and without Real-Time Constraints
1238 -- 1301Charles Knessl. On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue

Volume 40, Issue 4

791 -- 830Edith Cohen, Nimrod Megiddo. Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs
831 -- 872Philip S. Yu, Daniel M. Dias, Stephen S. Lavenberg. On the Analytical Modeling of Database Concurrency Control
873 -- 890Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit. Atomic Snapshots of Shared Memory
891 -- 916Foto N. Afrati, Christos H. Papadimitriou. The Parallel Complexity of Simple Logic Programs
917 -- 962Joseph Y. Halpern, Mark R. Tuttle. Knowledge, Probability, and Adversaries
963 -- 990V. Wiktor Marek, Grigori F. Shvarts, Miroslaw Truszczynski. Modal Nonmonotonic Logics: Ranges, Characterization, Computation

Volume 40, Issue 3

421 -- 453Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir. Random Walks on Weighted Graphs and Applications to On-line Algorithms
454 -- 476Howard J. Karloff, Prabhakar Raghavan. Randomized Algorithms and Pseudorandom Numbers
477 -- 503Franz Baader. Unification in Commutative Theories, Hilbert s Basis Theorem, and Gröbner Bases
504 -- 535Neil V. Murray, Erik Rosenthal. Dissolution: Making Paths Vanish
536 -- 557C. A. Johnson. Factorization and Circuit in the Connection Method
558 -- 606Tie-Cheng Wang. Z-Module Reasoning: An Equality-Oriented Proving Method with Built-in Ring Axioms
607 -- 620Nathan Linial, Yishay Mansour, Noam Nisan. Constant Depth Circuits, Fourier Transform, and Learnability
621 -- 634Kurt Mehlhorn, Athanasios K. Tsakalidis. Dynamic Interpolation Search
635 -- 652Marc J. van Kreveld, Mark H. Overmars. Union-Copy Structures and Dynamic Segment Trees
653 -- 682Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
683 -- 713Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi. Undecidable Optimization Problems for Database Logic Programs
714 -- 740Randolph D. Nelson, Donald F. Towsley. A Performance Evaluation of Several Priority Policies for Parallel Processing Systems
741 -- 764Sandeep N. Bhatt, Jin-yi Cai. Taking Random Walks to Grow Trees in Hypercubes
765 -- 789Richard M. Karp, Yanjun Zhang. Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation

Volume 40, Issue 2

211 -- 223Nader H. Bshouty. On the Complexity of Functions for Random Access Machines
224 -- 245Andrea S. LaPaugh. Recontamination Does Not Help to Search a Graph
246 -- 283David A. McAllester, Robert Givan. Taxonomic Syntax for First Order Inference
284 -- 303David A. McAllester. Automatic Recognition of Tractability in Inference Relations
304 -- 333David M. Nicol. The Cost of Conservative Synchronization in Parallel Discrete Event Simulations
334 -- 367Gil Neiger, Sam Toueg. Simulating Synchronized Clocks and Common Knowledge in Distributed Systems
368 -- 393Thomas Lengauer, Egon Wanke. Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages
394 -- 417Kin K. Leung. An Execution/Sleep Scheduling Policy for Serving an Additional Job in Priority Queueing Systems

Volume 40, Issue 1

1 -- 16Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder. An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time
17 -- 47Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung. Perfectly Secure Message Transmission
48 -- 94John D. Hobby. Generating Automatically Tuned Bitmaps from Outlines
95 -- 142Leonard Pitt, Manfred K. Warmuth. The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial
143 -- 184Robert Harper, Furio Honsell, Gordon D. Plotkin. A Framework for Defining Logics
185 -- 210Dana Angluin, Lisa Hellerstein, Marek Karpinski. Learning Read-Once Formulas with Queries