Journal: Journal of the ACM

Volume 34, Issue 4

765 -- 801Alfred Inselberg, Tuval Chomut, Mordechai Reif. Convexity algorithms in parallel coordinates
802 -- 824Debasis Mitra, Randall A. Cieslak. Randomized parallel communications on an extension of the omega network
825 -- 845Jeffrey Scott Vitter. Design and analysis of dynamic Huffman codes
846 -- 858Dan E. Willard. Multidimensional search trees that provide new types of memory reductions
859 -- 909Joshua J. Bloch, Dean S. Daniels, Alfred Z. Spector. A weighted voting algorithm for replicated directories
910 -- 920Gabriel Bracha. An O(log n) expected rounds randomized byzantine generals protocol
921 -- 938Prasoon Tiwari. Lower bounds on communication complexity in distributed computer networks
939 -- 949Shu Tezuka. On the discrepancy of GFSR pseudorandom numbers
950 -- 967Donald B. Johnson. Parallel algorithms for minimum cuts and maximum flows in planar networks
968 -- 984Michael Kaminski. A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor
985 -- 1003James McKenna. Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks
1004 -- 1015Miklós Ajtai, Yuri Gurevich. Monotone versus positive
1016 -- 1018Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin. Correction to An equivalence between relational database dependencies and a fragment of propositional logic

Volume 34, Issue 3

513 -- 531Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber. An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs
532 -- 543Robert W. Irving, Paul Leather, Dan Gusfield. An efficient algorithm for the optimal stable marriage
544 -- 577Catriel Beeri, Michael Kifer. A theory of intersection anomalies in relational database schemes
578 -- 595Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis
596 -- 615Michael L. Fredman, Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms
616 -- 625Daniel S. Hirschberg, Lawrence L. Larmore. New applications of failure functions
626 -- 645T. K. Srikanth, Sam Toueg. Optimal clock synchronization
646 -- 660Stanley Cabay, Bart Domzy. Systems of linear equations with dense univariate polynomial coefficients
661 -- 685Randolph D. Nelson. Stochastic catastrophe theory in computer performance modeling
686 -- 717Rajan Suri. Infinitesimal perturbation analysis for general discrete event systems
718 -- 730Ronald V. Book, Ding-Zhu Du. The existence and density of generalized complexity cores
731 -- 760Michio Oyamaguchi. The equivalence problem for real-time DPDAs

Volume 34, Issue 2

225 -- 254Neil V. Murray, Erik Rosenthal. Inference with path resolution and semantic graphs
255 -- 288Wen-Lian Hsu. Recognizing planar perfect graphs
289 -- 325Albert G. Greenberg, Philippe Flajolet, Richard E. Ladner. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
326 -- 348Yann-Hang Lee, Kang G. Shin. Optimal reconfiguration strategy for a degradable multimodule computing system
349 -- 375Edward P. F. Chan, Alberto O. Mendelzon. Answering queries on embedded-complete database schemes
376 -- 396Christos A. Papachristou. Associative table lookup processing for multioperand residue arithmetic
397 -- 410Georg Ch. Pflug, Hans W. Kessler. Linear probing with a nonuniform address distribution
411 -- 449Pierpaolo Degano, Ugo Montanari. A model for distributed systems based on graph rewriting
450 -- 479David Peleg. Concurrent dynamic logic
480 -- 491Steven Homer. Minimal degrees for polynomial reducibilities
492 -- 510K. N. Venkataraman. Decidability of the purely existential fragment of the theory of term algebras

Volume 34, Issue 1

1 -- 27Bernard Chazelle, David P. Dobkin. Intersection of convex objects in two and three dimensions
28 -- 59Victor Vianu. Dynamic functional dependencies and database aging
60 -- 76John H. Reif, Leslie G. Valiant. A logarithmic time sort for linear size networks
77 -- 97Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer. On the minimal synchronism needed for distributed consensus
98 -- 115Greg N. Frederickson, Nancy A. Lynch. Electing a leader in a synchronous ring
116 -- 127Eli Upfal, Avi Wigderson. How to share memory in a distributed system
128 -- 143Yoshihito Toyama. On the Church-Rosser property for the direct sum of term rewriting systems
144 -- 162Dorit S. Hochbaum, David B. Shmoys. Using dual approximation algorithms for scheduling problems theoretical and practical results
163 -- 178Rüdiger Reischuk. Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions
179 -- 199Lorenzo Donatiello, Balakrishna R. Iyer. Analysis of a composite performance reliability measure for fault-tolerant systems
200 -- 208Richard Cole. Slowing down sorting networks to obtain faster sorting algorithms
209 -- 219Alasdair Urquhart. Hard examples for resolution