Journal of the ACM -- 1991

Volume 38, Number 1, January 1991

• Martin Dyer, Alan Frieze, and Ravi Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM, 38(1):1-17, January 1991. References, Citations, etc. [BibTeX entry]

• Joseph S. B. Mitchell and Christos H. Papadimitriou. The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM, 38(1):18-73, January 1991. References, Citations, etc. [BibTeX entry]

• Ketan Mulmuley. A fast planar partition algorithm, II. Journal of the ACM, 38(1):74-103, January 1991. References, Citations, etc. [BibTeX entry]

• Dan E. Willard. Optimal sample cost residues for differential database batch query problems. Journal of the ACM, 38(1):104-119, January 1991. References, Citations, etc. [BibTeX entry]

• Yehoshua Sagiv. Evaluation of queries in independent database schemes. Journal of the ACM, 38(1):120-161, January 1991. References, Citations, etc. [BibTeX entry]

• Greg N. Frederickson. Planar graph decomposition and all pairs shortest paths. Journal of the ACM, 38(1):162-204, January 1991. References, Citations, etc. [BibTeX entry]

• V. Chandru and J. N. Hooker. Extended Horn sets in propositional logic. Journal of the ACM, 38(1):205-221, January 1991. References, Citations, etc. [BibTeX entry]

• Gloria Kissin. Upper and lower bounds on switching energy in VLSI. Journal of the ACM, 38(1):222-254, January 1991. References, etc. [BibTeX entry]

Volume 38, Number 2, April 1991

• E. M. Arkin, C. H. Papadimitriou, and M. Yannakakis. Modularity of cycles and paths in graphs. Journal of the ACM, 38(2):255-274, April 1991. Citations, etc. [BibTeX entry]

• David Dobkin and Subhash Suri. Maintenance of geometric extrema. Journal of the ACM, 38(2):275-298, April 1991. References, Citations, etc. [BibTeX entry]

• Randal E. Bryant. A methodology for hardware verification based on logic simulation. Journal of the ACM, 38(2):299-328, April 1991. References, etc. [BibTeX entry]

• Yannis E. Ioannidis and Eugene Wong. Towards an algebraic theory of recursion. Journal of the ACM, 38(2):329-381, April 1991. References, Citations, etc. [BibTeX entry]

• Ronald Fagin, Joseph Y. Halpern, and Moshe Y. Vardi. A model-theoretic analysis of knowledge. Journal of the ACM, 38(2):382-428, April 1991. References, Citations, etc. [BibTeX entry]

• Nicholas Bambos and Jean Walrand. On stability and performance of parallel processing systems. Journal of the ACM, 38(2):429-452, April 1991. References, etc. [BibTeX entry]

• Yishay Mansour, Baruch Schieber, and Prasoon Tiwari. A lower bound for integer greatest common divisor computations. Journal of the ACM, 38(2):453-471, April 1991. References, Citations, etc. [BibTeX entry]

• Anne Condon. Space-bounded probabilistic game automata. Journal of the ACM, 38(2):472-494, April 1991. References, Citations, etc. [BibTeX entry]

• Noga Alon, A. K. Dewdney, and Teunis J. Ott. Efficient simulation of finite automata by neural nets. Journal of the ACM, 38(2):495-514, April 1991. Citations, etc. [BibTeX entry]

Volume 38, Number 3, July 1991

• Tom Leighton. Letter from the editor. Journal of the ACM, 38(3):515, July 1991. [BibTeX entry]

• Mikhail J. Atallah, Danny Z. Chen, and Hubert Wagener. An optimal parallel algorithm for the visibility of a simple polygon from a point. Journal of the ACM, 38(3):516-533, July 1991. References, Citations, etc. [BibTeX entry]

• Tomasz Imielinski. Abstraction in query processing. Journal of the ACM, 38(3):534-558, July 1991. References, etc. [BibTeX entry]

• Jieh Hsiang and Michaël Rusinowitch. Proving refutational completeness of theorem-proving strategies: The transfinite semantic tree method. Journal of the ACM, 38(3):559-587, July 1991. References, Citations, etc. [BibTeX entry]

• Wiktor Marek and Miroslaw Truszczynski. Autoepistemic logic. Journal of the ACM, 38(3):588-619, July 1991. Citations, etc. [BibTeX entry]

• Allen Van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, July 1991. References, Citations, etc. [BibTeX entry]

• Maxime Crochemore and Dominique Perrin. Two-way string-matching. Journal of the ACM, 38(3):651-675, July 1991. References, Citations, etc. [BibTeX entry]

• Keith W. Ross and David D. Yao. Optimal load balancing and scheduling in a distributed computer system. Journal of the ACM, 38(3):676-690, July 1991. References, etc. [BibTeX entry]

• Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(3):691-729, July 1991. References, Citations, etc. [BibTeX entry]

• Cüneyt M. Özveren, Alan S. Willsky, and Panos J. Antsaklis. Stability and stabilizability of discrete event dynamic systems. Journal of the ACM, 38(3):730-752, July 1991. Additional information. [BibTeX entry]

• Jacobo Torán. Complexity classes defined by counting quantifiers. Journal of the ACM, 38(3):753-774, July 1991. References, Citations, etc. [BibTeX entry]

Volume 38, Number 4, October 1991

• Bradley S. Stewart and Chelsea C. White, III. Multiobjective A*. Journal of the ACM, 38(4):775-814, October 1991. Citations, etc. [BibTeX entry]

• Harold N. Gabow and Robert E. Tarjan. Faster scaling algorithms for general graph-matching problems. Journal of the ACM, 38(4):815-853, October 1991. References, Citations, etc. [BibTeX entry]

• Edward P. F. Chan and Héctor J. Hernández. Independence-reducible database schemes. Journal of the ACM, 38(4):854-886, October 1991. References, etc. [BibTeX entry]

• Stephen L. Bloom and Zoltá Ésik. Floyd-Hoare logic in iteration theories. Journal of the ACM, 38(4):887-934, October 1991. References, Citations, etc. [BibTeX entry]

• Joseph Y. Halpern and Yoav Shoham. A propositional modal logic of time intervals. Journal of the ACM, 38(4):935-962, October 1991. References, Citations, etc. [BibTeX entry]

• Michael Tiomkin and Michael Kaminski. Nonmonotonic default modal logics. Journal of the ACM, 38(4):963-984, October 1991. References, Citations, etc. [BibTeX entry]

• Egon Balas, Donald Miller, Joseph Pekny, and Paolo Toth. A parallel shortest augmenting path algorithm for the assignment problem. Journal of the ACM, 38(4):985-1004, October 1991. References, etc. [BibTeX entry]

• Paul Glasserman. Structural conditions for perturbation analysis of queuing systems. Journal of the ACM, 38(4):1005-1025, October 1991. References, etc. [BibTeX entry]

• Bonnie Berger and John Rompel. Simulating (log^c n)-wise independence in NC. Journal of the ACM, 38(4):1026-1046, October 1991. References, Citations, etc. [BibTeX entry]

Shortcuts: