Journal: Journal of the ACM

Volume 41, Issue 6

1049 -- 1088Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju. Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations
1089 -- 1109Tal Rabin. Robust Sharing of Secrets When the Dealer is Honest or Cheating
1110 -- 1135Keith W. Ross, Danny H. K. Tsang, Jie Wang. Monte Carlo Summation and Integration Applied to Multiclass Queuing Networks
1136 -- 1150Richard M. Karp. Probabilistic Recurrence Relations
1151 -- 1177Jeffrey F. Naughton, Raghu Ramakrishnan. How to Forget the Past Without Repeating It
1178 -- 1215Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian. Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases
1216 -- 1266Kenneth A. Ross. Modular Stratification and Magic Sets for Datalog Programs with Negation
1267 -- 1297Yehuda Afek, Hagit Attiya, Alan Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang, Lenore D. Zuck. Reliable Communication Over Unreliable Channels
1298 -- 1328Michael J. Kearns, Ming Li, Leslie G. Valiant. Learning Boolean Formulas
1329 -- 1356Rajeev Motwani. Average-Case Analysis of Algorithms for Matchings and Related Problems

Volume 41, Issue 5

819 -- 873Peter K. Rathmann, Marianne Winslett, Mark S. Manasse. Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems
874 -- 902Christopher J. Glass, Lionel M. Ni. The Turn Model for Adaptive Routing
903 -- 942Yves Dallery, Zhen Liu, Donald F. Towsley. Equivalence, Reversibility, Symmetry and Concavity Properties in Fork-Join Queueing Networks with Blocking
943 -- 959James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan. Fully Persistent Lists with Catenation
960 -- 981Carsten Lund, Mihalis Yannakakis. On the Hardness of Approximating Minimization Problems
982 -- 1012James A. Storer, John H. Reif. Shortest Paths in the Plane with Polygonal Obstacles
1013 -- 1019John H. Reif, James A. Storer. A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions
1020 -- 1048James Aspnes, Maurice Herlihy, Nir Shavit. Counting Networks

Volume 41, Issue 4

591 -- 629Wray L. Buntine, Hans-Jürgen Bürckert. On Solving Equations and Disequations
630 -- 647Avrim Blum, Ming Li, John Tromp, Mihalis Yannakakis. Linear Approximation of Shortest Superstrings
648 -- 675Adrian E. Conway, Eugene Pinsky, Srinivasan Tridandapani. Efficient Decomposition Methods for the Analysis of Multi-Facility Blocking Models
676 -- 707John C. S. Lui, Richard R. Muntz. Computing Bounds on Steady State Availability of Repairable Computer Systems
708 -- 724Timothy C. Bell, Ian H. Witten. The Relationship between Greedy Parsing and Symbolwise Text Compression
725 -- 763Hagit Attiya, Nancy A. Lynch, Nir Shavit. Are Wait-Free Algorithms Fast?
764 -- 790John H. Reif, Micha Sharir. Motion Planning in the Presence of Moving Obstacles
791 -- 818Shaodi Gao, Michael Kaufmann. Channel Routing of Multiterminal Nets

Volume 41, Issue 3

435 -- 469Peter B. Ladkin, Roger D. Maddux. On Binary Constraint Problems
470 -- 516Avrim Blum. New Approximation Algorithms for Graph Coloring
517 -- 539Doron Drusinsky, David Harel. On the Power of Bounded Concurrency I: Finite Automata
540 -- 554Tirza Hirst, David Harel. On the Power of Bounded Concurrency II: Pushdown Automata
555 -- 589Ronald L. Rivest, Robert E. Schapire. Diversity-Based Inference of Finite Automata

Volume 41, Issue 2

205 -- 213Moshe Dubiner, Zvi Galil, Edith Magen. Faster Tree Pattern Matching
214 -- 235Samir Khuller, Uzi Vishkin. Biconnectivity Approximations and Graph Carvings
236 -- 276Leo Bachmair, Nachum Dershowitz. Equational Inference, Canonical Proofs, and Proof Orderings
277 -- 310Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings
311 -- 339Ambuj K. Singh, James H. Anderson, Mohamed G. Gouda. The Elusive Atomic Register
340 -- 367Ronald Fagin, Joseph Y. Halpern. Reasoning About Knowledge and Probability
368 -- 398A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn. An Analysis of ML Typability
399 -- 421Michel Cosnard, El Mostafa Daoudi. Optimal Algorithms for Parallel Givens Factorization on a Coarse-Grained PRAM
422 -- 434Noga Alon, Nimrod Megiddo. Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time

Volume 41, Issue 1

3 -- 30Michael J. Fischer, Mike Paterson. Fishspear: A Priority Queue Algorithm
31 -- 66Daniel N. Rockmore. Efficient Computation of Fourier Inversion for Finite Groups
67 -- 95Michael J. Kearns, Leslie G. Valiant. Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
96 -- 121Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe. Instance Complexity
122 -- 152Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer. Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
153 -- 180Brenda S. Baker. Approximation Algorithms for NP-Complete Problems on Planar Graphs
181 -- 204Rajeev Alur, Thomas A. Henzinger. A Really Temporal Logic