Journal of the ACM -- 1978

Volume 25, Number 1, January 1978

• Y. Perl and Y. Shiloach. Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM, 25(1):1-9, January 1978. [BibTeX entry]

• Luigi Logrippo. Renamings and economy of memory in program schemata. Journal of the ACM, 25(1):10-22, January 1978. [BibTeX entry]

• Ronald V. Book. Simple representations of certain classes of languages. Journal of the ACM, 25(1):23-31, January 1978. Citations. [BibTeX entry]

• Harry B. Hunt III and Thomas G. Szymanski. Lower bounds and reductions between grammar problems. Journal of the ACM, 25(1):32-51, January 1978. Citations. [BibTeX entry]

• R. Attar, Y. Choueka, N. Dershowitz, and A. S. Fraenkel. KEDMA -- linguistic tools for retrieval systems. Journal of the ACM, 25(1):52-66, January 1978. [BibTeX entry]

• W. S. Cooper and M. E. Maron. Foundations of probabilistic and utility-theoretic indexing. Journal of the ACM, 25(1):67-80, January 1978. [BibTeX entry]

• A. H. Sameh and D. J. Kuck. On stable parallel linear system solvers. Journal of the ACM, 25(1):81-91, January 1978. Citations. [BibTeX entry]

• Teofilo Gonzalez and Sartaj Sahni. Preemptive scheduling of uniform processor systems. Journal of the ACM, 25(1):92-101, January 1978. Citations. [BibTeX entry]

• Zvi Galil and Joel Seiferas. A linear-time on-line recognition algorithm for ``palstar''. Journal of the ACM, 25(1):102-111, January 1978. [BibTeX entry]

• W. Morven Gentleman. Some complexity results for matrix computations on parallel processors. Journal of the ACM, 25(1):112-115, January 1978. Citations. [BibTeX entry]

• Oscar H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116-133, January 1978. Citations. [BibTeX entry]

• Harry R. Lewis. Renaming a set of clauses as a Horn set. Journal of the ACM, 25(1):134-135, January 1978. Citations. [BibTeX entry]

• C. P. Schnorr. Satisfiability is quasilinear complete in NQL. Journal of the ACM, 25(1):136-145, January 1978. Citations. [BibTeX entry]

• Joel I. Seiferas, Michael J. Fischer, and Albert R. Meyer. Separating nondeterministic time complexity classes. Journal of the ACM, 25(1):146-167, January 1978. Citations. [BibTeX entry]

• Mitchell Wand. A new incompleteness result for Hoare's system. Journal of the ACM, 25(1):168-175, January 1978. Citations. [BibTeX entry]

Volume 25, Number 2, April 1978

• Edward C. Horvath. Stable sorting in asymptotically optimal time and extra space. Journal of the ACM, 25(2):177-199, April 1978. [BibTeX entry]

• Ronald L. Rivest. Optimal arrangement of keys in a hash table. Journal of the ACM, 25(2):200-209, April 1978. Citations. [BibTeX entry]

• C. T. Yu, G. Salton, and M. K. Siu. Effective automatic indexing using term addition and detection. Journal of the ACM, 25(2):210-225, April 1978. [BibTeX entry]

• Gérard M. Baudet. Asynchronous iterative methods for multiprocessors. Journal of the ACM, 25(2):226-244, April 1978. Citations. [BibTeX entry]

• H. T. Kung and J. F. Traub. All algebraic functions can be computed fast. Journal of the ACM, 25(2):245-260, April 1978. Citations. [BibTeX entry]

• William McKie. An example of a skewing function. Journal of the ACM, 25(2):261-265, April 1978. [BibTeX entry]

• John M. Mulvey. Pivot strategies for primal-simplex network codes. Journal of the ACM, 25(2):266-270, April 1978. Citations. [BibTeX entry]

• David R. Musser. On the efficiency of a polynomial irreducibility test. Journal of the ACM, 25(2):271-282, April 1978. Citations. [BibTeX entry]

• K. Omahen and V. Marathe. Analysis and applications of the delay cycle for the M/M/c queueing system. Journal of the ACM, 25(2):283-303, April 1978. [BibTeX entry]

• Andris A. Zoltners. A direct descent binary knapsack algorithm. Journal of the ACM, 25(2):304-311, April 1978. [BibTeX entry]

• Neil D. Jones and Steven S. Muchnick. The complexity of finite memory programs with recursion. Journal of the ACM, 25(2):312-231, April 1978. [BibTeX entry]

• David Maier. The complexity of some problems on subsequences and supersequences. Journal of the ACM, 25(2):322-336, April 1978. Citations. [BibTeX entry]

• Andrew C. Yao and Ronald L. Rivest. k+1 heads are better than k. Journal of the ACM, 25(2):337-340, April 1978. Citations. [BibTeX entry]

Volume 25, Number 3, July 1978

• Malcolm C. Harrison and Norman Rubin. Another generalization of resolution. Journal of the ACM, 25(3):341-351, July 1978. [BibTeX entry]

• L. H. Landweber and E. L. Robertson. Properties of conflict-free and persistent Petri nets. Journal of the ACM, 25(3):352-364, July 1978. Citations. [BibTeX entry]

• D. G. Kafura and V. Y. Shen. An algorithm to design the memory configuration of a computer network. Journal of the ACM, 25(3):365-377, July 1978. [BibTeX entry]

• Gururaj S. Rao. Performance analysis of cache memories. Journal of the ACM, 25(3):378-395, July 1978. Citations. [BibTeX entry]

• Doron Rotem and Y. L. Varol. Generation of binary trees from ballot sequences. Journal of the ACM, 25(3):396-404, July 1978. Citations. [BibTeX entry]

• I. H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the ACM, 25(3):405-414, July 1978. Citations. [BibTeX entry]

• Herbert S. Wilf. A global bisection algorithm for computing the zeros of polynomials in the complex plane. Journal of the ACM, 25(3):415-420, July 1978. [BibTeX entry]

• A. C. McKellar and C. K. Wong. Dynamic placement of records in linear storage. Journal of the ACM, 25(3):421-434, July 1978. [BibTeX entry]

• R. S. Garfinkel and K. C. Gilbert. The bottleneck traveling salesman problem: Algorithms and probabilistic analysis. Journal of the ACM, 25(3):435-448, July 1978. Citations. [BibTeX entry]

• Donald L. Iglehart and Gerald S. Shedler. Regenerative simulation of response times in networks of queues. Journal of the ACM, 25(3):449-460, July 1978. [BibTeX entry]

• C. A. R. Hoare. Some properties of predicate transformers. Journal of the ACM, 25(3):461-480, July 1978. Citations. [BibTeX entry]

• Jon T. Butler. Analysis and design of fanout-free networks of positive symmetric gates. Journal of the ACM, 25(3):481-498, July 1978. [BibTeX entry]

• M. R. Garey and D. S. Johnson. ``Strong'' NP-completeness results: Motivation, examples, and implications. Journal of the ACM, 25(3):499-508, July 1978. Citations. [BibTeX entry]

• Nicholas Pippenger. A time-space trade-off. Journal of the ACM, 25(3):509-515, July 1978. Citations. [BibTeX entry]

Volume 25, Number 4, October 1978

• Alon Itai, Michael Rodeh, and Steven L. Tanimoto. Some matching problems for bipartite graphs. Journal of the ACM, 25(4):517-525, October 1978. Citations. [BibTeX entry]

• Brian Allen and Ian Munro. Self-organizing binary search trees. Journal of the ACM, 25(4):526-535, October 1978. Citations. [BibTeX entry]

• J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson. On the average number of maxima in a set of vectors and applications. Journal of the ACM, 25(4):536-543, October 1978. [BibTeX entry]

• Leo J. Guibas. The analysis of hashing techniques that exhibit k-ary clustering. Journal of the ACM, 25(4):544-555, October 1978. [BibTeX entry]

• Donald B. Johnson and Samuel D. Kashdan. Lower bounds for selection in X+Y and other multisets. Journal of the ACM, 25(4):556-570, October 1978. Citations. [BibTeX entry]

• S. Crespi-Reghizzi, G. Guida, and D. Mandrioli. Noncounting context-free languages. Journal of the ACM, 25(4):571-580, October 1978. Citations. [BibTeX entry]

• R. P. Brent and H. T. Kung. Fast algorithms for manipulating formal power series. Journal of the ACM, 25(4):581-595, October 1978. Citations. [BibTeX entry]

• Alon Itai. Two-commodity flow. Journal of the ACM, 25(4):596-611, October 1978. [BibTeX entry]

• E. L. Lawler and J. Labetoulle. On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM, 25(4):612-619, October 1978. Citations. [BibTeX entry]

• Hendrik Vantilborgh. Exact aggregation in exponential queueing networks. Journal of the ACM, 25(4):620-629, October 1978. [BibTeX entry]

• Daniel Brand. Path calculus in program verification. Journal of the ACM, 25(4):630-651, October 1978. [BibTeX entry]

• Peter J. Downey and Ravi Sethi. Assignment commands with array references. Journal of the ACM, 25(4):652-666, October 1978. [BibTeX entry]

• Ravi Sethi. Conditional expressions with equality tests. Journal of the ACM, 25(4):667-674, October 1978. Citations. [BibTeX entry]

• A. C. Avrillias and D. G. Maritsas. Partitioning the period of a class of m-sequences and application to pseudorandom number generation. Journal of the ACM, 25(4):675-686, October 1978. [BibTeX entry]

• Harry B. Hunt III and Thomas G. Szymanski. Corrigendum: ``Lower bounds and reductions between grammar problems''. Journal of the ACM, 25(4):687-688, October 1978. References. [BibTeX entry]

Shortcuts: