Journal of the ACM -- 1977

Volume 24, Number 1, January 1977

• Donald B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24(1):1-13, January 1977. Citations. [BibTeX entry]

• Neil C. Wilhelm. A general model for the performance of disk systems. Journal of the ACM, 24(1):14-31, January 1977. [BibTeX entry]

• Edward C. Horvath, Shui Lam, and Ravi Sethi. A level algorithm for preemptive scheduling. Journal of the ACM, 24(1):32-43, January 1977. Citations. [BibTeX entry]

• R. M. Burstall and John Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, January 1977. Citations. [BibTeX entry]

• J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright. Initial algebra semantics and continuous algebras. Journal of the ACM, 24(1):68-95, January 1977. Citations. [BibTeX entry]

• Susan L. Graham. Special editor's note. Journal of the ACM, 24(1):96-97, January 1977. [BibTeX entry]

• Brenda S. Baker. An algorithm for structuring flowgraphs. Journal of the ACM, 24(1):98-120, January 1977. [BibTeX entry]

• David B. Loveman. Program improvement by source-to-source transformation. Journal of the ACM, 24(1):121-145, January 1977. Citations. [BibTeX entry]

• A. V. Aho, S. C. Johnson, and J. D. Ullman. Code generation for expressions with common subexpressions. Journal of the ACM, 24(1):146-160, January 1977. Citations. [BibTeX entry]

• Phillip D. Summers. A methodology for LISP program construction from examples. Journal of the ACM, 24(1):161-175, January 1977. [BibTeX entry]

Volume 24, Number 2, April 1977

• Dennis de Champeaux and Leni Sint. An improved bidirectional heuristic search algorithm. Journal of the ACM, 24(2):177-191, April 1977. [BibTeX entry]

• F. T. Boesch and J. F. Gimpel. Covering points of a digraph with point-disjoint paths and its application to code optimization. Journal of the ACM, 24(2):192-198, April 1977. [BibTeX entry]

• Arnold L. Rosenberg and Larry J. Stockmeyer. Hashing schemes for extendible arrays. Journal of the ACM, 24(2):199-221, April 1977. [BibTeX entry]

• Alexandre Brandwajn. A queueing model of multiprogrammed computer systems under full load conditions. Journal of the ACM, 24(2):222-240, April 1977. [BibTeX entry]

• Micha Hofri. On certain output-buffer management techniques -- a stochastic model. Journal of the ACM, 24(2):241-249, April 1977. [BibTeX entry]

• K. Mani Chandy, John H. Howard Jr., and Donald F. Towsley. Product form and local balance in queueing networks. Journal of the ACM, 24(2):250-263, April 1977. Citations. [BibTeX entry]

• Toshihide Ibaraki. The power of dominance relations in branch-and-bound algorithms. Journal of the ACM, 24(2):264-279, April 1977. [BibTeX entry]

• Oscar H. Ibarra and Chul E. Kim. Heuristic algorithms for scheduling independent tasks on nonidentical processors. Journal of the ACM, 24(2):280-289, April 1977. [BibTeX entry]

• Eric C. R. Hehner. Information content of programs and operation encoding. Journal of the ACM, 24(2):290-297, April 1977. [BibTeX entry]

• Philip J. Davis. Proof, completeness, transcendentals, and sampling. Journal of the ACM, 24(2):298-310, April 1977. [BibTeX entry]

• C. M. Fiduccia and Y. Zalcstein. Algebras having linear multiplicative complexities. Journal of the ACM, 24(2):311-331, April 1977. Citations. [BibTeX entry]

• John Hopcroft, Wolfgang Paul, and Leslie Valiant. On time versus space. Journal of the ACM, 24(2):332-337, April 1977. Citations. [BibTeX entry]

• Neil D. Jones and Steven S. Muchnick. Even simple programs are hard to analyze. Journal of the ACM, 24(2):338-350, April 1977. Citations. [BibTeX entry]

Volume 24, Number 3, July 1977

• A. Michael Ballantyne and W. W. Bledsoe. Automatic proofs of theorems in analysis using nonstandard techniques. Journal of the ACM, 24(3):353-374, July 1977. [BibTeX entry]

• Guy Fayolle, Erol Gelenbe, and Jacques Labetoulle. Stability and optimal control of the packet switching broadcast channel. Journal of the ACM, 24(3):375-386, July 1977. [BibTeX entry]

• Harry B. Hunt III and Daniel J. Rosenkrantz. On equivalence and containment problems for formal languages. Journal of the ACM, 24(3):387-396, July 1977. [BibTeX entry]

• R. Attar and A. S. Fraenkel. Local feedback in full-text retrieval systems. Journal of the ACM, 24(3):397-417, July 1977. [BibTeX entry]

• Abraham Bookstein and Don Kraft. Operations research applied to document indexing and retrieval decisions. Journal of the ACM, 24(3):418-427, July 1977. [BibTeX entry]

• Douglas Comer and Ravi Sethi. The complexity of trie index construction. Journal of the ACM, 24(3):428-440, July 1977. [BibTeX entry]

• K. Hwang and S. B. Yao. Optimal batched searching of tree structured files in multiprocessor computer systems. Journal of the ACM, 24(3):441-454, July 1977. [BibTeX entry]

• R. J. Lipton and L. Snyder. A linear time algorithm for deciding subject security. Journal of the ACM, 24(3):455-464, July 1977. [BibTeX entry]

• Benjamin W. Y. Lin and Ronald L. Rardin. Development of a parametric generating procedure for integer programming test problems. Journal of the ACM, 24(3):465-472, July 1977. [BibTeX entry]

• Lawrence T. Kou. On live-dead analysis for global data flow problems. Journal of the ACM, 24(3):473-483, July 1977. Citations. [BibTeX entry]

• John C. Reynolds. Semantics of the domain of flow diagrams. Journal of the ACM, 24(3):484-503, July 1977. Citations. [BibTeX entry]

• Ben Wegbreit. Complexity of synthesizing inductive assertions. Journal of the ACM, 24(3):504-512, July 1977. [BibTeX entry]

• L. Hyafil and H. T. Kung. The complexity of parallel evaluation of linear recurrences. Journal of the ACM, 24(3):513-521, July 1977. [BibTeX entry]

• Richard J. Lipton and Yechezkel Zalcstein. Word problems solvable in logspace. Journal of the ACM, 24(3):522-526, July 1977. Citations. [BibTeX entry]

• K. L. Krause, V. Y. Shen, and H. D. Schwetman. Errata: ``Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems''. Journal of the ACM, 24(3):527, July 1977. [BibTeX entry]

Volume 24, Number 4, October 1977

• Robert E. Shostak. On the SUP-INF method for proving Presburger formulas. Journal of the ACM, 24(4):529-543, October 1977. Citations. [BibTeX entry]

• R. A. deMillo, K. Vairavan, and E. Sycara-Cyranski. A study of schedules as models of synchronous parallel computation. Journal of the ACM, 24(4):544-565, October 1977. [BibTeX entry]

• Mamoru Maekawa. Queueing models for computer systems connected by a communication line. Journal of the ACM, 24(4):566-582, October 1977. [BibTeX entry]

• Nancy Lynch. Log space recognition and translation of parenthesis languages. Journal of the ACM, 24(4):583-590, October 1977. Citations. [BibTeX entry]

• Ian F. Blake and Alan G. Konheim. Big buckets are (are not) better! Journal of the ACM, 24(4):591-606, October 1977. Citations. [BibTeX entry]

• C. T. Yu and W. S. Luk. Analysis of effectiveness of retrieval in clustered files. Journal of the ACM, 24(4):607-622, October 1977. [BibTeX entry]

• T. D. Bui. Errata and comments on a paper by J. R. Cash. Journal of the ACM, 24(4):623, October 1977. [BibTeX entry]

• S. C. Sahasrabudhe and A. D. Kulkarni. On solving Fredholm integral equations of the first kind. Journal of the ACM, 24(4):624-629, October 1977. [BibTeX entry]

• Bharat Kinariwala and A. G. Rao. Flow switching approach to the maximum flow problem: I. Journal of the ACM, 24(4):630-645, October 1977. [BibTeX entry]

• Kenneth J. Omahen. Capacity bounds for multiresource queues. Journal of the ACM, 24(4):646-663, October 1977. [BibTeX entry]

• Daniel S. Hirschberg. Algorithms for the longest common subsequence problem. Journal of the ACM, 24(4):664-675, October 1977. Citations. [BibTeX entry]

• Shawpawn Kumar Das. A machine representation of finite T_0 topologies. Journal of the ACM, 24(4):676-692, October 1977. [BibTeX entry]

• Paul Young. Optimization among provably equivalent programs. Journal of the ACM, 24(4):693-700, October 1977. Citations. [BibTeX entry]

Shortcuts: