Journal of the ACM -- 1983

Volume 30, Number 1, January 1983

• A. Bagchi and A. Mahanti. Search algorithms under different kinds of heuristics -- a comparative study. Journal of the ACM, 30(1):1-21, January 1983. Citations. [BibTeX entry]

• Dennis de Champeaux. Bidirectional heuristic search again. Journal of the ACM, 30(1):22-32, January 1983. [BibTeX entry]

• D. V. Sarwate. A note on ``A note on multiple error detection in ASCII numeric data communication''. Journal of the ACM, 30(1):33-35, January 1983. References. [BibTeX entry]

• Anthony Klug. Locking expressions for increased database concurrency. Journal of the ACM, 30(1):36-54, January 1983. Citations. [BibTeX entry]

• Henry F. Korth. Locking primitives in a database system. Journal of the ACM, 30(1):55-79, January 1983. Citations. [BibTeX entry]

• Greg N. Frederickson. Implicit data structures for the dictionary problem. Journal of the ACM, 30(1):80-94, January 1983. Citations. [BibTeX entry]

• H. A. Maurer, A. Salomaa, and D. Wood. A supernormal-form theorem for context-free grammars. Journal of the ACM, 30(1):95-102, January 1983. [BibTeX entry]

• R. E. Lord, J. S. Kowalik, and S. P. Kumar. Solving linear algebraic equations on an MIMD computer. Journal of the ACM, 30(1):103-117, January 1983. Citations. [BibTeX entry]

• Bezalel Gavish. Formulations and algorithms for the capacitated minimal directed tree problem. Journal of the ACM, 30(1):118-132, January 1983. [BibTeX entry]

• Ravindran Kannan. Polynomial-time aggregation of integer programming problems. Journal of the ACM, 30(1):133-145, January 1983. Citations. [BibTeX entry]

• R. Schassberger and H. Daduna. The time for a round trip in a cycle of exponential queues. Journal of the ACM, 30(1):146-150, January 1983. [BibTeX entry]

• Steven Fortune, Daniel Leivant, and Michael O'Donnell. The expressiveness of simple and second-order type structures. Journal of the ACM, 30(1):151-185, January 1983. Citations. [BibTeX entry]

• H. R. Strong. Vector execution of flow graphs. Journal of the ACM, 30(1):186-196, January 1983. [BibTeX entry]

• Krzysztof R. Apt. Formal justification of a proof system for communicating sequential processes. Journal of the ACM, 30(1):197-216, January 1983. [BibTeX entry]

• Oscar H. Ibarra and Shlomo Moran. Probabilistic algorithms for deciding equivalence of straight-line programs. Journal of the ACM, 30(1):217-228, January 1983. Citations. [BibTeX entry]

Volume 30, Number 2, April 1983

• Jeffrey Scott Vitter. Analysis of the search performance of coalesced hashing. Journal of the ACM, 30(2):231-258, April 1983. Citations. [BibTeX entry]

• Seppo Sippu, Eljas Soisalon-Soininen, and Esko Ukkonen. The complexity of LALR(k) testing. Journal of the ACM, 30(2):259-270, April 1983. [BibTeX entry]

• G. W. Stewart. Computable error bounds for aggregated Markov chains. Journal of the ACM, 30(2):271-285, April 1983. [BibTeX entry]

• K. M. Chandy and A. J. Martin. A characterization of product-form queuing networks. Journal of the ACM, 30(2):286-299, April 1983. Citations. [BibTeX entry]

• Jeffrey M. Jaffe. Decentralized simulation of resource managers. Journal of the ACM, 30(2):300-322, April 1983. [BibTeX entry]

• Daniel Brand and Pitro Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323-342, April 1983. Citations. [BibTeX entry]

• C. Farshid Nourani. Abstract implementations and their correctness proofs. Journal of the ACM, 30(2):343-359, April 1983. [BibTeX entry]

• Zvi Galil and Wolfgang J. Paul. An efficient general-purpose parallel computer. Journal of the ACM, 30(2):360-387, April 1983. Citations. [BibTeX entry]

Volume 30, Number 3, July 1983

• Michael Tarsi. Optimal search on some game trees. Journal of the ACM, 30(3):389-396, July 1983. Citations. [BibTeX entry]

• Arnold L. Rosenberg. Three-dimensional VLSI: A case study. Journal of the ACM, 30(3):397-416, July 1983. Citations. [BibTeX entry]

• David W. Matula and Leland L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM, 30(3):417-427, July 1983. Citations. [BibTeX entry]

• Kenneth J. Supowit. The relative neighborhood graph, with an application to minimum spanning trees. Journal of the ACM, 30(3):428-448, July 1983. Citations. [BibTeX entry]

• Eshrat Arjomandi, Michael J. Fischer, and Nancy A. Lynch. Efficiency of synchronous versus asynchronous distributed systems. Journal of the ACM, 30(3):449-456, July 1983. Citations. [BibTeX entry]

• E. G. Coffman, Jr. and Ravi Sethi. Instruction sets for evaluating arithmetic expressions. Journal of the ACM, 30(3):457-478, July 1983. [BibTeX entry]

• Catriel Beeri, Ronald Fagin, David Maier, and Mihalis Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM, 30(3):479-513, July 1983. Citations. [BibTeX entry]

• Ronald Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM, 30(3):514-550, July 1983. Citations. [BibTeX entry]

• Dan Gusfield. Parametric combinatorial computing and a problem of program module distribution. Journal of the ACM, 30(3):551-563, July 1983. Citations. [BibTeX entry]

• Rajan Suri. Robustness of queuing network formulas. Journal of the ACM, 30(3):564-594, July 1983. [BibTeX entry]

• Jean-Claude Raoult and Ravi Sethi. Properties of a notation for combining functions. Journal of the ACM, 30(3):595-611, July 1983. [BibTeX entry]

• Edmund M. Clarke, Jr., Steven M. German, and Joseph Y. Halpern. Effective axiomatizations of Hoare logics. Journal of the ACM, 30(3):612-636, July 1983. [BibTeX entry]

• Georg Gati. The complexity of solving polynomial equations by quadrature. Journal of the ACM, 30(3):637-640, July 1983. [BibTeX entry]

• Oscar H. Ibarra and Brian S. Leininger. On the simplification and equivalence problems for straight-line programs. Journal of the ACM, 30(3):641-656, July 1983. [BibTeX entry]

• Joseph Ja'Ja'. Time-space trade-offs for some algebraic problems. Journal of the ACM, 30(3):657-667, July 1983. [BibTeX entry]

• L. Lamport. The weak Byzantine generals problem. Journal of the ACM, 30(3):668-676, July 1983. Citations. [BibTeX entry]

• Xu Mei-rui, John E. Donner, and Ronald V. Book. Refining nondeterminism in relativizations of complexity classes. Journal of the ACM, 30(3):677-685, July 1983. [BibTeX entry]

Volume 30, Number 4, October 1983

• Dana S. Nau. Decision quality as a function of search depth on game trees. Journal of the ACM, 30(4):687-708, October 1983. [BibTeX entry]

• Jia-Wei Hong, Kurt Mehlhorn, and Arnold L. Rosenberg. Cost trade-offs in graph embeddings, with applications. Journal of the ACM, 30(4):709-728, October 1983. Citations. [BibTeX entry]

• Avi Wigderson. Improving the performance guarantee for approximate graph coloring. Journal of the ACM, 30(4):729-735, October 1983. Citations. [BibTeX entry]

• Toshihide Ibaraki, Hussein M. Abdel-Wahab, and Tiko Kameda. Design of minimum-cost deadlock-free systems. Journal of the ACM, 30(4):736-751, October 1983. [BibTeX entry]

• Giorgio Ausiello, Alessandro D'Atri, and Domenico Saccà. Graph algorithms for functional dependency manipulation. Journal of the ACM, 30(4):752-766, October 1983. [BibTeX entry]

• Nathan Goodman and Oded Shmueli. Syntactic characterization of tree database schemas. Journal of the ACM, 30(4):767-786, October 1983. [BibTeX entry]

• Zvi M. Kedem and Abraham Silberschatz. Locking protocols: From exclusive to shared locks. Journal of the ACM, 30(4):787-804, October 1983. [BibTeX entry]

• Per-Åke Larson. Analysis of uniform hashing. Journal of the ACM, 30(4):805-819, October 1983. [BibTeX entry]

• Yael Krevner and Amiram Yehudai. An iteration theorem for simple precedence languages. Journal of the ACM, 30(4):820-833, October 1983. [BibTeX entry]

• Bruce Hajek. The proof of a folk theorem on queuing delay with applications to routing in networks. Journal of the ACM, 30(4):834-851, October 1983. [BibTeX entry]

• Nimrod Megiddo. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM, 30(4):852-865, October 1983. Citations. [BibTeX entry]

Shortcuts: