Journal: Journal of the ACM

Volume 39, Issue 4

745 -- 763Allan Borodin, Nathan Linial, Michael E. Saks. An Optimal On-Line Algorithm for Metrical Task System
764 -- 782Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel. Nonoblivious Hashing
783 -- 799Yishay Mansour, Baruch Schieber. The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels
800 -- 828Cynthia Dwork, Larry J. Stockmeyer. Finite State Verifiers I: The Power of Interaction
829 -- 858Cynthia Dwork, Larry J. Stockmeyer. Finite State Verifiers II: Zero Knowledge
859 -- 868Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan. Algebraic Methods for Interactive Proof Systems
869 -- 877Adi Shamir. IP = PSPACE
878 -- 880A. Shen. IP = PSPACE: Simplified Proof
881 -- 930Maurice Herlihy, Nancy A. Lynch, Michael Merritt, William E. Weihl. On the Correctness of Orphan Management Algorithms
931 -- 948Oliver Collins, Sam Dolinar, Robert J. McEliece, Fabrizio Pollara. A VLSI Decomposition of the deBruijn Graph
949 -- 984Saumya K. Debray. Efficient Dataflow Analysis of Logic Programs
985 -- 986Michael B. Dillencourt, Hanan Samet, Markku Tamminen. Corrigenda: A General Approach to Connected-Component Labelling for Arbitrary Image Representations

Volume 39, Issue 3

449 -- 478Joseph Y. Halpern, Lenore D. Zuck. A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and Correctness Proofs for a Family of Protocols
479 -- 501Lenwood S. Heath, Sorin Istrail. The Pagenumber of Genus g Graphs is O(g)
502 -- 518Alain Billionnet, Marie-Christine Costa, Alain Sutter. An Efficient Algorithm for a Task Allocation Problem
519 -- 545David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano. Sparse Dynamic Programming I: Linear Cost Functions
546 -- 567David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano. Sparse Dynamic Programming II: Convex and Concave Cost Functions
568 -- 598Albert G. Greenberg, Neal Madras. How Fair is Fair Queuing?
599 -- 616Martin Beaudry, Pierre McKenzie, Denis Thérien. The Membership Problem in Aperiodic Transformation Monoids
617 -- 648Amir M. Ben-Amram, Zvi Galil. On Pointers versus Addresses
649 -- 674William I. Gasarch, Carl H. Smith. Learning via Queries
675 -- 735Steven M. German, A. Prasad Sistla. Reasoning about Systems with Many Processes
736 -- 744Ran Raz, Avi Wigderson. Monotone Circuits for Matching Require Linear Depth

Volume 39, Issue 2

253 -- 280Michael B. Dillencourt, Hanan Samet, Markku Tamminen. A General Approach to Connected-Component Labelling for Arbitrary Image Representations
281 -- 294Jyrki Katajainen, Timo Raita. An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding
295 -- 316R. Ramesh, I. V. Ramakrishnan. Nonlinear Pattern Matching in Trees
317 -- 327Renzo Sprugnoli. The Generation of Binary Trees as a Numerical Problem
328 -- 376Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi. What Can Machines Know? On the Properties of Knowledge in Distributed Systems
377 -- 429Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder. Theorem Proving Using Equational Matings and Rigid E-Unification
430 -- 448Eugene W. Myers. A Four Russians Algorithm for Regular Expression Pattern Matching

Volume 39, Issue 1

1 -- 54Bernard Chazelle, Herbert Edelsbrunner. An Optimal Algorithm for Intersecting Line Segments in the Plane
55 -- 70Eli Upfal. An O(log(N)) Deterministic Packet-Routing Scheme
71 -- 94Robert Demolombe. Syntactical Characterization of a Subset of Domain-Independent Formulas
95 -- 146Joseph A. Goguen, Rod M. Burstall. Institutions: Abstract Model Theory for Specification and Programming
147 -- 187Luca Aceto, Matthew Hennessy. Termination, Deadlock, and Divergence
188 -- 213Lawrence W. Dowdy, Brian M. Carlson, Alan T. Krantz, Satish K. Tripathi. Single-Class Bounds of Multi-Class Queuing Networks
214 -- 233Mihir Bellare, Silvio Micali. How to Sign Given Any Trapdoor Permutation
234 -- 251Eric Allender, Lane A. Hemachandra. Lower Bounds for the Low Hierarchy