External Links

Journal: Journal of the ACM

Volume 43, Issue 6

915 -- 936Ricardo A. Baeza-Yates, Gaston H. Gonnet. Fast Text Searching for Regular Expressions or Automaton Searching on Tries
937 -- 972Christian W. Omlin, C. Lee Giles. Constructing Deterministic Finite-State Automata in Recurrent Neural Networks
973 -- 1001Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan. Efficient Routing in Optical Networks
1002 -- 1045Saugata Basu, Richard Pollack, Marie-Françoise Roy. On the Combinatorial and Algebraic Complexity of Quantifier Elimination
1046 -- 1088Seppo Sippu, Eljas Soisalon-Soininen. An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries

Volume 43, Issue 5

771 -- 793Jeffrey Scott Vitter, P. Krishnan. Optimal Prefetching via Data Compression
794 -- 839Costas Busch, Marios Mavronicolas. A Combinatorial Treatment of Balancing Networks
840 -- 862Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins. How Many Queries Are Needed to Learn?
863 -- 914Roland N. Bol, Jan Friso Groote. The Meaning of Negative Premises in Transition System Specifications

Volume 43, Issue 4

601 -- 640David R. Karger, Clifford Stein. A New Approach to the Minimum Cut Problem
641 -- 669William C. Cheng, Richard R. Muntz. Bounding Errors Introduced by Clustering of Customers in Closed Product-Form Queueing Networks
670 -- 684Antoni Koscielski, Leszek Pacholski. Complexity of Makanin s Algorithm
685 -- 722Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg. The Weakest Failure Detector for Solving Consensus
723 -- 746Ming Li, John Tromp, Paul M. B. Vitányi. How to Share Concurrent Wait-Free Variables
747 -- 770Nader H. Bshouty, Christino Tamon. On the Fourier Spectrum of Monotone Functions

Volume 43, Issue 3

399 -- 430Eugene Santos Jr.. On Linear Potential Functions for Approximating Bayesian Computations
431 -- 473Oded Goldreich, Rafail Ostrovsky. Software Protection and Simulation on Oblivious RAMs
474 -- 523Sherry Marcus, V. S. Subrahmanian. Foundations of Multimedia Database Systems
524 -- 554Mark-Jan Nederhof, Eberhard Bertsch. Linear-Time Suffix Parsing for Deterministic Languages
555 -- 600Rob J. van Glabbeek, W. P. Weijland. Branching Time and Abstraction in Bisimulation Semantics

Volume 43, Issue 2

193 -- 224Bart Selman, Henry A. Kautz. Knowledge Compilation and Theory Approximation
225 -- 267Tushar Deepak Chandra, Sam Toueg. Unreliable Failure Detectors for Reliable Distributed Systems
268 -- 292Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy. Interactive Proofs and the Hardness of Approximating Cliques
293 -- 330Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe. Optimal Emulations by Butterfly-Like Networks
331 -- 361Michael T. Goodrich, S. Rao Kosaraju. Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation
362 -- 397Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy. Confluence Properties of Weak and Strong Calculi of Explicit Substitutions

Volume 43, Issue 1

1 -- 19Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks. Local Management of a Global Resource in a Communication Network
20 -- 74Weidong Chen, David Scott Warren. Tabled Evaluation With Delaying for General Logic Programs
75 -- 115Yuh-Jzer Joung, Scott A. Smolka. A Comprehensive Study of the Complexity of Multiparty Interaction
116 -- 146Rajeev Alur, Tomás Feder, Thomas A. Henzinger. The Benefits of Relaxing Punctuality
147 -- 165Peter Bro Miltersen, Mike Paterson, Jun Tarui. The Asymptotic Complexity of Merging Networks
166 -- 192Robert S. Boyer, Yuan Yu. Automated Proofs of Object Code for a Widely Used Microprocessor
runs on