Journal of the ACM, Volume 34, 1987
Volume 34, Number 1, January 1987
- Victor Vianu: Dynamic functional dependencies and database aging. 28-59
- Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer: On the minimal synchronism needed for distributed consensus. 77-97
- Yoshihito Toyama: On the Church-Rosser property for the direct sum of term rewriting systems. 128-143
- Dorit S. Hochbaum, David B. Shmoys: Using dual approximation algorithms for scheduling problems theoretical and practical results. 144-162
- Rüdiger Reischuk: Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions. 163-178
- Lorenzo Donatiello, Balakrishna R. Iyer: Analysis of a composite performance reliability measure for fault-tolerant systems. 179-199
- Richard Cole: Slowing down sorting networks to obtain faster sorting algorithms. 200-208
- Alasdair Urquhart: Hard examples for resolution. 209-219
Volume 34, Number 2, April 1987
- Wen-Lian Hsu: Recognizing planar perfect graphs. 255-288
- Albert G. Greenberg, Philippe Flajolet, Richard E. Ladner: Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. 289-325
- Yann-Hang Lee, Kang G. Shin: Optimal reconfiguration strategy for a degradable multimodule computing system. 326-348
- Edward P. F. Chan, Alberto O. Mendelzon: Answering queries on embedded-complete database schemes. 349-375
- Christos A. Papachristou: Associative table lookup processing for multioperand residue arithmetic. 376-396
- David Peleg: Concurrent dynamic logic. 450-479
- Steven Homer: Minimal degrees for polynomial reducibilities. 480-491
- K. N. Venkataraman: Decidability of the purely existential fragment of the theory of term algebras. 492-510
Volume 34, Number 3, July 1987
- Zvi 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. 513-531
- Robert W. Irving, Paul Leather, Dan Gusfield: An efficient algorithm for the ``optimal'' stable marriage. 532-543
- Catriel Beeri, Michael Kifer: A theory of intersection anomalies in relational database schemes. 544-577
- Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht: Complete inverted files for efficient text retrieval and analysis. 578-595
- Michael L. Fredman, Robert Endre Tarjan: Fibonacci heaps and their uses in improved network optimization algorithms. 596-615
- Stanley Cabay, Bart Domzy: Systems of linear equations with dense univariate polynomial coefficients. 646-660
- Randolph D. Nelson: Stochastic catastrophe theory in computer performance modeling. 661-685
- Rajan Suri: Infinitesimal perturbation analysis for general discrete event systems. 686-717
- Michio Oyamaguchi: The equivalence problem for real-time DPDAs. 731-760
Volume 34, Number 4, October 1987
- Alfred Inselberg, Tuval Chomut, Mordechai Reif: Convexity algorithms in parallel coordinates. 765-801
- Debasis Mitra, Randall A. Cieslak: Randomized parallel communications on an extension of the omega network. 802-824
- Jeffrey Scott Vitter: Design and analysis of dynamic Huffman codes. 825-845
- Dan E. Willard: Multidimensional search trees that provide new types of memory reductions. 846-858
- Joshua J. Bloch, Dean S. Daniels, Alfred Z. Spector: A weighted voting algorithm for replicated directories. 859-909
- Gabriel Bracha: An O(log n) expected rounds randomized byzantine generals protocol. 910-920
- Prasoon Tiwari: Lower bounds on communication complexity in distributed computer networks. 921-938
- Shu Tezuka: On the discrepancy of GFSR pseudorandom numbers. 939-949
- Donald B. Johnson: Parallel algorithms for minimum cuts and maximum flows in planar networks. 950-967
- Michael Kaminski: A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor. 968-984
- James McKenna: Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks. 985-1003
- Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin: Correction to ``An equivalence between relational database dependencies and a fragment of propositional logic''. 1016-1018
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team