%A J.D. Rutledge
%T On Ianov's program schemata
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 1-9

%A R.R. Brown
%T Tape sets and automata
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 10-14

%A John Cocke
%A Marvin Minsky
%T Universality of tag systems with P=2
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 15-20

%A D.J. Farber
%A R.E. Griswold
%A I.P. Polonsky
%T SNOBOL, a string manipulation language
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 21-30

%A T.E. Hull
%A A.R. Dorell
%T Mixed congruential random number generators for binary machines
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 31-40

%A Frank Stockmal
%T Calculations with pseudo-random numbers
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 41-52

%A C. Donald la\ Budde
%T Two new classes of algorithms for finding the eigenvalues and eigenvectors
of real symmatrix matrices
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 53-58

%A Josef Stoer
%T A direct method for Chebyshev approximation by rational functions
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 59-69

%A William F. Pickard
%T Tables of the generalized Stirling numbers of the first kind
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 70-78

%A T. Giammo
%T A mathematical method for the automatic scaling of a function
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 79-83

%A Michael Yeoli
%A Shlomo Rinon
%T Application of ternary algebra to the study of static hazards
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 84-97

%A E.J. Gauss
%T Estimation of power spectral density by filters
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 98-103

%A Maurice Pollack
%T Message route control in a large teletype network
%J Journal of the ACM
%K jacm
%V 11
%N 1
%D January 1964
%P 104-116

%A William S. Cooper
%T Fact retrieval and decutive question-answering information retrieval systems
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 117-137

%A Harold Borko
%A Myrna Bernick
%T Automatic document classification part II: additional experiments
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 138-151

%A R. Schroeder
%T Input data source limitations for real-time operation of digital computers
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 152-158

%A B. Randell
%A L.J. Russell
%T Single-scan techniques for the translation of arithmetic expressions
in Algol 60
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 159-167

%A R.L. Ashenhurst
%T Function evaluation in unnormalized arithmetic
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 168-187

%A William B. Cragg
%A Hans J. Stetter
%T Generalized multispet predictor-corrector methods
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 188-209

%A Leonard Tornheim
%T Convergence of multipoint iterative methods
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 211-220

%A James Ferguson
%T Multivariable curve interpolation
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 221-228

%A William F. Pickard
%T Tables for the step-by-step integration
of ordinary differential equations of the first order
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 229-233

%A W.J. Hemmerle
%T Algebraic specification of statistical models
for analysis of variance computations
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 234-239

%A K.U. Smith
%A S.D. Ansell
%A J. Koehler
%A G.H. Servos
%T Digital computer system for dynamic analysis
of speech and sound feedback mechanisms
%J Journal of the ACM
%K jacm
%V 11
%N 2
%D July 1964
%P 240-251

%A James R. Slagle
%T An efficient algorithm for finding certain minimum-cost procedures
for making binary decisions
%J Journal of the ACM
%K jacm
%V 11
%N 3
%D July 1964
%P 253-264

%A Ivan Flores
%T Derivation of a waiting-time factor for a multiple-bank memory
%J Journal of the ACM
%K jacm
%V 11
%N 3
%D July 1964
%P 265-282

%A Eugene L. Lawler
%T An approach to multilevel boolean minimization
%J Journal of the ACM
%K jacm
%V 11
%N 3
%D July 1964
%P 283-295

%A Martin Cohn
%T Properties of linear machines
%J Journal of the ACM
%K jacm
%V 11
%N 3
%D July 1964
%P 296-301

%A Seymour Ginsburg
%A thomas N. Hubbard
%T Solvability of machine mappings of regular sets to regular sets
%J Journal of the ACM
%K jacm
%V 11
%N 3
%D July 1964
%P 302-312

%A C.C. Elgot
%A J.D. Rutledge
%T RS-machines with almost blank tape
%J Journal of the ACM
%K jacm
%V 11
%N 3
%D July 1964
%P 313-337

%A S. Winograd
%T Input-error-limiting automata
%J Journal of the ACM
%K jacm
%V 11
%N 3
%D July 1964
%P 338-351

%A Morris Gershinsky
%A David A. Levine
%T Aitken-Hermite interpolation
%J Journal of the ACM
%K jacm
%V 11
%N 3
%D July 1964
%P 352-356

%A Richard Kronmal
%T Evaluation of a pseudo-randeom normal number generator
%J Journal of the ACM
%K jacm
%V 11
%N 3
%D July 1964
%P 357-363

%A Calvin C. Elgot
%A Abraham Robinson
%T Random-access stored-program machines, an approach to programming languages
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 365-399

%A W.R. Klingman
%A D.M. Himmelblau
%T Nonlinear programming with the aid of a multiple-gradient summation technique
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 400-415

%A Kenneth Hartt
%T Some analytical procedures for computers and their applications
to a class of multidimensional integrals
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 416-421

%A L. Duane Pile
%T Generalized inverse computations using the gradient projection method
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 422-428

%A Lee Krider
%T A flow analysis algorithm
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 429-436

%A John O'Connor
%T Mechanized indexing methods and their testing
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 437-449

%A Harold Sackman
%A J.B. Munson
%T Investigation of computer operating time and system capacity
for man-machine digital systems
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 450-464

%A A. Wood Edwards
%A Robert L. Chambers
%T Can a priori probabilities help in character recognition ?
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 465-470

%A R.F. Dressler
%A W. Werner
%T Error rates for two methods of statistical pattern recognition
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 471-480

%A Janusz A. Brzozowski
%T Derivatives of regular expressions
%J Journal of the ACM
%K jacm
%V 11
%N 4
%D October 1964
%P 481-494

%A M.W. Curtis
%T A Turing machine simulator
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 1-13

%A Robert M. McClure
%T A programming language for simulating digital systems
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 14-22

%A J.A. Robinson
%T A machine-oriented logic based on the resolution principle
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 23-41
%K foundations, resolution, unification

%A Sheila A. Greibach
%T A new normal form theorem for context-free phrase structure grammars
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 42-52

%A Eric Wolman
%T A fixed optimum cell-size for records of various lengths
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 53-70

%A H. Glass
%A L. Cooper
%T Sequential search: a method for solving constrained optimization problems
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 71-82

%A M. Donald McLaren
%A George Marsaglia
%T Uniform random number generators
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 83-89

%A Aaron Booker
%T Numerical evaluation of symmetric polynomials
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 90-94

%A R.W. Hockney
%T A fast direct solution of Poisson's equation using Fourier analysis
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 95-113

%A J.H. Bramble
%A B.E. Hubbard
%T Approximation of solutions of mixed boundary value problems
for Poisson's equation by finite differences
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 114-123

%A J.C. Butcher
%T A modified multistep method
for the numerical integration of ordinary differential equations
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 124-135

%A Edward B. Anders
%T An error bound for a numerical filtering technique
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 136-140

%A Arthur Gill
%T Analysis and synthesis of stable linear sequential circuits
%J Journal of the ACM
%K jacm
%V 12
%N 1
%D January 1965
%P 141-149

%A Paul W. Broome
%T Discrete orthonormal sequences
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 151-168

%A David G. Moursund
%T Examination of multiple roots and root clusters of a polynomial
using the Bernoulli procedure
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 169-174

%A R.D. Glauz
%T On the numerical solution of ordinary and partial differential equations
using integral relations
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 175-180

%A Charles B. Dunham
%T Convergence problems in Maehly's second method
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 181-186

%A G.P. Weeg
%T The automorphism group if the direct product of strongly related automata
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 187-195

%A Shen Lin
%A Tibor Rado
%T Computer studies of Turing machine problems
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 196-212

%A J.T. Chu
%T Optimal decision functions for computer character recognition
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 213-226

%A R.L. Crane
%A R.W. Kloppenstein
%T A predictor-corrector algorithm with an increased range of absolute stability
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 227-241

%A Herbert Kanner
%T Number base conversion in a significant digit arithmetic
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 242-246

%A Walter Penney
%T A "binary" system for complex numbers
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 247-248

%A Jerry Sanders
%T Document association and classification based on L-languages
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 249-253

%A Stephen Glicksman
%T Concerning the merging of equal length tape files
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 254-258

%A W.J. Dixon
%A R.A. Kronmal
%T The choice of origin and scale for graphs
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 259-261

%A C.L. Sheng
%T Threshold logic elements used as a probability transformer
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 262-276

%A S. Winograd
%T On the time required to perform addition
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 277-285

%A R.W. Stineman
%T Digital time-domain analysis of systems with widely separated poles
%J Journal of the ACM
%K jacm
%V 12
%N 2
%D April 1965
%P 286-293

%A W. Fraser
%T A survey of methods for computing minimax and near-minimax polynomial
approximations for functions of a single independent variable
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 295-314

%A A.P. Yershov
%T One view of man-machine interaction
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 315-325

%A Richard W. Conn
%A Richard E. von\ Holdt
%T An online display for the study of approximating functions
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 326-349

%A M.V. Menon
%T On a problem concerning a central storage device served by multiple terminals
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 350-355

%A William K. Winters
%T A modified method of latent class analysis
for file organization in information retrieval
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 356-363

%A Franco Mileto
%A Gianfranco Putzolu
%T Statistical complexity of algorithms for boolean function minimization
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 364-375

%A J.M.S. Simoes Pereira
%T On the boolean matrix equation Mprime = OR from i=1 to d Mi
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 376-382

%A David Moursund
%T Chebyshev solution of n+1 linear equations in n unknowns
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 383-387

%A Patrick C. Fischer
%T Generation of primes by a one-dimensional real-time iterative array
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 388-394

%A D.J. Newman
%T Location of the maximum on unimodal surfaces
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 395-398

%A A. Paz
%A B. Peleg
%T Ultimate-definite and symmatric-definite events and automata
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 399-410

%A Michael Yoeli
%T Generalized cascade decompositions of automata
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 411-422

%A Seymour Ginsburg
%A Edwin H. Spanier
%T Mappings of languages by two-tape devices
%J Journal of the ACM
%K jacm
%V 12
%N 3
%D July 1965
%P 423-435

%A Leroy F. Meyers
%T Morphological classification
in the National Bureau of Standards mechanical translation system
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 437-472

%A Lauren B. Doyle
%T Is automatic classification
a reasonable application of statistical analysis of text ?
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 473-489

%A John O'Connor
%T Automatic subject recognition in scientific papers: an empirical study
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 490-515

%A Solomon W. Golomb
%A Leonard D. Baumert
%T Backtrack programming
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 516-524

%A A.V. Srinivasan
%T An investigation of some computational aspects of integer programming
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 525-535

%A Lawrence Wos
%A George A. Robinson
%A Daniel F. Carson
%T Efficiency and completeness of the set of support strategy in theorem proving
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 536-541

%A T.R.N. Rao
%A N. Zierler
%T On mappings for modular arithmetic, I
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 542-544

%A S. Berkovits
%A M. Schlessinger
%A N. Zierler
%T On mappings for modular arithmetic, II
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 545-546

%A Donald G. Anderson
%T Iterative procedures for nonlinear integral equations
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 547-560

%A Bruce Barnes
%T Groups of automorphisms and sets of equivalence classes of input for automata
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 561-565

%A A.C. Fleck
%T On the automorphism group of an automaton
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 566-569

%A Wei Chang
%A Donald J. Wong
%T Analysis of real time multiprogramming
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 570-580

%A Jack B. Dennis
%T Segmentation and the design of multiprogrammed computer systems
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 581-602

%A G.B. Dantzig
%A R.P. Harvey
%A R.D. McKnight
%T Updating the product form of the inverse for the revised simplex method
(a summary)
%J Journal of the ACM
%K jacm
%V 12
%N 4
%D October 1965
%P 603

%A B.W. Arden
%A B.A. Galler
%A T.C. O'Brien
%A F.H. Westervelt
%T Program and addressing structure in a time-sharing environment
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 1-16

%A A.P. Yershov
%T ALPHA - an automatic programming system of high efficiency
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 17-24

%A J. Schwartz
%T Large parallel computers
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 25-32

%A A. Gill
%T Realization of input-output relations by sequential machines
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 33-42

%A L.R. Horwitz
%A R.M. Karp
%A R.E. Miller
%A S. Winograd
%T Index register allocation
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 43-61

%A Seymour Ginsburg
%A Joseph Ullian
%T Ambiguity in context free languages
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 62-89

%A Philip Gilbert
%T On the syntax of algorithmic languages
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 90-107

%A Charles B. Dunham
%T Convergence problems in Maehly's second method: part II
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 108-113

%A George D. Byrne
%A Robert J. Lambert
%T Pseudo-Runge-Kutta methods involving two points
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 114-123

%A R.N. Maddison
%T A procedure for nonlinear least squares refinement
in adverse practical conditions
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 124-134

%A C.A. Barlow,\ Jr.
%A E.L. Jones
%T A method for the solution of roots of a nonlinear equation
and for solution of the general eigenvalue problem
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 135-142

%A Takao Tsuda
%A Hiroshi Matsumoto
%T A note on linear extrapolation of multivariate functions
by the Monte Carlo method
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 143-150

%A Michael A. Harrison
%T On asymptotic estimates in switching and automata theory
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 151-157

%A Arto Salomaa
%T Two complete axiom systems for the algebra of regular events
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 158-169

%A Charles A. Trauth,\ Jr.
%T Group-type automata
%J Journal of the ACM
%K jacm
%V 13
%N 1
%D January 1966
%P 170-178

%A Leonard Kleinrock
%T Sequential processing machines (S.P.M.) analyzed with a queueing theory model
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 179-193

%A Ruth A. Weiss
%T BE VISION, a package of IBM 7090 Fortran programs
to draw orthographic views of combinations of plane and quadric surfaces
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 194-204

%A John T. Welch,\ Jr.
%T A mechanical analysis of the cyclic structure of undirected linear graphs
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 205-210

%A C.V. Ramamoorthy
%T Analysis of graphs by connectivity considerations
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 211-222

%A Stephen A. Cook
%T The solvability of the derivability problem for one-normal systems
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 223-225

%A Ward Douglas Maurer
%T A theory of computer instructions
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 226-235

%A Kojiro Kobayashi
%A Shigeru Sekiguchi
%T On the class of predicates decidable by two-way multitape finite automata
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 236-261

%A Howard Holtz
%A C.T. Leondes
%T The synthesis of recursive digital filters
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 262-280

%A Marvin Minsky
%A Seymour Papert
%T Unrecognizable sets of numbers
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 281-286

%A Riaz A. Usmani
%T Boundary value techniques for the numerical solution
of certain initial value problems in ordinary differential equations
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 287-295

%A Philip Rabinowitz
%T Numerical experiments in conformal mapping
by the method of orthogonal polynomials
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 296-303

%A W.W. Bledsoe
%T Some reults on multicategory pattern recognition
%J Journal of the ACM
%K jacm
%V 13
%N 2
%D April 1966
%P 304-316

%A B. Krishnamoorthi
%A Roger C. Wood
%T Time-shared computer operations
with both interarrival and service times exponential
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 317-338

%A Lewis T. Reinwald
%A Richard M. Soland
%T Conversion of limted-entry decision tables to optimal computer programs I:
minimum average processing time
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 339-358

%A Philip K. Hooper
%T Monogenic Post normal systems of arbitrary degree
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 359-363

%A Seymour Ginsburg
%A Joseph Ullian
%T Preservation of unambiguity and inherent ambiguity in context-free languages
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 364-368

%A Sigmund N. Porter
%T Use of multiwrite for general programmability of search memories
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 369-373

%A Fred R. Krogh
%T Predictor-corrector methods of high order
with improved stability characteristics
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 374-385

%A Bruce A. Chartres
%T Automatic controlled precision calculations
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 386-403

%A M. Donald MacLaren
%T Internal sorting by radix plus shifting
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 404-411

%A John S. Bailey
%T Generalized single-ended counters
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 412-418

%A William T. Weeks
%T Numerical inversion of Laplace transforms using Laguerre functions
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 419-429

%A R.W. Hamming
%A R.S. Pinkham
%T A class of integration formulas
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 430-438

%A Ivan Erdelyi
%T On the "reverse order law"
related to the generalized inverse of matrix products
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 439-443

%A D.L. Overheu
%T An abstract machine for symbolic computation
%J Journal of the ACM
%K jacm
%V 13
%N 3
%D July 1966
%P 444-468

%A Azriel Rosenfeld
%A John L. Pfaltz
%T Sequential operations in digital picture processing
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 471-494

%A E.K. Blum
%T A formal system for differentiation
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 495-504

%A Edward B. Anders
%T An extension of Romberg integration procedures to N variables
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 505-510

%A Satya D. Durey
%T Statistical determination
of certain mathematical constants and functions using computers
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 511-525

%A Junichi Toyoda
%A Yoshikazu Tezuka
%A Yoshiro Kasahara
%T Analysis of the address assignment problem for clustered keys
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 526-532

%A F.C. Hennie
%A R.E. Stearns
%T Two-tape simulation of multitape Turing machines
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 533-546

%A Gregory J. Chaitin
%T On the length of programs for computing finite binary sequences
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 547-569

%A Rohit J. Parikh
%T On context-free languages
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 570-581

%A Sheila A. Greibach
%T The unsolvability of the recognition of linear context-free languages
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 582-587

%A Thomas N. Hibbard
%A Joseph Ullian
%T The independence of inherent ambiguity from complementedness
among context-free languages
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 588-593

%A Philip K. Hooper
%T The immortality problem for Post normal systems
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 594-599

%A H. Shaw
%T Discrete analogs for continuous filters
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 600-604

%A C.D. Negron
%T Digital one-third octave spectral analysis
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 605-614

%A J.S. Mamelak
%T The placement of computer logic modules
%J Journal of the ACM
%K jacm
%V 13
%N 4
%D October 1966
%P 615-629

%A Alan J. Perlis
%T The synthesis of algorithmic systems
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 1-9
%K Turing lecture

%A Marvin C. Wunderlich
%T Sieving procedures on a digital computer
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 10-19

%A P.A.W. Lewis
%A P.B. Baxendale
%A J.L. Bennett
%T Statistical discrimination
of the synonymy/antonymy relationship between words
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 20-44

%A Carl H. Brans
%T A computer program for the nonnumerical testing and reduction
of sets of algebraic partial differential equations
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 45-62

%A Bruce A. Chartres
%A James C. Geuder
%T Computable error bounds for direct solution of linear equations
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 63-71

%A G.W. Stewart,\ III
%T A modification of Davidson's minimization method
to accept difference approximations of derivatives
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 72-83

%A John C. Butcher
%T A multistep generalization of Runge-Kutta methods with four or five stages
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 84-99

%A R.R. Coveyou
%A R.D. MacPherson
%T Fourier analysis of uniform random number generators
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 100-119

%A Tzay Y. Young
%T Binomial-weighted orthogonal polynomials
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 120-127

%A George E. Collins
%T Subresultants and reduced polynomial remainder sequences
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 128-142

%A Brian Shaw
%T Modified multistep methods based on a nonpolynomial interpolant
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 143-154

%A J.J. Kohfield
%A G.T. Thompson
%T Multistep methods with modified predictors and correctors
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 155-166

%A Ann Yasuhara
%T A remark on Post normal systems
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 167-171

%A Seymour Ginsburg
%A Sheila A. Greibach
%A Michael A. Harrison
%T Stack automata and compiling
%J Journal of the ACM
%K jacm
%V 14
%N 1
%D January 1967
%P 172-201

%A Robert C. Minnick
%T A survey of microcellular research
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 203-241

%A Leonard Kleinrock
%T Time-shared systems: a theoretical treatment
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 242-261

%A Jack E. Shemer
%T Some mathematical considerations of time-sharing scheduling algorithms
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 262-272

%A J.T. Chu
%A J.C. Chueh
%T Error probability in decision functions for character recognition
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 273-280

%A David Martin
%A Gerald Estrin
%T Models of computations and systems -
evaluation of vertex probabilities in graph models of computations
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 281-299

%A William M. Waite
%T Path detection in multidimensional iterative arrays
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 300-310

%A J.B. Moore
%T A convergent algorithm for solving polynomial equations
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 311-315

%A Cleve B. Moler
%T Iterative refinement in floating point
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 316-321

%A Manuel Blum
%T A machine-independent theory of the complexity of recursive functions
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 322-336

%A W.J. Westlake
%T A uniform random number generator
based on the combination of two congruential generators
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 337-340

%A O.G. Mancino
%T Resolution by iteration of some nonlinear systems
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 341-350

%A Fred T. Krogh
%T A test for instability in the numerical solution
of ordinary differential equations
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 351-354

%A A. Ginzburg
%T A procedure for checking equality of regular expressions
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 355-362

%A C.W. Cryer
%T On the numerical solution of a quasi-linear elliptic equation
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 363-375

%A Alan Natapoff
%T Irreducible topological components of an arbitrary boolean truth function
and generation of their minimal coverings
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 376-381

%A H.E. Pickett
%T Note concerning the algebraic theory of automata
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 382-388

%A Seymour Ginsburg
%A Sheila A. Greibach
%A Michael A. Harrison
%T One-way stack automata
%J Journal of the ACM
%K jacm
%V 14
%N 2
%D April 1967
%P 389-418

%A D.P. Gaver,\ Jr.
%T Probability models for multiprocessor computer systems
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 423-438

%A G.K. Manacher
%T Production and stabilization of real-time task schedules
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 439-465

%A J.A. Brzozowski
%T Roots of star events
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 466-477

%A Richard M. Karp
%T Some bounds on the storage requirements
of sequential machines and Turing machines
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 478-489

%A Robert McNaughton
%T Parenthesis grammars
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 490-500

%A Daniel J. Rosenkrantz
%T Matrix equations and normal forms for context-free grammars
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 501-507

%A L. Oliver
%T Analysis of factorial experiments using generalized matrix operations
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 508-519

%A Victor Klee
%T A method for constructing circuit codes
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 520-528

%A Frederic J. Mowle
%T An algorithm for generating stable feedback shift registers of order n
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 529-542

%A J.L Rigal
%A J. Gaches
%T On the compatibility of a given solution with the data of a linear system
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 543-548

%A J.S. Hicks
%A J. Wei
%T Numerical solution of parabolic partial differential equations
with two-point boundary conditions by use of the methods of lines
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 549-562

%A Richard M. Karp
%A Raymond E. Miller
%A Shmuel Winograd
%T The organization of computations for uniform recurrence equations
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 563-390

%A A.B. Carroll
%A R.T. Wetherald
%T Application of parallel processing to numerical weather prediction
%J Journal of the ACM
%K jacm
%V 14
%N 3
%D July 1967
%P 591-614

%A Donald E. Knuth
%A Richard H. Bigelow
%T Programming languages for automata
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 615-635

%A Robert W. Floyd
%T Nondeterministic algorithms
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 636-644

%A Arnold L. Rosenberg
%T Real-time definable languages
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 645-662

%A J. Hartmanis
%T On memory requirements for context-free language recognition
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 663-665

%A Arthur Gill
%A J. Robert Flexer
%T Periodic decomposition of sequential machines
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 666-676

%A Stal Aanderaa
%A Patrick C. Fischer
%T The solvability of the halting problem for 2-state Post machines
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 677-682

%A Bruce H. Barnes
%A John M. Fitzgerald
%T Minimal experiments for input-independent machines
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 683-686

%A James R. Slagle
%T Automatic theorem proving with renamable and semantic resolution
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 687-697

%A Lawrence Wos
%A George A. Robinson
%A Daniel F. Carson
%A Leon Shalla
%T The concept of demodulation in theorem proving
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 698-709

%A Robert A. Fairthorne
%T Morphology of "information flow"
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 710-719

%A Marvin B. Shapiro
%T An algorithm for reconstructing protein and RNA sequences
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 720-731

%A V.G. Sigillito
%T On a continuous method of approximating solutions of the heat equation
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 732-741

%A Lewis T. Reinwald
%A Richard M. Soland
%T Conversion of limited-entry decision tables to optimal computer programs II:
minimum storage requirement
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 742-756

%A Marshall C. Pease
%T Matrix inversion using parallel processing
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 757-764

%A P.L. Odell
%A H.P. Decell
%T On computing the fixed-point probability vector
of ergodic transition matrices
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 765-768

%A D.G. Brush
%A J.J. Kohfield
%A G.T. Thompson
%T Solution of ordinary differential equations using two "off-step" points
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 769-784

%A A. van\ Gelder
%T Some new results in pseudo-random number generation
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 785-792

%A S. Winograd
%T On the time required to perform multiplication
%J Journal of the ACM
%K jacm
%V 14
%N 4
%D October 1967
%P 793-802

%A Maurice V. Wilkes
%T Computers then and now
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 1-7
%K Turing lecture

%A G. Salton
%A M.E. Lesk
%T Computer evaluation of indexing and text processing
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 8-36

%A Niklaus Wirth
%T PL360, a programming language for the 360 computers
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 37-74

%A Robert E. Echols
%A Leon Cooper
%T Solution of integer linear programming problems by direct search
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 75-84

%A James R. Slagle
%A Philip Bursky
%T Experiments with a multipurpose, theorem-proving heuristic program
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 85-99

%A Otto Neall Strand
%A Ed R. Westwater
%T Statistical estimation of the numerical solution
of a Fredhold integral equation of the first kind
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 100-114

%A H. Dubner
%A J. Abate
%T Numerical inversion of Laplace transforms
by relating them to the finite Fourier cosine transform
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 115-123

%A Donald M. Kaplan
%T Some completeness results in the mathematical theory of computation
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 124-134

%A Zamir Bavel
%T Structure and transition-preserving functions of finite automata
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 135-158

%A Abraham Waksman
%T A permutation network
%J Journal of the ACM
%K jacm
%V 15
%N 1
%D January 1968
%P 159-163

%A J. Sklansky
%A M. Finkelstein
%A E.C. Russell
%T A formalism for program translation
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 165-175

%A P.A. Gilmore
%T Structuring of parallel algorithms
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 176-192

%A B. Kubert
%A J. Szabo
%A S. Giulieri
%T The prespective representation of functions of two variables
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 193-204

%A Stephen P. Morse
%T A mathematical model for the analysis of contour-line data
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 205-220

%A A. Orden
%A V. Nalbandian
%T A bidirectional simplex algorithm
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 221-235

%A Donald W. Loveland
%T Mechanical theorem-proving by model elimination
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 236-251

%A Marshall C. Pease
%T An adaptation of the fast Fourier transform for parallel processing
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 252-264

%A Frank J. Zeleznik
%T Quasi-Newton methods for nonlinear equations
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 265-271

%A Gerald L. Morris
%A Patrick L. Odell
%T Common solution for n matrix equations with applications
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 272-274

%A Oliver Aberth
%T Analysis in a computable number field
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 275-299

%A Marcel Paul Schutzenberger
%T A remark on acceptable sets of numbers
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 300-303

%A Raymond T. Yeh
%T Generalized pair algebra with applications to automata theory
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 304-316

%A J.E. Hopcroft
%A J.D. Ullman
%T Decidable and undecidable questions about automata
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 317-324

%A J. Hartmanis
%T Computational complexity of one-tape Turing machine computations
%J Journal of the ACM
%K jacm
%V 15
%N 2
%D April 1968
%P 325-339

%A E.G. Coffman,\ Jr.
%T Analysis of two time-sharing algorithms designed for limited swapping
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 341-353

%A Paul G. Comba
%T A procedure for detecting intersections of three-dimensional objects
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 354-366

%A Peter B. Andrews
%T Resolution with merging
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 367-381

%A J. Hartmanis
%A H. Shank
%T On the recognition of primes by automata
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 382-389

%A J.J. Kohfield
%A G.T. Thompson
%T A modification of Nordsieck's method using an "off-step" point
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 390-401

%A Gerhard Zielke
%T Inversion of modified symmetric matrices
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 402-408

%A T.V. Griffiths
%T The unsolvability of the equivalence problem
for LAMBDA-free nondeterministic generalized machines
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 409-413

%A John E. Hopcroft
%A Jeffrey D. Ullman
%T Relations between time and tape complexities
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 414-427

%A Seymour Ginsburg
%A Michael A. Harrison
%T One-way deterministic real-time list-storage languages
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 428-446

%A B.A. Chartres
%A J.J. Florentin
%T A universal syntax-directed top-down analyzer
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 447-464

%A P.M. Lewis,\ II
%A R.E. Stearns
%T Syntax-directed transduction
%J Journal of the ACM
%K jacm
%V 15
%N 3
%D July 1968
%P 465-488

%A C.C. Gotlieb
%A S. Kumar
%T Semantic clustering of index terms
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 493-513

%A Donald R. Morrison
%T PATRICIA - practical algorithm to retrieve information coded in alphanumeric
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 514-534

%A Thomas C. Lowe
%T The influence of data base characteristics and usage
on direct access file organization
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 535-548

%A Edward C. Coffman
%A Leonard Kleinrock
%T Feedback queueing models for time-shared systems
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 549-576

%A Joseph Abate
%A Harvey Dubner
%A Sheldon B. Weinberg
%T Queueing analysis of the IBM 2314 disk storage facility
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 577-589

%A Raymond Reiter
%T Scheduling parallel computations
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 590-599

%A U. Montanari
%T A method for obtaining skeletons using a quasi-euclidean distance
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 600-624

%A J.R. Quinlan
%A E.B. Hunt
%T A formal deductive problem-solving system
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 625-646

%A Alfred V. Aho
%T Indexed grammars - an extension of context-free grammars
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 647-671

%A Arnold L. Rosenberg
%T On the independence of real-time definability
and certain structural properties of context-free languages
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 672-679

%A Dennis F. Cudia
%A Wilson E. Singletary
%T Degrees of unsolvability in formal grammars
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 680-692

%A Amar Mukhopadhyay
%T Representation of events in the von Neumann cellular model
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 693-705

%A Abbas I. Abdel Karim
%T A theorem for the stability of general predictor-corrector methods
for the solution of systems of differential equations
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 706-711

%A James Dyer
%T Generalized multistep methods in satellite orbit computation
%J Journal of the ACM
%K jacm
%V 15
%N 4
%D October 1968
%P 712-719

%A G. Salton
%T On the role of the ACM Journal
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 1-2
%K editorial

%A Seymour Ginsburg
%A John Hopcroft
%T Two-way balloon automata and AFL
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 3-13
%K automata theory

%A Alain Colmerauer
%T Total precedence relations
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 14-30
%K formal languages

%A Dennis F. Cudia
%T General problems of formal grammars
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 31-43
%K formal languages

%A Arnold L. Rosenberg
%T A note on ambiguity of context-free languages
and presentations of semilinear sets
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 44-50
%K formal languages

%A D.G. Corneil
%A C.C. Gotlieb
%T An efficient algorithm for graph isomorphism
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 51-64
%K pattern recognition

%A Herbert M. Gurk
%A Jack Minker
%T Storage requirements for information handling centers
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 65-77
%K information retrieval

%A Donald R. Chand
%A Sham S. Kapur
%T An algorithm for convex polytopes
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 78-86
%K numerical mathematics

%A F.G. Gustavson
%A W. Liniger
%A R. Willoughby
%T Symbolic generation of an optimal crout algorithm
for sparse systems of linear equations
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 87-109
%K numerical mathematics

%A C.D. Meyer
%A R.J. Painter
%T Note on a least squares inverse of a matrix
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 110-112
%K numerical mathematics

%A S.K. Chang
%A A. Gill
%T Algorithmic solution of the change-making problem
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 113-122
%K operations research

%A E.G. Coffman,\ Jr.
%A R.R. Muntz
%A H. Trotter
%T Waiting time distributions for processor sharing systems
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 123-130
%K operating systems

%A Philip J. Rasch
%T A queueing theory study
of round-robin scheduling of time-shared computer systems
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 131-145
%K operating systems

%A Azriel Rosenfeld
%T Connectivity in digital pictures
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 146-160
%K pattern recognition

%A J. Sklansky
%T Thresholded convolution operations
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 161-165
%K pattern recognition

%A M.A. Breuer
%T Simplification of the covering problem
with application to Boolean expressions
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 166-181
%K switching theory

%A Harold S. Stone
%T An algorithm for modular partitioning
%J Journal of the ACM
%K jacm
%V 17
%N 1
%D January 1970
%P 182-195
%K switching theory

%A Marvin Minsky
%T Form and content in computer science
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 197-215
%K Turing award lecture

%A Arthur J. Nevins
%T A programming language with automatic goal generation and selection
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 216-230
%K programming languages

%A Zamir Bavel
%A David E. Muller
%T Connectivity and reversibility in automata
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 231-240
%K automata theory

%A David G. Willis
%T Computational complexity and probability constructions
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 241-259
%K automata theory

%A H.C. Andrews
%A J. Kane
%T Kronecker matrices, computer implementation, and generalized spectra
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 260-268
%K numerical mathematics

%A Seymour Haber
%T Sequences of numbers that are approximately completely equidistributed
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 269-272
%K numerical mathematics

%A Peter Henrici
%T Methods of search for solving polynomial equations
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 273-283
%K numerical mathematics

%A H.S. Rahme
%T Stability analysis of a new algorithm
used for integrating a system of ordinary differential equations
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 284-293
%K numerical mathematics

%A A. Zafarullah
%T Application of the method of lines
to parabolic partial differential equations with error estimates
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 294-302
%K numerical mathematics

%A Richard H. Roth
%T An approach to solving linear discrete optimization problems
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 303-313
%K operations research

%A L.E.N. Delbrouck
%T A feedback queueing system with batch arrivals, bulk service,
and queue-dependent service time
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 314-338
%K operating systems

%A Louis Hodes
%T The logical complexity of geometric properties in the plane
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 339-347
%K pattern recognition

%A G. Ugo Montanari
%T On limit properties in digitization schemes
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 348-360
%K pattern recognition

%A J.M. Boyle
%A A.A. Grau
%T An algorithmic semantics for Algol 60 identifier notation
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 361-382
%K programming languages

%A B.L. Fox
%T Accelerating list processing in discrete programming
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 383-384
%K searching and sorting

%A B.F. Caviness
%T On canonical forms and simplification
%J Journal of the ACM
%K jacm
%V 17
%N 2
%D April 1970
%P 385-395
%K theory of computation

%A C.W. Cryer
%T On the approximate solution of free boundary problems
using finite differences
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 397-411
%K numerical mathematics

%A H.H. Kagiwada
%A R. kalaba
%T An initial-value theory for Fredholm integral equations
with semidegenerate kernels
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 412-419
%K numerical mathematics

%A Takao Tsuda
%A Kozo Ichida
%T Nonlinear interpolation of multivariable functions by the Monte Carlo method
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 420-425
%K numerical mathematics

%A R.R. Muntz
%A E.G. Coffman,\ Jr.
%A C.V. Ramamoorthy
%A K.M. Chandy
%T Optimization of memory hierarchies in multiprogrammed systems
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 426-445
%K operating systems

%A Richard I. Shrager
%T Nonlinear regression with linear constraints:
an extension of the magnified diagonal method
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 446-452
%K operations research

%A Alan C. Shaw
%T Parsing of graph-representable pictures
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 453-481
%K pattern recognition

%A H. Lynn Beus
%T The use of information in sorting
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 482-495
%K searching and sorting

%A W.D. Frazer
%A A.C. McKellar
%T Samplesort: a sampling approach to minimal storage tree sorting
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 496-507
%K searching and sorting

%A L.E. Stanfel
%T Tree structures for optimal searching
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 508-517
%K searching and sorting

%A Frederic J. Mowle
%T Controllability of nonlinear sequential networks
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 518-524
%K switching theory

%A Robert Anderson
%A W.W. Bledsoe
%T A linear format for resolution with merging
and a new technique for establishing completeness
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 525-534
%K theorem proving

%A James R. Slagle
%T Interpolation theorems for resolution in lower predicate calculus
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 535-542
%K theorem proving

%A J.L. Baer
%A D.P. Bovet
%A G. Estrin
%T Legality and other properties of graph models of computations
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 543-554
%K theory of computation

%A Zohar Manna
%A Amir Pnueli
%T Formalization of properties of functional programs
%J Journal of the ACM
%K jacm
%V 17
%N 3
%D July 1970
%P 555-569
%K theory of computation

%A J. Gary Augustson
%A Jack Minker
%T An analysis of some graph theoretical cluster techniques
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 571-588
%K information retrieval

%A Hiroshi Akima
%T A new method of interpolation and smooth curve fitting
based on local procedures
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 589-602
%K numerical mathematics

%A Donald I. Good
%A Ralph L. London
%T Computer interval arithmetic: definition and proof of correct implementation
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 603-612
%K numerical mathematics

%A William B. Gruttke
%T Pseudo Runge-Kutta methods of the fifth order
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 613-628
%K numerical mathematics

%A Masahiro Hashimoto
%T A method for solving large matrix equations
reduced from Fredholm integral equations of the second kind
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 629-636
%K numerical mathematics

%A Toyohisa Kaneko
%A Bede Liu
%T Accumulation of round-off error in Fast Fourier Transforms
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 637-654
%K numerical mathematics

%A L.F. Shampine
%T Efficiency of a procedure for near-minimax approximation
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 655-660
%K numerical mathematics

%A Brian T. Smith
%T Error bounds for zeros of a polynomial based upon Gerschgorin's theorems
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 661-674
%K numerical mathematics

%A P. Bonzon
%T Necessary and sufficient conditions
for dynamic programming of combinatorial type
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 675-682
%K operations research

%A Paul W. Purdom,\ Jr.
%A Stephen M. Stigler
%T Statistical properties of the buddy system
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 683-697
%K operating systems

%A C.L. Chang
%T The unit proof and the input proof in theorem proving
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 698-707
%K theorem proving

%A David Pager
%T On the efficiency of algorithms
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 708-714
%K theory of computation

%A Ravi Sethi
%A J.D. Ullman
%T The generation of optimal code for arithmetic expressions
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 715-728
%K theory of computation

%A D. Tsichritzis
%T The equivalence problem of simple programs
%J Journal of the ACM
%K jacm
%V 17
%N 4
%D October 1970
%P 729-738
%K theory of computation

%A G. Salton
%T Some thoughs on scientific information dissemination
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 1-3
%K editorial

%A Stephen A. Cook
%T Characterizations of pushdown machines in terms of time-bounded computers
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 4-18
%K automata theory

%A William H. Kautz
%T An augmented content-addressed memory array
for implementation with large-scale integration
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 19-33
%K computer organization

%A Brian W. Kernighan
%T Optimal sequential partitions of graphs
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 34-40
%K graph theory

%A Nabih N. Abdelmalek
%T Linear L1 approximation for a discrete point set
and L1 solutions of overdetermined linear equations
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 41-47
%K numerical mathematics

%A N.F. Benschop
%A H.C. Ratz
%T A mean square estimate of the generated round off error
in constant matrix interative processes
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 48-62
%K numerical mathematics

%A Colin W. Cryer
%T Topological problems arising when solving boundary value problems
for elliptic partial differential equations by the method of finite difference
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 63-72
%K numerical mathematics

%A C. Dill
%A C.W. Gear
%T A graphical search for stiffly stable methods
for ordinary differential equation
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 73-79
%K numerical mathematics

%A Alfred V. Aho
%A Peter J. Denning
%A Jeffrey D. Ullman
%T Principles of optimal page replacement
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 80-93
%K operating systems

%A G.<C. Philippatos
%A D.R. Moscato
%T Effects of constrained information on player decisions
in experimental business simulation
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 94-104
%K operations research

%A J.C. Alexander
%A A.I. Thaler
%T The boundary count of digital pictures
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 105-112
%K picture processing

%A Manfred H. Hueckel
%T An operator which locates edges in digitized pictures
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 113-125
%K picture processing

%A C.L. Chang
%A J.R. Slagle
%T Completeness of linear refutation for theories with equality
%J Journal of the ACM
%K jacm
%V 18
%N 1
%D January 1971
%P 126-136
%K theorem proving

%A J.H. Wilkinson
%T Some comments from a numerical analyst
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 137-147
%K Turing award lectureo

%A Michael A. Harrison
%A Mario Schkolnick
%T A grammatical characterization of one-way nondeterministic stack languages
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 148-172
%K automata theory and formal languages

%A William Goffman
%T A mathematical method for analyzing the growth of a scientific discipline
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 173-185
%K information science

%A Donald P. Gaver,\ Jr.
%A Peter A.W. Lewis
%T Probability models for buffer storage allocation problems
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 186-198
%K operating systems

%A P.A.W. Lewis
%A G.S. Shedler
%T A cyclic-queue model of system overhead in multiprogrammed computer systems
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 199-220
%K operating systems

%A U. Narayan Bhat
%A Richard E. Nance
%T Busy period analysis of a time-sharing system
modeled as a semi-Markov process
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 221-238
%K operating systems

%A J.P. Mylopoulos
%A T. Pavlidis
%T On the topological properties of quantized spaces.
I. The notion of dimension
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 239-246
%K pattern recognition

%A J.P. Mylopoulos
%A T. Pavlidis
%T On the topological properties of quantized spaces.
II. Connectivity and ordr of connectivity
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 247-254
%K pattern recognition

%A R. Stefanelli
%A A. Rosenfeld
%T Some parallel thinning algorithms for digital pictures
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 255-264
%K pattern recognition

%A Robert O. Winder
%T Chow parameters in threshold logic
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 265-289
%K switching theory

%A Manuel Blum
%T On effective procedures for speeding up algorithms
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 290-305
%K theory of computation

%A Stephen N. Cole
%T Deterministic pushdown store machines and real-time computation
%J Journal of the ACM
%K jacm
%V 18
%N 2
%D April 1971
%P 306-327
%K theory of computation

%A John Case
%T A note on degrees of self-describing Turing machines
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 329-338
%K automata theory

%A Alvy Ray Smith,\ III
%T Simple computation-universal cellular spaces
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 339-353
%K automata theory

%A Richard Simon
%A Richard C.T. Lee
%T On the optimal solutions to AND/OR series-parallel graphs
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 354-372
%K graph theory

%A M.S. Mock
%T Numerical analysis of a nonlinear diffusion problem
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 373-380
%K numerical mathematics

%A J.P.R. Tootill
%A W.D. Robinson
%A A.G. Adams
%T The runs up-and-down performance
of Tausworthe pseudo-random number generators
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 381-399
%K numerical mathematics

%A William H. Burge
%A Alan G. Konheim
%T An accessing model
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 400-404
%K operating systems

%A Donald P. Gaver
%T Analysis of remote terminal backlogs under heavy demand conditions
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 405-415
%K operating systems

%A J.M. Robson
%T An estimate of the store size necessary for dynamic storage allocation
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 416-423
%K operating systems

%A John Lions
%T Some results concerning the reduction of binary matrices
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 424-430
%K operations research

%A Roandl C. de\ Vries
%T Minimal sets of distinct literals for a logically passive functions
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 431-443
%K switching theory

%A J. Hartmanis
%A J.E. Hopcroft
%T An overview of the theory of computational complexity
%J Journal of the ACM
%K jacm
%V 18
%N 3
%D July 1971
%P 444-475
%K theory of computation

%A W.S. Brown
%T On Euclid's algorithm
and the computation of polynomial greatest common divisors
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 478-504
%K SYMSAM conference

%A W.S. Brown
%A J.F. Traub
%T On Euclid's algorithm and the theory of subresultants
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 505-514
%K SYMSAM conference

%A George E. Collins
%T The calculation of multivariate polynomial resultants
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 515-532
%K SYMSAM conference

%A Lee E. Heindel
%T Integer arithmetic algorithms for polynomial real zero determination
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 533-548
%K SYMSAM conference

%A William A. Martin
%T Determining the equivalence of algebraic expressions by hash coding
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 549-558
%K SYMSAM conference

%A S.C. Johnson
%T On the problem of recognizing zero
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 559-565
%K SYMSAM conference

%A James R. Bunch
%T Equilibration of symmetric matrices in the max-norm
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 566-572
%K SYMSAM conference

%A Donald J. Rose
%T A note on consistent ordering and zero circulation
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 573-575
%K matrix algebra

%A M.A. Kaplan
%A R.A. Papetti
%T A note on quadrilateral interpolation
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 576-585
%K matrix algebra

%A C.S. Smith
%T Multiplicative pseudo-random number generators with rpime modulus
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 586-593
%K numerical mathematics

%A E. Wasserstrom
%T Solving boundary-value problems by imbedding
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 594-602
%K numerical mathematics

%A Igal Adiri
%T A dynamic time-sharing priority queue
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 603-610
%K numerical mathematics

%A Igal Adiri
%T A note on some mathematical models of time-sharing systems
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 611-615
%K operating systems

%A K.B. Irani
%A V.L. Wallace
%T On network linguistics and the conversational design of queueing networks
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 616-629
%K system design

%A Raymond Reiter
%T Two results on ordering for resolution with merging and linear format
%J Journal of the ACM
%K jacm
%V 18
%N 4
%D October 1971
%P 630-646
%K theorem proving

%A G. Salton
%T What is computer science ?
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 1-2
%K editorial

%A A.C. Fleck
%A S.T. Hedetniemi
%A R.H. Oehmke
%T S-semigroups of automata
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 3-10
%K automata theory

%A T. Pavlidis
%T Linear and context-free graph grammars
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 11-22
%K automata theory

%A C.P. Earnest
%A K.G. Balke
%A J. Anderson
%T Analysis of graphs by ordering of nodes
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 23-42
%K graph theory

%A Herbert Weinblatt
%T A new search algorithm for finding
the simple cycles of a finite directed graph
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 43-56
%K graph theory

%A Y.E. Chen
%A D.L. Epley
%T Memory requirements in a multiprocessing environment
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 57-69
%K operating systems

%A Harry C. Heacox,\ Jr.
%A Paul W. Purdom,\ Jr.
%T Analysis of two time-sharing queueing models
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 70-91
%K operating systems

%A Alan G. Konheim
%A Bernd Meister
%T Service in a loop system
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 92-108
%K operating systems

%A Richard C.T. Lee
%T Fuzzy logic and the resolution principle
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 109-119
%K theorem proving

%A James R. Slagle
%T Automatic theorem proving with built-in theories
including equality, partial ordering, and sets
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 120-135
%K theorem proving

%A Andrzej Blikle
%T Addressless units for carrying out loop-free computations
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 136-157
%K theory of computation

%A A. Borodin
%T Computational complexity and the existence of complexity gaps
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 158-174
%K theory of computation

%A Robert L. Constable
%T The operator gap
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 175-183
%K theory of computation

%A Norman Zadeh
%T Theoretical efficiency of the Edmonds-Karp algorithm
for computing maximal flows
%J Journal of the ACM
%K jacm
%V 19
%N 1
%D January 1972
%P 184-192
%K theory of computation

%A Sheila Greibach
%A Seymour Ginsburg
%T Multitape AFA
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 193-221
%K formal languages

%A Eugene S. Santos
%T A note on bracketed grammars
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 222-224
%K formal languages

%A A.V. Aho
%A P.J. Denning
%A J.D. Ullman
%T Weak and mixed strategy precedence parsing
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 225-243
%K formal languages

%A Gordon D. Mulligan
%A D.G. Corneil
%T Corrections to Bierstone's algorithm for generating cliques
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 244-247
%K graph theory

%A Jack Edmonds
%A Richard M. Karp
%T Theoretical improvements in algorithmic efficiency
for network flow problems
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 248-264
%K operations research

%A Peter L. Hammer
%A Uri N. Peled
%T On the maximization of a pseudo-boolean function
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 265-282
%K operations research

%A Stanley M. Selkow
%T One-pass complexity of digital picture properties
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 283-295
%K picture processing

%A L.H. Landweber
%A E.L. Robertson
%T Recursive properties of abstract complexity classes
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 296-308
%K theory of computation

%A Arnold L. Rosenberg
%T Addressable data graphs
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 309-340
%K theory of computation

%A Robert Tarjan
%T Sorting using networks of queues and stacks
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 341-346
%K theory of computation

%A S.C. van\ Westrhenen
%T Statistical studies of theoremhood
in classical propositional and first-order predicate calculus
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 347-365
%K theorem proving

%A D.W. Loveland
%T A unifying view of some linear Herbrand procedures
%J Journal of the ACM
%K jacm
%V 19
%N 2
%D April 1972
%P 366-384
%K theorem proving

%A J. McAfee
%A L. Presser
%T An algorithm for the design of simple precedence grammars
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 385-395
%K formal languages

%A Clarence A. Ellis
%T The halting problem for probabilistic context-free generators
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 396-399
%K formal languages

%A S. Even
%A A. Pnueli
%A A. Lempel
%T Permutation graphs and transitive graphs
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 400-410
%K graph theory

%A John L. Pfaltz
%T Graph structures
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 411-422
%K graph theory

%A Jin Y. Yen
%T Finding the lengths of all shortest paths
in N-node nonnegative-distance complete networks
using 1/2N^3 additions and N^3 comparisons
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 423-424
%K graph theory

%A L.E. Stanfel
%T Practical aspects of doubly chained trees for retrieval
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 425-436
%K information retrieval

%A Nancy M. Huang
%A Randall E. Cline
%T Inversion of persymmetric matrices having Toeplitz inverses
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 437-444
%K linear algebra

%A I. Mitrani
%T Nonpriority multiprogramming systems under heavy demand conditions
- customer's viewpoint
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 445-452
%K operating systems

%A Richard E. Nance
%A U. Narayan Bhat
%A Billy G. Claybrook
%T Busy period analysis of a time-sharing system: transform inversion
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 453-463
%K operating systems

%A L. Kleinrock
%A R.R. Muntz
%T Processor sharing queueing models of mixed scheduling disciplines
for time shared systems
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 464-482
%K operating systems

%A Gary D. Schultz
%T A stochastic model for message assembly buffering
with a comparison of block assignment strategies
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 483-495
%K operating systems

%A James R. Slagle
%T An approach for finding C-linear complete inference systems
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 496-516
%K theory of programming

%A J. Bruno
%A K. Steiglitz
%T The expression of algorithms by charts
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 517-525
%K theory of computation

%A Robert L. Constable
%A Allan B. Borodin
%T Subrecursive programming languages, part I:
efficiency and program structure
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 526-568
%K theory of computation

%A J.D. Ullman
%T A note on the efficiency of hashing functions
%J Journal of the ACM
%K jacm
%V 19
%N 3
%D July 1972
%P 569-575
%K theory of computation

%A Robert E. Beck
%A Bernard Kolman
%T Computer approaches to the representation of Lie algebras
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 577-589
%K algebra

%A Patrick C. Fischer
%A Albert R. Meyer
%A Arnold L. Rosenberg
%T Real-time simulation of multihead tape units
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 590-607
%K automata theory

%A Oscar H. Ibarra
%T A note concerning nondeterministic tape complexities
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 608-612
%K automata theory

%A James C. Beatty
%T An axiomatic approach to code optimization for expressions
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 613-640
%K complexity of computation

%A W.D. Frazer
%A B.T. Benneti
%T Bounds on optimal merge performance, and a strategy for optimality
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 641-648
%K complexity of computation

%A Edward M. Reingold
%T On the optimality of some set algorithms
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 649-659
%K complexity of computation

%A J.E. Savage
%T Computational work and time on finite machines
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 660-674
%K complexity of computation

%A James N. Gray
%A Michael A. Harrison
%T On the covering and reduction problems for context-free grammars
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 675-698
%K formal languages

%A Shi-Kuo Chang
%T The generation of minimal trees with a Steiner topology
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 699-711
%K graph theory

%A V. Srinivasan
%A G.L. Thompson
%T Accelerated algorithms for labeling and relabeling of trees,
with applications to distribution problems
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 712-726
%K graph theory

%A Carl M. Harris
%A Paul G. Marlin
%T A note on feedback queues with bulk service
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 727-733
%K operating systems

%A A.J. Bayes
%T A minimum variance sampling technique for simulation models
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 734-741
%K simulation

%A Bernard P. Zeigler
%T Toward a formal theory of modeling and simulation:
structure-preserving morphisms
%J Journal of the ACM
%K jacm
%V 19
%N 4
%D October 1972
%P 742-764
%K simulation

%A I. Nievergelt
%A C.K. Wong
%T Upper bounds for the total path length of binary trees
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 1-6
%K graph theory

%A Harry M. Sloate
%A Theodore A. Bickart
%T A-stable composite multistep methods
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 7-26
%K numerical analysis

%A Harold S. Stone
%T An efficient parallel algorithm
for the solution of a tridiagonal linear system of equations
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 27-38
%K numerical analysis

%A G.J. Burnett
%A E.G. Coffman,\ Jr.
%T A combinatorial problem related to interleaved memory systems
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 39-45
%K operating systems

%A C.L. Liu
%A James W. Layland
%T Scheduling algorithms for multiprogramming
in a hard-real-time environment
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 46-61
%K operating systems

%A Arnold K. Griffith
%T Mathematical models for automatic line detection
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 62-80
%K picture processing

%A Azriel osenfeld
%T Arcs and curves in digital pictures
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 81-87
%K picture processing

%A Donald L. Richards
%T Efficient exercising of switching elements in nets of identical gates
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 88-111
%K switching theory

%A Robert A. di\ Paola
%T The solvability of the decision problem
for classes of proper formulas and related results
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 112-126
%K theorem proving

%A John K. Dixon
%T Z-resolution: theorem-proving with compiled axioms
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 127-147
%K theorem proving

%A F.K. Hwang
%A D.N. Deutsch
%T A class of merging algorithm
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 148-159
%K theory of computation

%A Barry K. Rosen
%T Tree-manipulating systems and Church-Rosser theorems
%J Journal of the ACM
%K jacm
%V 20
%N 1
%D January 1973
%P 160-187
%K theory of computation

%A James C. Beatty
%T An axiomatic approach to code optimization for expressions
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 188
%K complexity of computation

%A Harvey M. Salkin
%A Ronald D. Koncal
%T Set covering by an all integer algorithm: computational experience
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 189-193
%K combinatorics

%A V. Srinivasan
%A G.L. Thompson
%T Benefit-cost analysis of coding techniques
for the primal transportation algorithm
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 194-213
%K combinatorics

%A James N. Gray
%A Michael A. Harrison
%T Canonical precedence schemes
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 214-234
%K formal languages

%A David Bruce Lomet
%T A formalization of transition diagram systems
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 235-257
%K formal languages

%A G. Salton
%T Recent studies in automatic text analysis and document retrieval
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 258-278
%K information retrieval

%A John F. Dalphin
%A Victor Lovass-Nagy
%T Best least squares solutions to finite difference equations
using the generalized inverse and tensor product methods
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 279-289
%K mathematics of computation

%A Armin Friedli
%T Optimal covering algorithms in methods of search
for solving polynomial equations
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 290-300
%K mathematics of computation

%A A.J. Goldstein
%A P.L. Richman
%T A midpoint phenomenon
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 301-304
%K mathematics of computation

%A Jacques Morgenstern
%T Note on the lower bound of the linear complexity
of the Fast Fourier Transform
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 305-306
%K mathematics of computation

%A S.R. Arora
%A A. Gallo
%T Optimization of static loading and sizing
of multilevel memory systems
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 307-319
%K operating systems

%A Donald L. Richards
%T Efficient exercising of switching elements in combinational nets
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 320-332
%K switching theory

%A Tomasz Pietrzykowski
%T A complete mechanization of second-order type theory
%J Journal of the ACM
%K jacm
%V 20
%N 2
%D April 1973
%P 333-364
%K theorem proving

%A A.T. Bertziss
%T A backtrack procedure for isomorphism of directed graphs
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 365-377
%K graph theory

%A Christopher D. Green
%T A path entropy function for rooted trees
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 378-384
%K graph theory

%A Donald B. Johnson
%T A note on Dijkstra's shortest path algorithm
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 385-388
%K graph theory

%A T.A. Williams
%A G.P. White
%T A note on Yen's algorithm for finding the length
of all shortest paths in N-node nonnegative-distance networks
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 389-390
%K graph theory

%A T. Kaneko
%A B. Liu
%T On local roundoff errors in floating-point arithmetic
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 391-398
%K mathematics of computation

%A Webb Miller
%T Toward abstract numerical analysis
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 399-408
%K mathematics of computation

%A G.A. Watson
%T An algorithm for the inversion of block matrices of Toeplitz form
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 409-415
%K mathematics of computation

%A Igal Adiri
%T Cyclic queues with bulk arrivals
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 416-428
%K operating systems

%A David D. Grossman
%A Harvey F. Silverman
%T Placement of records on a secondary storage device
to minimize access time
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 429-438
%K operating systems

%A G. Tourlakis
%A J. Mylopoulos
%T Some results in computational topology
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 439-455
%K picture processing

%A T.G. Lewis
%A W.H. Payne
%T Generalized feedback shift register pseudorandom number algorithm
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 456-468
%K random number generation

%A J.P.R. Tootill
%A W.D. Robinson
%A D.J. Eagle
%T An asymptotically random Tausworthe sequence
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 469-481
%K random number generation

%A R.B. Worrell
%A B.L. Hulme
%T Efficient ordering of set expressions for symbolic expansion
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 482-488
%K symbolic manipulation

%A E. Ashcroft
%A Z. Manna
%A A. Pnueli
%T Decidable properties of monodic functional schemas
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 489-499
%K theory of computation

%A Gideon Ehrlich
%T Loopless algorithms for generating permutations, combinations,
and other combinatorial configurations
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 500-513
%K theory of computation

%A R.M. Keller
%T Parallel program schemata and maximal parallelism I:
fundamental results
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 514-528
%K theory of computation

%A M.A. Jenkins
%T Bernouil's method with implicit shifting
%J Journal of the ACM
%K jacm
%V 20
%N 3
%D July 1973
%P 529-537
%K mathematics of computation

%A Fred T. Krogh
%T On testing a subroutine for the numerical integration
of ordinary differential equations
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 545-562
%K mathematics of computation

%A Michael T. McClellan
%T The exact solution of systems of linear equations
with polynomial coefficients
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 563-588
%K mathematics of computation

%A I. Adiri
%A M. Hofri
%A M. Yadin
%T A multiprogramming queue
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 589-603
%K operating systems

%A C.C. Gotlieb
%A G.H. Macewen
%T Performance of movable-head disk storage devices
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 604-623
%K operating systems

%A P.C. Yue
%A C.K. Wong
%T On the optimality of the probability ranking scheme
in storage applications
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 624-633
%K operating systems

%A Manfred H. Hueckel
%T A local visual operator which recognizes edges and lines
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 634-647
%K picture processing

%A Rona B. Stillman
%T The concept of weak substitution in theorem proving
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 648-667
%K theorem proving

%A Leonard Bass
%A Paul Young
%T Ordinal hierarchies and naming complexity classes
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 668-686
%K theory of computation

%A Robert P. Daley
%T An example of information and computation resource tradeoff
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 687-695
%K theory of computation

%A R.M. Keller
%T Parallel program schemata and maximal parallelism II:
construction of closures
%J Journal of the ACM
%K jacm
%V 20
%N 4
%D October 1973
%P 696-710
%K theory of computation

%A David G. Herr
%T On a statistical model of Strand and Westwater
for the numerical solution of a Fredholm integral equation
of the first kind
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 1-5
%K mathematics of computation

%A Nai-Kuan Tsao
%T Some a posteriori error bounds in floating-point computations
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 6-17
%K mathematics of computation

%A L.W. Cotten
%A A.M. Abd-alla
%T Processing times for segmented jobs with I/O compute overlap
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 18-30
%K operating systems

%A P.A. Franaszek
%A T.J. Wagner
%T Some distribution-free aspects of paging algorithm performance
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 31-39
%K operating systems

%A Giorgio Ingargiola
%A James F. Korsh
%T Finding optimal demand paging algorithms
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 40-53
%K operating systems

%A Debasis Mitra
%T Some aspects of hierarchical memory systems
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 54-65
%K operating systems

%A Kenneth C. Sevcik
%T Scheduling for minimum total loss using service time distribution
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 66-75
%K operating systems

%A Christopher Earnest
%T Some topics in code optimization
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 76-102
%K programming languages

%A Michael A. Crane
%A Donald I. Iglehart
%T Simulating stable stochastic systems I:
general multiserver queues
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 103-113
%K simulation

%A Michael A. Crane
%A Donald I. Iglehart
%T Simulating stable stochastic systems I:
Markov chains
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 114-123
%K simulation

%A S. Fleisig
%A D. Loveland
%A A.K. Smiley,\ III
%A D.L. Yarmush
%T An implementation of the model elimination proof procedure
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 124-139
%K theorem proving

%A Walter M. Kohler
%A Kenneth Steiglitz
%T Characterization and theoretical comparison
of branch-and-bound algorithms for permutation problems
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 140-156
%K theory of computation

%A P.S. Kritzinger
%A J.W. Graham
%T A theorem in the theory of compromise merge methods
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 157-160
%K theory of computation

%A Mary Shaw
%A J.F. Traub
%T On the number of multiplications for the evaluation of a polynomial
and some of its derivatives
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 161-167
%K theory of computation

%A Robert A. Wagner
%A Michael J. Fisher
%T The string-to-string correction problem
%J Journal of the ACM
%K jacm
%V 21
%N 1
%D January 1974
%P 168-173
%K theory of computation

%A D. Michie
%A E.E. Sibert
%T Some binary derivation systems
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 175-190
%K artificial intelligence

%A Ross A. Overbeek
%T A new class of automated theorem-proving algorithms
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 191-200
%K artificial intelligence

%A Richard P. Brent
%T The parallel evaluation of general arithmetic expressions
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 201-206
%K complexity of computation

%A David Pager
%T Further results on the problem of finding minimal length programs
for decision tables
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 207-212
%K complexity of computation

%A Armen Gabriellan
%A Seymour Ginsburg
%T Grammar schemata
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 213-226
%K formal languages

%A G. Berman
%A A.W. Colijn
%T A modified list technique allowing binary search
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 227-232
%K information retrieval

%A R.T. Chien
%A E.A. Mark
%T A document storage method based on polarized distance
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 233-245
%K information retrieval

%A Peter Elias
%T Efficient storage and retrieval
by content and address of static files
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 246-260
%K information retrieval

%A M.M. Blevins
%A G.W. Stewart
%T Calculating the eigenvectors of diagonally dominant matrices
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 261-271
%K linear algebra

%A Shalhav Zohar
%T The solution of a Toeplitz set of linear equations
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 272-276
%K linear algebra

%A Ellis Horowitz
%A Sartaj Sahni
%T Computing partitions with applications to the knapsack problem
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 277-292
%K mathematics of computation

%A William J. Gordon
%A Richard F. Riesenfield
%T Bernstein-Bezier methods for the computer-aided design
of free-form curves and surfaces
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 293-310
%K mathematics of computation

%A Chrales B. Dunham
%T Efficiency of Chebyshev approximation on finite subsets
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 311-313
%K mathematics of computation

%A E. Balkovich
%A W. Chiu
%A L. Presser
%A R. Wood
%T Comments on a paper by Gaver
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 314-315
%K operating systems

%A Hisashi Kobayashi
%T Application of the diffusion approximation to queueing networks I:
equilibrium queue distributions
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 316-328
%K operating systems

%A J.A. Michel
%A E.G. Coffman,\ Jr.
%T Synthesis of a feedback queueing discipline for computer operation
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 329-339
%K operating systems

%A Steven Katz
%A Alan G. Konheim
%T Priority disciplines in a loop system
%J Journal of the ACM
%K jacm
%V 21
%N 2
%D April 1974
%P 340-349
%K operating systems

%A Ramachendra P. Batni
%A Jeffrey D. Russell
%A Charles R. Kime
%T An efficient algorithm for finding an irredundant set cover
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 351-355
%K combinatorics and graph theory

%A Roberty M. Haralick
%T A diclique representation and decomposition of binary relations
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 356-366
%K combinatorics and graph theory

%A M.S. Hecht
%A J.D. Ullman
%T Characterizations of reducible flow graphs
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 367-375
%K combinatorics and graph theory

%A E.M. Palmer
%A M.A. Rahimi
%A R.W. Robinson
%T Efficiency of binary comparison storage technique
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 376-384
%K combinatorics and graph theory

%A Chung C. Wang
%T An algorithm for the chromatic number of a graph
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 385-391
%K combinatorics and graph theory

%A C.K. Wong
%A Don Coppersmith
%T A combinatorial problem related to multimodule memory organizations
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 392-402
%K combinatorics and graph theory

%A Gregory J. Chaitin
%T Information-theoretic limitations of formal systems
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 403-424
%K complexity of computation

%A John Gill
%A Manuel Blum
%T On almost everywhere complex recursive functions
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 425-435
%K complexity of computation

%A L.K. Schubert
%T Iterated limiting recursion and the program minimization problem
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 436-445
%K complexity of computation

%A Thomas N. Hibbard
%T Context-limited grammars
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 446-453
%K formal languages

%A Paul J. Richman
%T Computing a subinterval of the image
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 454-458
%K mathematics of computation

%A Hisashi Kobayashi
%T Application of the diffusion approximation to queueing networks II:
nonequilibrium distributions and applications to computer modeling
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 459-469
%K operating systems

%A Alan G. Konheim
%A Bernd Meister
%T Waiting lines and times in a system with polling
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 470-490
%K operating systems

%A J.M. Robson
%T Bounds for some functions concerning dynamic storage allocation
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 491-499
%K operating systems

%A Mandell Bellmore
%A Saman Hong
%T Transformation of multisalesmen problem
to the standard traveling salesman problem
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 500-504
%K operations research

%A L.E. Trotter,\ Jr.
%A C.M. Shetty
%T An algorithm for the bounded variable integer programming problem
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 505-513
%K operations research

%A T.I. Fenner
%A G. Loizou
%T Some new bounds on the condition numbers of optimally scaled matrices
%J Journal of the ACM
%K jacm
%V 21
%N 3
%D July 1974
%P 514-524
%K linear algebra

%A Michael A. harrison
%A Ivan M. Havel
%T On the parsing of deterministic languages
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 525-548
%K formal languages

%A John Hopcroft
%A Robert Tarjan
%T Efficient planarity testing
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 549-568
%K combinatorics and graph theory

%A Phillippe G.H. Lehot
%T An optimal algorithm to detect a line graph and output its root graph
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 569-575
%K combinatorics and graph theory

%A Frank Rubin
%T A search procedure for Hamilton paths and circuits
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 576-580
%K combinatorics and graph theory

%A Robert J. Plemmons
%T Linear least squares by elimination and MGS
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 581-585
%K mathematics of computation

%A Paul S. Wang
%T The undecidability of the existence of zeros
of real elementary functions
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 586-589
%K mathematics of computation

%A L. Henschen
%A L. Wos
%T Unit refutations and Horn sets
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 590-605
%K theorem proving

%A Arthur J. Nevins
%T A human oriented logic for automatic theorem-proving
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 606-621
%K theorem proving

%A James R. Slagle
%T Automated theorem-proving for theories
with simplifiers, commutativity, and associativity
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 622-642
%K theorem proving

%A H.T. Kung
%A J.F. Traub
%T Optimal order of one-point and multipoint iteration
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 643-651
%K theory of computation

%A Arnold L. Rosenberg
%T Allocating storage for extendible arrays
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 652-670
%K theory of computation

%A Ravi Sethi
%T Testing for the Church-Rosser property
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 671-679
%K theory of computation

%A Anthony S. Wojcik
%A Gernot Metze
%T An analysis of some relationships between Post and Boolean algebras
%J Journal of the ACM
%K jacm
%V 21
%N 4
%D October 1974
%P 680-696
%K theory of computation

%A Leslie G. Valiant
%T Regularity and related problems for deterministic pushdown automata
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 1-10
%K automata theory

%A Harry T. Tsu
%T An algorithm for finding a minimal equivalent graph of a digraph
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 11-16
%K graph theory

%A Clement T. Yu
%T A formal construction of term classes
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 17-37
%K information retrieval

%A E. Horowitz
%A S. Sahni
%T On computing the exact determinant
of matrices with polynomial entries
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 38-50
%K mathematics of computation

%A C.A. Micchelli
%A W.L. Miranker
%T High order search methods for finding roots
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 51-60
%K mathematics of computation

%A John R. Rice
%T A metalgorithm for adaptive quadrature
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 61-82
%K mathematics of computation

%A Samuel H. Fuller
%A Forest Baskett
%T An analysis of drum storage units
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 83-105
%K operating systems

%A Walter H. Kohler
%A Kenneth Steiglitz
%T Exact, approximate and guaranteed accuracy algorithms
for the flow-shop problem n/2/F/$F bar$
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 106-114
%K operations research

%A Sartaj Sahni
%T Approximate algorithms for the 0/1 knapsack problem
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 115-124
%K operations research

%A J.W. Wright
%T The change-making problem
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 125-128
%K operations research

%A Robert S. Boyer
%A J. Strother Moore
%T Proving theorems about Lisp functions
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 129-144
%K program verification

%A Lawrence Yelowitz
%T Derivation of a path-connectivity matrix for tagged flowcharts
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 145-154
%K program verification

%A Richard E. Ladner
%T On the structure of polynomial time reducibility
%J Journal of the ACM
%K jacm
%V 22
%N 1
%D January 1975
%P 155-171
%K theory of computation

%A Roy Lowrance
%A Robert A. Wagner
%T An extension of the string-to-string correction problem
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 177-183
%K complexity of computation

%A Jacques Morgenstern
%T The linear complexity of computation
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 184-194
%K complexity of computation

%A David E. Muller
%A Franco P. Preparata
%T Bounds to complexities of networks for sorting and for switching
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 195-201
%K complexity of computation

%A Y. Perl
%A M.R. Garey
%A S. Even
%T Efficient generation of optimal prefix code:
equiprobable words using unequal cost letters
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 202-214
%K complexity of computation

%A Robert Endre Tarjan
%T Efficiency of a good but not linear set union algorithm
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 215-225
%K complexity of computation

%A Bernd Knauer
%T A simple planarity criterion
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 226-230
%K graph theory

%A Jair M. Babad
%T A generalized multi-entrance time-sharing priority queue
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 231-247
%K operating systems

%A Forest Baskett
%A K. Mani Chandy
%A Richard R. Muntz
%A Fernando G. Palacios
%T Open, closed, and mixed networks of queues
with different classes of customers
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 248-260
%K operating systems

%A Erol Gelenbe
%T On approximate computer system models
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 261-269
%K operating systems

%A Micha Hofri
%A Micha Yadin
%T A processor in series with demand-interrupting devices
- a stochastic model
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 270-290
%K operating systems

%A David R. Musser
%T Multivariate polynomial factorization
%J Journal of the ACM
%K jacm
%V 22
%N 2
%D April 1975
%P 291-308
%K symbolic manipulation

%A Roger C. Schank
%A Neil M. Goldman
%A Charles J. Rieger,\ III
%A Christopher K. Riesbeck
%T Inference and paraphrase by computer
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 309-328
%K artificial intelligence

%A Gregory J. Chaitin
%T A theory of program size formally identical to information theory
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 329-340
%K complexity of computation

%A Nancy Lynch
%T On reducibility to complex or sparse sets
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 341-345
%K complexity of computation

%A Glenn Manacher
%T A new linear-time "on-line" algorithm
for finding the smallest initial palindrome of a string
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 346-351
%K complexity of computation

%A S.E. Goodman
%A S.T. Hedetniemi
%A P.J. Slater
%T Advances on the Hamiltonian completion problem
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 352-360
%K graph theory

%A John L. Pfaltz
%T Representing graphs by Knuth trees
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 361-366
%K graph theory

%A Peter Elias
%A Richard A. Flower
%T The complexity of some simple retrieval problems
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 367-379
%K information retrieval

%A Robert E. Dressler
%A Thomas Parker
%T Primes with a prime subscript
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 380-381
%K mathematics of computation

%A J.L. Bruno
%A T. Lassagne
%T The generation of optimal code for stack machines
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 382-396
%K operating systems

%A Walter C. Oney
%T Queueing analysis of the scan policy for moving-head disks
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 397-412
%K operations research

%A G. Terry Ross
%A D. Klingman
%A A. Napier
%T A computational study of the effects of problem dimensions
on solution times for transformation problems
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 413-424
%K operations research

%A Antonin Svoboda
%T The concept of term exclusiveness
and its effect of the theory of boolean functions
%J Journal of the ACM
%K jacm
%V 22
%N 3
%D July 1975
%P 425-440
%K switching theory

%A M.C. Easton
%A C.K. Wong
%T The effect of a capacity constraint
on the minimal cost of a partition
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 441-449
%K complexity of computation

%A Ellis Horowitz
%T A sorting algorithm for polynomial multiplication
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 450-462
%K complexity of computation

%A Oscar H. Ibarra
%A Chul E. Kim
%T Fast approximation algorithms
for the knapsack and sum of subset problems
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 463-468
%K complexity of computation

%A H.T. Kung
%A F. Luccio
%A P. Preparata
%T On finding the maxima of a set of vectors
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 469-476
%K complexity of computation

%A S. Winograd
%T On the parallel evaluation of certain arithmetic expressions
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 477-492
%K complexity of computation

%A Eberhard Bertsch
%T An observation on relative parsing time
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 493-498
%K formal languages

%A I.H. Sudborough
%T A note on tape-bounded complexity classes
and linear context-free languages
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 499-500
%K formal languages

%A Bal Kishan Das
%T A sufficient bound for codes correcting bursts with weight constraint
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 501-503
%K information theory

%A J.R. Cash
%T A class of implicit Runge-Kutta methods for the numerical integration
of stiff ordinary differential equations
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 504-511
%K mathematics of computation

%A Webb Miller
%T Computer search for numerical instability
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 512-521
%K mathematics of computation

%A K.L. Krause
%A V.Y. Shen
%A H.D. Schwetman
%T Analysis of several task-scheduling algorithms
for a model of multiprogramming computer systems
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 522-550
%K operating systems

%A John P. Hayes
%T The fanout structure of switching functions
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 551-571
%K switching theory

%A Robert Kowalski
%T A proof procedure using connection graphs
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 572-595
%K theorem proving

%A J. Robert Jump
%A P.S. Thiagarajan
%T On the interconnection of asynchronous control structures
%J Journal of the ACM
%K jacm
%V 22
%N 4
%D October 1975
%P 596-612
%K theory of computation

%A A.V. Aho
%A D.S. Hirschberg
%A J.D. Ullman
%T Bounds on the complexity of the longest common subsequence problem
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 1-12
%K complexity of computation

%A C.K. Wong
%A Ashok K. Chandra
%T Bounds for the string editing problem
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 13-16
%K complexity of computation

%A M. Dennis Mickunas
%T On the complete covering problem for LR(k) grammars
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 17-30
%K formal languages

%A J.R. Ullman
%T An algorithm for subgraph isomorphism
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 31-42
%K graph theory

%A M.R. Garey
%A D.S. Johnson
%T The complexity of near-optimal graph coloring
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 43-49
%K graph theory

%A Robert A. Wagner
%T A shortest path algorithm for edge-sparse graphs
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 50-57
%K graph theory

%A Alberto Martelli
%T A Gaussian elimination algorithm
for the enumeration of cut sets in a graph
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 58-73
%K graph theory

%A Narsingh Deo
%T Note on Hopcroft and Tarjan's planarity algorithm
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 74-75
%K graph theory

%A C.T. Yu
%A G. Salton
%T Precision weighting - an effective automatic indexing method
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 76-88
%K information retrieval

%A Kenny S. Crump
%T Numerical inversion of Laplace transforms
using a Fourier series approximation
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 89-96
%K mathematics of computation

%A D. Potier
%A E. Gelenbe
%A J. Lenfant
%T Adaptive allocation of central processing unit quanta
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 97-102
%K operating systems

%A R.A. Cody
%A E.G. Coffman,\ Jr.
%T Record allocation for minimizing expected retrieval costs
on drum-like storage devices
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 103-115
%K operating systems

%A Sartaj K. Sahni
%T Algorithms for scheduling independent tasks
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 116-127
%K operating systems

%A Ronald Fagin
%A Malcolm C. Easton
%T The independence of miss ratio on page size
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 128-146
%K operating systems

%A D.S. Hirschberg
%A C.K. Wong
%T A polynomial-time algorithm
for the knapsack problem with two variables
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 147-154
%K operations research

%A Britton Harris
%T A code for the transportation problem of linear programming
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 155-157
%K operations research

%A John B. Kam
%A Jeffrey D. Ullman
%T Global data flow analysis and iterative algorithms
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 158-171
%K programming languages and methodology

%A Susan L. Graham
%A Mark Wegman
%T A fast and usually linear algorithm for global flow analysis
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 172-202
%K programming languages and methodology

%A Christoph M. Hoffmann
%A Lawrence H. Landweber
%T A completeness theorem
for straight-line programs with structured variables
%J Journal of the ACM
%K jacm
%V 23
%N 1
%D January 1976
%P 203-219
%K programming languages and methodology

%A Harold N. Gabow
%T An efficient implementation of Edmonds' algorithm
for maximum matching on graphs
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 221-234
%K combinatorics and graph theory

%A Richard G. Larson
%T Efficiency of computation of Cayley tables of 2-groups
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 235-241
%K combinatorics and graph theory

%A Richard P. Brent
%T Fast multiple-precision evaluation of elementary functions
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 242-251
%K complexity of computation

%A H.T. Kung
%T New algorithms and lower bounds for the parallel evaluation
of certain rational expressions and recurrences
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 252-261
%K complexity of computation

%A Edward M. McCreight
%T A space-economical suffix tree construction algorithm
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 262-272
%K information retrieval

%A C.T. Yu
%A W.S. Luk
%A T.Y. Cheung
%T A statistical model for relevance feedback in information retrieval
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 273-286
%K information retrieval

%A Alan Feldstein
%A Richard Goodman
%T Convergence estimates for the distribution of trailing digits
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 287-297
%K mathematics of computation

%A Donald Fraser
%T Array permutation by index-digit permutation
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 298-309
%K mathematics of computation

%A Marcello Pagano
%T On the linear convergence of a covariance factorization algorithm
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 310-316
%K mathematics of computation

%A Ellis Horowitz
%A Sartaj Sahni
%T Exact and approximate algorithms
for scheduling nonidentical processors
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 317-327
%K operating systems

%A Alan G. Konheim
%A Martin Reiser
%T A queueing model with finite waiting room and blocking
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 328-341
%K operating systems

%A Thomas G. Price
%T A note on the effect of the
central processor service time distribution on processor utilization
in multiprogrammed computer systems
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 342-346
%K operating systems

%A Donald L. Iglehart
%T Simulating stable stochastic systems, VI: quantile estimation
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 347-360
%K operations research

%A Kenneth Lloyd Rider
%T A simple approximation to the average queue size
in the time-dependent M/M/1 queue
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 361-367
%K operations research

%A Steven L. Horowitz
%A Theodosios Pavlidis
%T Picture segmentation by a tree traversal algorithm
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 368-388
%K picture processing

%A Ben Wegbreit
%A Jay M. Spitzen
%T Proving properties of complex data structures
%J Journal of the ACM
%K jacm
%V 23
%N 2
%D April 1976
%P 389-396
%K programming languages and methodology

%A William H. Joyner,\ Jr.
%T Resolution strategies as decision procedures
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 398-417
%K artificial intelligence

%A Lena Chang
%A James F. Korsh
%T Canonical coin changing and greedy solutions
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 418-422
%K combinatorics and graph theory

%A Nicholas Pippenger
%A Leslie G. Valiant
%T Shifting graphs and their applications
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 423-432
%K combinatorics and graph theory

%A Douglas C. Schmidt
%A Larry E. Druffel
%T A fast backtracking algorithm to test directed graphs
for isomorphism using distance matrices
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 433-445
%K combinatorics and graph theory

%A Peter J. Slater
%T R-domination in graphs
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 446-450
%K combinatorics and graph theory

%A William H. Burge
%T An analysis of binary search trees
formed from sequences of non-distinct keys
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 451-454
%K information retrieval

%A J.R. Cash
%T Semi-implicit Runge-Kutta procedures with error estimates
for the numerical integration of stiff systems
of ordinary differential equations
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 455-460
%K mathematics of computation

%A M.R. Garey
%A D.S. Johnson
%T Scheduling tasks with nonuniform deadlines on two processors
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 461-467
%K operations research

%A Ta Huu Phuong
%T Solution of integer programs with a quadratic objective function
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 468-474
%K operations research

%A V. Srinivasan
%T Linear programming computational procedures for ordinary regression
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 475-487
%K operations research

%A A.V. Aho
%A S.C. Johnson
%T Optimal code generation for expression trees
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 488-501
%K programming languages and compilers

%A John Bruno
^A Ravi Sethi
%T Code generation for a one-register machine
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 502-510
%K programming languages and compilers

%A M.D. Mickunas
%A R.L. Lancaster
%A V.B. Schnedier
%T Transforming LR(k) grammars
to LR(1), SLR(1), and (1,1) bounded right-context grammars
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 511-533
%K programming languages and compilers

%A David F. Muller
%A Franco P. Preparata
%T Restructuring of arithmetic expressions for parallel evaluation
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 534-543
%K programming languages and compilers

%A Christos H. Papadimitriou
%T On the complexity of edge traversing
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 544-554
%K theory of computation

%A Sartaj Sahni
%A Teofilo Gonzalez
%T P-complete approximation problems
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 555-565
%K theory of computation

%A Andrew Chi-Chih Yao
%A Foong Frances Yao
%T Lower bounds on merging networks
%J Journal of the ACM
%K jacm
%V 23
%N 3
%D July 1976
%P 566-571
%K theory of computation

%A G.E. Peterson
%T Theorem proving with lemmas
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 573-581
%K artificial intelligence

%A Seymour Ginsburg
%A Nancy Lynch
%T Size complexity in context-free grammar forms
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 582-598
%K formal languages

%A Yoram Yakimovsky
%T Boundary and object detection in real world images
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 599-618
%K image processing

%A Mark J. Eisner
%A Dennis G. Severance
%T Mathematical techniques for efficient record segmentation
in large shared databases
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 619-635
%K information retrieval

%A D.E. Heller
%A D.K. Stevenson
%A J.F. Traub
%T Accelerated iterative methods for the solution
of tridiagonal systems on parallel computers
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 636-654
%K numerical mathematics

%A John R. Bruno
%T Sequencing jobs with stochastic task structures on a single machine
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 655-664
%K operations research

%A Teofilo Gonzalez
%A Sartaj Sahni
%T Open shop scheduling to minimize finishing time
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 665-679
%K operations research

%A Z. Rosberg
%A I. Adiri
%T Multilevel queues with external priorities
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 680-690
%K operations research

%A Ben Wegbreit
%T Verifying program performance
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 691-699
%K programming methodology

%A John P. Hayes
%T Enumeration of fanout-free boolean functions
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 700-709
%K switching theory

%A S. Even
%A R.E. Tarjan
%T A combinatorial problem which is complete in polynomial space
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 710-719
%K theory of computation

%A R.J. Lipton
%A S.C. Eisenstat
%A R.A. DeMillo
%T Space and time hierarchies for classes
of control structures and data structures
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 720-732
%K theory of computation

%A M.H. van\ Emden
%A R.A. Kowalski
%T The semantics of predicate logic as a programming language
%J Journal of the ACM
%K jacm
%V 23
%N 4
%D October 1976
%P 733-742
%K theory of computation

%A Donald B. Johnson
%T Efficient algorithms for shortest paths in sparse networks
%J Journal of the ACM
%K jacm
%V 24
%N 1
%D January 1977
%P 1-13
%K combinatorics and graph theory

%A Neil C. Wilhelm
%T A general model for the performance of disk systems
%J Journal of the ACM
%K jacm
%V 24
%N 1
%D January 1977
%P 14-31
%K operating systems

%A Edward C. Horvath
%A Shui Lam
%A Ravi Sethi
%T A level algorithm for preemptive scheduling
%J Journal of the ACM
%K jacm
%V 24
%N 1
%D January 1977
%P 32-43
%K operations research

%A R.M. Burstall
%A John Darlington
%T A transformation system for developing recursive programs
%J Journal of the ACM
%K jacm
%V 24
%N 1
%D January 1977
%P 44-67
%K programming methodology

%A J.A. Goguen
%A J.W. Thatcher
%A E.G. Wagner
%A J.B. Wright
%T Initial algebra semantics and continuous algebras
%J Journal of the ACM
%K jacm
%V 24
%N 1
%D January 1977
%P 68-97
%K theory of computation

%A Brenda S. Baker
%T An algorithm for structuring flowgraphs
%J Journal of the ACM
%K jacm
%V 24
%N 1
%D January 1977
%P 98-120
%K programming languages

%A David B. Loveman
%T Program improvement by source-to-source transformation
%J Journal of the ACM
%K jacm
%V 24
%N 1
%D January 1977
%P 121-145
%K programming languages

%A A.V. Aho
%A S.C. Johnson
%A J.D. Ullman
%T Code generation for expressions with common subexpressions
%J Journal of the ACM
%K jacm
%V 24
%N 1
%D January 1977
%P 146-160
%K programming languages

%A Phillip D. Summers
%T A methodology for Lisp program construction from examples
%J Journal of the ACM
%K jacm
%V 24
%N 1
%D January 1977
%P 161-175
%K programming languages

%A Dennis de\ Champeux
%A Lenie Sint
%T An improved bidirectional heuristic search algorithm
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 177-191
%K artificial intelligence

%A F.T. Boesch
%A J.F. Gimpel
%T Covering the points of a digraph with point-disjoint paths
and its application to code optimization
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 192-198
%K combinatorics and graph theory

%A Arnold L. Rosenberg
%A Larry J. Stockmeyer
%T Hashing schemes for extendible arrays
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 199-221
%K information retrieval

%A Alexandre Brandwajn
%T A queueing model of multiprogrammed computer systems
under full load conditions
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 222-240
%K operating systems

%A Micha Hofri
%T On certain output-buffer management techniques - a stochastic model
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 241-249
%K operating systems

%A K. Mani Chandy
%A John H. Howard,\ Jr.
%A Donald . Towsley
%T Product form and local balance in queueing networks
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 250-263
%K operations research

%A Toshihide Ibaraki
%T The power of dominance relations in branch-and-bound algorithms
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 264-279
%K operations research

%A Oscar H. Ibarra
%A Chul E. Kim
%T Heuristic algorithms for scheduling independent tasks
on nonidentical processors
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 280-289
%K operations research

%A Eric C. Hehne
%T Information content of programs and operation encoding
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 290-297
%K programming methodology

%A Philip J. Davis
%T Proof, completeness, transcendentals, and sampling
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 298-310
%K theory of computation

%A C.M. Fiduccia
%A Y. Zalcstein
%T Algebras having linear multiplicative complexities
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 311-331
%K theory of computation

%A John Hopcroft
%A Wolfgang Paul
%A Leslie Valiant
%T On time versus space
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 332-337
%K theory of computation

%A Neil D. Jones
%A Steven S. Muchnick
%T Even simple programs are hard to analyze
%J Journal of the ACM
%K jacm
%V 24
%N 2
%D April 1977
%P 338-350
%K theory of computation

%A A. Michael Ballantine
%A W.W. Bledsoe
%T Automatic proofs of theorems in analysis using nonstandard techniques
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 353-374
%K artificial intelligence

%A Guy Farolle
%A Erol Gelenbe
%A Jacques Labetoulle
%T Stability and optimal control
of the packet switching broadcast channel
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 375-386
%K computer communications

%A Harry B. Hunt,\ III
%A Daniel J. Rosenkrantz
%T On equivalence and containment problems for formal languages
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 387-396
%K formal languages

%A R. Attar
%A S. Fraenkel
%T Local feedback in full-text retrieval systems
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 397-417
%K information retrieval

%A Abraham Bookstein
%A Don Kraft
%T Operations research applied
to document indexing and retrieval decisions
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 418-427
%K information retrieval

%A Douglas Comer
%A Ravi Sethi
%T The complexity of trie index construction
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 428-440
%K information retrieval

%A K. Hwang
%A S.B. Yao
%T Optimal batched searching of tree structured files
in multiprocessor computer systems
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 441-454
%K information retrieval

%A R.J. Lipton
%A L. Snyder
%T A linear time algorithm for deciding subject security
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 455-464
%K operating systems

%A Benjamin W.Y. Lin
%A Ronald L. rardin
%T Development of a parametric generating procedure
for integer programming test problems
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 465-472
%K operations research

%A Lawrence T. Kou
%T On live-dead analysis for global data flow problems
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 473-483
%K programming methodology

%A John C. Reynolds
%T Semantics of the domain of flow diagrams
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 484-503
%K programming methodology

%A Ben Wegbreit
%T Complexity of synthesizing inductive assertions
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 504-512
%K programming methodology

%A L. Hyafil
%A H.T. Kung
%T The complexity of parallel evaluation of linear recurrences
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 513-521
%K theory of computation

%A Richard J. Lipton
%A Yechezkel Zalcstein
%T Word problems solvable in logspace
%J Journal of the ACM
%K jacm
%V 24
%N 3
%D July 1977
%P 522-526
%K theory of computation

%A Robert E. Shostak
%T On the SUP-INF method for proving Presburger formulas
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 529-543
%K artificial intelligence

%A R.A. DeMillo
%A K. Vaivaran
%A E. Sycara-Cyranski
%T A study of schedules as models of synchronous parallel computation
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 544-565
%K computational structures

%A Mamoru Maekawa
%T Queueing models for computer systems
connected by a communication line
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 566-582
%K computer communications

%A Nancy Lynch
%T Log space recognition and translation of parenthesis languages
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 583-590
%K formal languages

%A Ian F. Blake
%A Alan G. Konheim
%T Big buckets are (are not) better !
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 591-606
%K information retrieval

%A C.T. Yu
%A W.S. Luk
%T Analysis of effectiveness of retrieval in clustered files
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 607-622
%K information retrieval

%A T.D. Bui
%T Errata and comments on a paper by J.R. Cash
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 623
%K numerical computation

%A S.E. Sahasrabudhe
%A A.D. Kulkarni
%T On solving Fredholm integral equations of the first kind
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 624-629
%K numerical computation

%A Bharat Kinariwala
%A A.G. Rao
%T Flow switching approach to the maximum flow problem: I
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 630-645
%K operations research

%A Kenneth J. Omahen
%T Capacity bounds for multiresource queues
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 646-663
%K operations research

%A D.S. Hirchberg
%T Algorithms for the longest common subsequence problem
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 664-675
%K string manipulation

%A Shawpawn Kumar Das
%T A machine representation of finite T0 topologies
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 676-692
%K theory of computation

%A Paul Young
%T Optimization among provably equivalent programs
%J Journal of the ACM
%K jacm
%V 24
%N 4
%D October 1977
%P 693-700
%K theory of computation

%A Y. Perl
%A Y. Shiloach
%T Finding two disjoint paths between two pairs of vertices in a graph
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 1-9
%K combinatorics and graph theory

%A Luigi Logrippo
%T Renaming and economy of memory in program schemata
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 10-22
%K computational structures

%A Ronald V. Book
%T Simple representations of certain classes of languages
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 23-31
%K formal languages

%A Harry B. Hunt,\ III
%A Thomas G. Szymanski
%T Lower bounds and reductions between grammar problems
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 32-51
%K formal languages

%A R. Attar
%A Y. Choueka
%A N. Dershowitz
%A A.S. Fraenkel
%T KEDMA - linguistic tools for retrieval systems
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 52-66
%K information retrieval

%A W.S. Cooper
%A M.E. Maron
%T Foundations of probabilistic and utility-theoretic indexing
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 67-80
%K information retrieval

%A A.H. Sameh
%A D.J. Kuck
%T On stable parallel linear system solvers
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 81-91
%K numerical computation

%A Teofilo Gonzalez
%A Sartaj Sahni
%T Preemptive scheduling of uniform processor systems
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 92-101
%K operations research

%A Zvi Galil
%A Joel Seiferas
%T A linear-time on-line recognition algorithm for "Palstar"
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 102-111
%K theory of computation

%A W. Morven Gentleman
%T Some complexity results for matrix computations
on parallel processors
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 112-115
%K theory of computation

%A Oscar H. Ibarra
%T Reversal-bounded multicounter machines and their decision problems
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 116-133
%K theory of computation

%A Harry R. Lewis
%T Renaming a set of clauses as a Horn set
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 134-135
%K theory of computation

%A C.P. Schnorr
%T Satisfiability is quasilinear complete in NQL
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 136-145
%K theory of computation

%A Joel I. Seiferas
%A Michael J. Fischer
%A Albert R. Meyer
%T Separating nondeterministic time complexity classes
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 146-167
%K theory of computation

%A Mitchell Wand
%T A new incompleteness result for Hoare's system
%J Journal of the ACM
%K jacm
%V 25
%N 1
%D January 1978
%P 168-176
%K theory of computation

%A Edward C. Horvath
%T Stable sorting in asymptotically optimal time and extra space
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 177-199
%K data structures and algorithms

%A Ronald L. Rivest
%T Optimal arrangement of keys in a hash table
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 200-209
%K data structures and algorithms

%A C.T. Yu
%A G. Salton
%A M.K. Siu
%T Effective automatic indexing using term addition and deletion
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 210-225
%K information retrieval

%A Gerard M. Baudet
%T Asynchronous iterative methods for multiprocessors
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 226-244
%K numerical computation

%A H.T. Kung
%A J.F. Traub
%T All algebraic functions can be computed fast
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 245-260
%K numerical computation

%A William McKie
%T An example of a skweing function
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 261-265
%K numerical computation

%A John M. Mulvey
%T Pivot strategies for primal-simplex network codes
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 266-270
%K numerical computation

%A David R. Musser
%T On the efficiency of a polynomial irreducibility test
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 271-282
%K numerical computation

%A K. Omahen
%A V. Marathe
%T Analysis and applications of the delay cycle
for the M/M/c queueing system
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 283-303
%K operations research

%A Andris A. Zoltners
%T A direct descent binary knapsack algorithm
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 304-311
%K operations research

%A Neil D. Jones
%A Steven S. Muchnick
%T The complexity of finite memory programs with recursion
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 312-321
%K theory of computation

%A David Maier
%T The complexity of some problems on subsequences and supersequences
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 322-336
%K theory of computation

%A Andrew C. Yao
%A Ronald L. Rivest
%T k+1 heads are better than k
%J Journal of the ACM
%K jacm
%V 25
%N 2
%D April 1978
%P 337-340
%K theory of computation

%A Malcolm C. Harrison
%A Norman Rubin
%T Another generalization of resolution
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 341-351
%K artificial intelligence

%A L.H. Landweber
%A E.L. Robertson
%T Properties of conflict-free and persistent Petri nets
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 352-364
%K computational structures

%A D.G. Kafura
%A V.Y. Shen
%T An algorithm to design the memory configuration of a computer network
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 365-377
%K computer systems

%A Gururaj S. Rao
%T Performance analysis of cache memories
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 378-395
%K computer systems

%A Doron Rotem
%A Y.L. Varol
%T Generation of binary trees from ballot sequences
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 396-404
%K data structures and algorithms

%A I.H. Sudborough
%T On the tape complexity of deterministic context-free languages
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 405-414
%K formal languages

%A Herbert S. Wilf
%T A global bisection algorithm for computing the zeros of polynomials
in the complex plane
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 415-420
%K numerical computation

%A A.C. McKellar
%A C.K. Wong
%T Dynamic placement of records in linear storage
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 421-434
%K operating systems

%A R.S. Garfinkel
%A K.C. Gilbert
%T The bottleneck traveling salesman problem:
algorithms and probabilistic analysis
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 435-448
%K operations research

%A Donald L. Iglehart
%A Gerald S. Shedler
%T Regenerative simulation of response times in networks of queues
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 449-460
%K operations research

%A C.A.R. Hoare
%T Some properties of predicate transformers
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 461-480
%K programming languages and methodology

%A Jon T. Butler
%T Analysis and design of fanout-free networks
of positive symmetric gates
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 481-498
%K switching theory

%A M.R. Garey
%A D.S. Johnson
%T "Strong" NP-completeness results:
motivation, examples and implications
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 499-508
%K theory of computation

%A Nicholas Pippenger
%T A time-space trade-off
%J Journal of the ACM
%K jacm
%V 25
%N 3
%D July 1978
%P 509-515
%K theory of computation

%A Alon Itai
%A Michael Rodeh
%A Steven L. Tanimoto
%T Some matching problems for bipartite graphs
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 517-525
%K combinatorics and graph theory

%A Brian Allen
%A Ian Munro
%T Self-organizing search trees
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 526-535
%K data structures and algorithms

%A J.L. Bentley
%A H.T. Kung
%A M. Schkolnick
%A C.D. Thompson
%T On the average number of maxima in a set of vectros and applications
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 536-543
%K data structures and algorithms

%A Leo J. Guibas
%T The analysis of hashing techniques that exhibit k-ary clustering
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 544-555
%K data structures and algorithms

%A Donald B. Johnson
%A Samuel D Kashdan
%T Lower bounds for selection in X+Y and other multisets
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 556-570
%K data structures and algorithms

%A S. Crespi-Reghizzi
%A G. Guida
%A D. Mandrioli
%T Noncounting context-free languages
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 571-580
%K formal languages

%A R.P. Brent
%A H.T. Kung
%T Fast algorithms for manipulating formal power series
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 581-595
%K numerical computation

%A Alon Itai
%T Two-commodity flow
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 596-611
%K operations research

%A E.L. Lawler
%A J. Labetoulle
%T On preemptive scheduling of unrelated parallel processors
by linear programming
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 612-619
%K operations research

%A Hendrik Vantilborgh
%T Exact aggregation in exponential queueing networks
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 620-629
%K operations research

%A Daniel Brand
%T Path calculus in program verification
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 630-651
%K programming languages and methodology

%A Peter J. Downey
%A Ravi Sethi
%T Assigment commands with array references
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 652-666
%K programming languages and methodology

%A Ravi Sethi
%T Conditional expressions with equality tests
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 667-674
%K programming languages and methodology

%A A.C. Arvillias
%A D.G. Maritsas
%T Partitioning the period of a class of m-sequences
and application to pseudorandom number generation
%J Journal of the ACM
%K jacm
%V 25
%N 4
%D October 1978
%P 675-686
%K pseudorandom number generation

%A Rainer Parchmann
%T Control system model for critically timed resources
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 1-5
%K computer systems

%A Alan Jay Smith
%T Characterizing the storage process and its effect
on the update of main memory by write through
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 6-27
%K computer systems

%A Udaiprakash Gupta
%T Bounds on storage for consecutive retrieval
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 28-36
%K database theory

%A Alberto O. Mendelzon
%T On axiomatizing multivalued dependencies in relational databases
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 37-44
%K database theory

%A Steven P. Reiss
%T Security in databases: a combinatorial study
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 45-57
%K database theory

%A Zvi Galil
%A Nimrod Megiddo
%T A fast selection algorithm
and the problem of optimum distribution of effort
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 58-64
%K data structures and algorithms

%A James M. Lemme
%A John R. Rice
%T Speedup in parallel algorithms for adaptive quadrature
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 65-71
%K numerical computation

%A Garry H. Rodrique
%A Neil K. Madsen
%A Jack I. Karush
%T Odd-even reduction for banded linear equations
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 72-81
%K numerical computation

%A George S. Fishman
%A Louis R. Moore
%T Estimating the mean of a correlated binary sequence
with an application to discrete event simulation
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 82-94
%K operations research

%A Christos H. Papadimitriou
%T Optimality of the Fast Fourier transform
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 95-102
%K theory of computation

%A Walter J. Savitch
%A Michael J. Stimson
%T Time bounded random access machines with parallel processing
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 103-118
%K theory of computation

%A John C. Cherniavsky
%A Samuel N. Kamin
%T A complete and consistent Hoare axiomatics
for a simple programming language
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 119-128
%K programming languages and methodology

%A Edmund Melson Clarke,\ Jr.
%T Programming language constructs for which it is impossible
to obtain good Hoare axiom systems
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 129-147
%K programming languages and methodology

%A Gerard Beery
%A Jean-Jacques Levy
%T Minimal and optimal computations of recursive programs
%J Journal of the ACM
%K jacm
%V 26
%N 1
%D January 1979
%P 148-175
%K programming languages and methodology

%A F.K. Hwang
%T An O(n log n) algorithm for rectilinear minimal spanning trees
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 177-182
%K combinatorics and graph theory

%A George S. Lueker
%A Kellogg S. Booth
%T A linear time algorithm for deciding interval graph isomorphism
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 183-195
%K combinatorics and graph theory

%A Azad Bolour
%T Optimality properties of multiple-key hashing functions
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 196-210
%K data structures and algorithms

%A Mark R. Brown
%A Robert E. Tarjan
%T A fast merging algorithm
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 211-226
%K data structures and algorithms

%A Frank Fussenegger
%A Harold N. Gabow
%T A counting approach to lower bounds for selection problems
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 227-238
%K data structures and algorithms

%A Boleslaw Kacewicz
%T Integrals with a kernel
in the solution of nonlinear equations in N dimensions
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 239-249
%K numerical computation

%A J.F. Traub
%A H. Wozniakowski
%T Convergence and complexity of Newton iteration for operator equations
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 250-258
%K numerical computation

%A Erol Gelenbe
%T On the optimum checkpoint interval
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 259-270
%K operating systems

%A Donald I. Iglehart
%A Peter A.W. Lewis
%T Regenerative simulation with internal controls
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 271-282
%K operations research

%A Tomasz Kowaltowski
%T Data structures and correctness of programs
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 283-321
%K programming languages and methodology

%A Barry K. Rosen
%T Data flow analysis for procedural languages
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 322-344
%K programming languages and methodology

%A K. Culik,\ II
%T A purely homomorphic characterization of recursively enumerable sets
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 345-350
%K theory of computation

%A Robert E. Shostak
%T A practical decision procedure for arithmetic with functions symbols
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 351-360
%K theory of computation

%A Nicholas Pippenger
%A Michael J. Fischer
%T Relations among complexity measures
%J Journal of the ACM
%K jacm
%V 26
%N 2
%D April 1979
%P 361-381
%K theory of computation

%A L.J. Henschen
%T Theorem proving by covering expressions
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 385-400
%K artificial intelligence

%A Jacques Cohen
%A Timothy Hickey
%T Two algorithms for determining volumes of convex polyhedra
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 401-414
%K combinatorics and graph theory

%A D.T. Lee
%A F.P. Preparata
%T An optimal algorithm for finding the kernel of a polygon
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 415-421
%K combinatorics and graph theory

%A Kuo-Chung Tai
%T The tree-to-tree correction problem
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 422-433
%K combinatorics and graph theory

%A Glenn K. Manacher
%T Significant improvements to the Hwang-Lin merging algorithm
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 434-440
%K data structures and algorithms

%A Glenn K. Manacher
%T The Ford-Johnson sorting algorithm is not optimal
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 441-456
%K data structures and algorithms

%A H.R. Strong
%A G. Markowsky
%A A.K. Chandra
%T Search within a page
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 457-482
%K data structures and algorithms

%A T.D. Bui
%T Some A-stable and L-stable methods for the numerical integration
of stiff ordinary differential equations
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 483-493
%K numerical computation

%A Robert D. Skeel
%T Scaling for numerical stability in Gaussian elimination
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 494-526
%K numerical computation

%A Arthur G. Werschultz
%T Maximal order and order of information for numerical quadrature
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 527-537
%K numerical computation

%A Greg N. Frederickson
%T Approximation algorithms for some postman problems
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 538-554
%K operations research

%A Brenda S. Baker
%A S. Rao Kosaraju
%T A comparison of multilevel break and next statements
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 555-566
%K programming languages and methodology

%A Eitan M. Gurari
%A Oscar H. Ibarra
%T An NP-complete number-theoretic problem
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 567-581
%K theory of computation

%A Zvi M. Kedem
%T Combining dimensionality and rate of growth arguments
for establishing lower bounds on the number of multiplications
and divisions
%J Journal of the ACM
%K jacm
%V 26
%N 3
%D July 1979
%P 582-601
%K theory of computation

%A T. Beyer
%A W. Jones
%A S. Mitchell
%T Linear algorithms for isomorphism of maximal outerplanar graphs
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 603-617
%K combinatorics and graph theory

%A Mihalis Yannakakis
%T The effect of a connectivity requirement
on the complexity of maximum subgraph problems
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 618-630
%K combinatorics and graph theory

%A Christos H. Papadimitriou
%T The serializability of concurrent database updates
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 631-653
%K database theory

%A Haim Mendelson
%A Uri Yechiali
%T Performance measures for ordered lists in random-access files
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 654-667
%K data structures and algorithms

%A Arnold L. Rosenberg
%T Encoding data structures in trees
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 668-689
%K data structures and algorithms

%A Robert E. Tarjan
%T Applications of path compression on balanced trees
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 690-715
%K data structures and algorithms

%A Joaquin Bustoz
%A Alan Feldstein
%A Richard Goodman
%A Seppo Linnainmaa
%T Improved trailing digits estimates
applied to optimal computer arithmetic
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 716-730
%K numerical computation

%A J.C. Butcher
%T A transformed implicit Runge-Kutta method
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 731-738
%K numerical computation

%A Donald B. Johnson
%A Webb Miller
%A Brian Minnihan
%A Celia Wrathall
%T Reducibility among floating-point graphs
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 739-760
%K numerical computation

%A U. Narayan Bhat
%A Richard E. Nance
%T An evaluation of CPU efficiency under dynamic quantum allocation
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 761-778
%K operating systems

%A Andrew S. Noetzel
%T A generalized queueing discipline for product form network solutions
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 779-793
%K operations research

%A George Milner
%T Flowgraphs and flow algebras
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 794-818
%K programming languages and methodology

%A Luigi Logrippo
%T Renamings, maximal parallelism, and space-time tradeoff
in program schemata
%J Journal of the ACM
%K jacm
%V 26
%N 4
%D October 1979
%P 819-833
%K theory of computation

%A Andrzej Proskurowski
%T On the generation of binary trees
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 1-2
%K combinatorics and graph theory

%A Marvin Solomon
%A Raphael A. Finkel
%T A note on enumerating binary trees
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 3-5
%K combinatorics and graph theory

%A David Nassimi
%A Sartaj Sahni
%T An optimal routing algorithm for mesh-connected parallel computers
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 6-29
%K computer systems

%A Krysztof Pawlikowski
%T Message waiting time in a packet switching system
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 30-41
%K computer systems

%A G. Boyd Swartz
%T Polling in a loop system
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 42-59
%K computer systems

%A Peter B. henderson
%A Yechezkei Zalcstein
%T Synchronization problems solvable by generalized PV systems
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 60-71
%K computational structures

%A Abraham Silberschatz
%A Zvi Kedem
%T Consistency in hierarchical database systems
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 72-80
%K database theory

%A Richard J. Lipton
%A Arnold L. Rosenberg
%A Andrew C. Yao
%T External hashing schemes for collections of data structures
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 81-95
%K data structures and algorithms

%A Joost Engelfriet
%A Erik Meineche Schmidt
%A Jan Van\ Leeuwen
%T Stack machines and classes of nontested macro languages
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 96-117
%K formal languages

%A Ravindran Kannan
%T A polynomial algorithm
for the two-variable integer programming problem
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 118-122
%K operations research

%A Richard A. DeMillo
%A Stanley C. Eisenstat
%A Richard J. Lipton
%T Space-time trade-offs in structured programming:
an improved combinatorial embedding theorem
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 123-127
%K programming languages and methodology

%A Marc A. Kaplan
%A Jeffrey D. Ullman
%T A scheme for the automatic inference of variable types
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 128-145
%K programming languages and methodology

%A Bhaskaram Prabhala
%A Ravi Sethi
%T Efficient computation of expressions with common subexpressions
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 146-163
%K programming languages and methodology

%A Mitchell Wand
%T Continuation-based program transformation strategies
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 164-180
%K programming languages and methodology

%A Edward A. Bender
%T The number of fanout-free functions with various gates
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 181-190
%K switching theory

%A Norihisa Suzuki
%A David Jefferson
%T Verification decidability of Presburger array programs
%J Journal of the ACM
%K jacm
%V 27
%N 1
%D January 1980
%P 191-205
%K theory of computation

%A Andrew Chi-Chih Yao
%T New algorithms for bin packing
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 207-227
%K combinatorics and graph theory

%A M. Pease
%A R. Shostak
%A L. Lamport
%T Reaching agreements in the presence of faults
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 228-234
%K computer systems

%A Raymond Reiter
%T Equality and domain closure for first-order databases
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 235-249
%K database theory

%A Yehoshua Sagiv
%T An algorithm for inferring multivalued dependencies
with an application to propositional logic
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 250-262
%K database theory

%A G.W. Wasilkowski
%T Can any stationary iteration using linear information
be globally convergent ?
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 263-269
%K numerical computation

%A Tiko Kameda
%T Testing deadlock-freedom of computer systems
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 270-280
%K operating systems

%A We-Min Chow
%T The cycle time distribution of exponential cyclic queues
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 281-286
%K operations research

%A Teofilo F. Gonzalez
%A Donald B. Johnson
%T A new algorithm for preemptive scheduling of trees
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 287-312
%K operations research

%A M. Reiser
%A S.S. Lavenberg
%T Mean value analysis of closed multichain queueing networks
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 313-322
%K operations research

%A Don Towsley
%T Queuing network models with state-dependent routing
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 323-337
%K operations research

%A Ramachandran Krishnaswamy
%A Arthur B. Pyster
%T On the correctness of semantic-syntax-directed translations
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 338-355
%K programming languages and methodology

%A Greg Nelson
%A Derek C. Oppen
%T Fast decision procedures based on congruence closure
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 356-364
%K programming languages and methodology

%A Stephen A. Ward
%A Robert H. Halstead,\ Jr.
%T A syntactic theory of message passing
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 365-383
%K programming languages and methodology

%A Harold Abelson
%T Lower bounds on information transfer in distributed computation
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 384-392
%K theory of computation

%A David Lichtenstein
%A Michael Sipser
%T Go is polynomial-space hard
%J Journal of the ACM
%K jacm
%V 27
%N 2
%D April 1980
%P 393-401
%K theory of computation

%A Derek C. Oppen
%T Reasoning about recursively defined data structures
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 403-411
%K artificial intelligence

%A Doris Altenkamp
%A Kurt Mehlhorn
%T Codes: unequal probabilities, unequal letter costs
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 412-427
%K combinatorics and graph theory

%A Ronald L. Graham
%A Andrew C. Yao
%A F. Frances Yao
%T Information bounds are weak in the shortest distance problem
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 428-444
%K combinatorics and graph theory

%A Yossi Shiloach
%T A polynomial solution in the undirected two paths problem
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 445-456
%K combinatorics and graph theory

%A Kishor S. Trivedi
%A Robert A. Wagner
%A Timothy M. Sigmon
%T Optimal selection of CPU speed,
device capacities, and file assignments
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 457-473
%K computer systems

%A Haim Mendelson
%A Uri Yechali
%T A new approach to the analysis of linear probing schemes
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 474-483
%K data structures and algorithms

%A Fred G. Abramson
%A Yuri Breitbart
%A Forbes D. Lewis
%T Complex properties of grammars
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 484-418
%K formal languages

%A J. Engelfriet
%A G. Rozenberg
%T Fixed point languages, equality languages,
and representation of recursively enumerable languages
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 499-518
%K formal languages

%A G. Fayolle
%A I. Mitrani
%A R. Iasnogorodski
%T Sharing a processor among many job classes
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 519-532
%K operations research

%A Christos H. Papadimitriou
%A Paris C. Kanellakis
%T Flowshop scheduling with limited temporary storage
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 533-549
%K operations research

%A Sartaj Sahni
%A Yookun Cho
%T Scheduling independent tasks with due times
on a uniform processor system
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 550-579
%K operations research

%A Ravi Sethi
%A Adrian Tang
%T Constructing call-by-value continuation semantics
%J Journal of the ACM
%K jacm
%V 27
%N 3
%D July 1980
%P 580-597
%K programming languages and methodology

%A Alan R. Aronson
%A Barry E. Jacobs
%A Jack Minker
%T A note on fuzzy deduction
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 599-603
%K artificial intelligence

%A D.T. Lee
%T Two-dimensional Voronoi diagrams in the Lp-metric
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 604-618
%K combinatorics and graph theory

%A Shuji Tsukiyama
%A Hiromu Ariyoshi
%A Isao Shirakawa
%A Hiroshi Ozaki
%T An algorithm to enumerate all cutsets of a graph
in linear time per cutset
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 619-632
%K combinatorics and graph theory

%A Yehoshua Sagiv
%A Mihalis Yannakakis
%T Equivalences among relational expressions
with the union and difference operators
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 633-655
%K database theory

%A A. Ehrenfeucht
%A G. Rozenberg
%T The sequence equivalence problem is decidable for 0S systems
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 656-663
%K database theory

%A David Maier
%T Minimum covers in the relational database model
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 664-674
%K database theory

%A S.A. Greibach
%A E.P. Friedman
%T Superdeterministic PDAs: a subcase with a decidable inclusion problem
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 675-700
%K formal languages

%A J.T. Schwartz
%T Fast probabilistic algorithms
for verification of polynomial identities
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 701-717
%K numerical computation

%A Marshall L. Fisher
%A Dorit S. Hochbaum
%T Database location in computer networks
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 718-735
%K operations research

%A K.G. Ramakrishnan
%T Solving two-commodity transportation problems
with coupling constraints
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 736-757
%K operations research

%A Peter J. Downey
%A Ravi Sethi
%A Robert Endre Tarjan
%T Variations on the common subexpression problem
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 758-771
%K common subexpression, congruence closure, decision procedure,
expression equivalence, graph algorithm, lossless join,
relational database, theory of equality, unification,
uniform word problem
%K programming languages and methodology

%A Jean-Claude Raoult
%A Jean Vuillemin
%T Operational and semantic equivalence between recursive programs
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 772-796
%K programming languages and methodology

%A Gerard Huet
%T Confluent reductions: abstract properties
and applications to term rewriting systems
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 797-821
%K theory of computation

%A Joseph Ja' Ja'
%T Computation of bilinear forms over finite fields
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 822-830
%K theory of computation

%A Richard E. Ladner
%A Michael J. Fischer
%T Parallel prefix computation
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 831-838
%K theory of computation

%A Rudiger Reischuk
%T Improved bounds on the problem of time-space trade-off
in the pebble game
%J Journal of the ACM
%K jacm
%V 27
%N 4
%D October 1980
%P 839-859
%K theory of computation

%A Shimon Even
%A Yossi Shiloach
%T An on-line edge-deletion problem
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 1-4
%K combinatorics and graph theory

%A Yehoshua Perl
%A Stephen R. Schach
%T Max-min tree partitioning
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 5-15
%K combinatorics and graph theory

%A Michael Rodeh
%A Vaughan R. Pratt
%A Shimon Even
%T Linear algorithm for data compression via string matching
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 16-24
%K data structures and algorithms

%A Phillip A. Bernstein
%A Dah-Ming W. Chiu
%T Using semi-joins to solve relational queries
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 25-40
%K database theory

%A Witold Lispki,\ Jr.
%T On databases with incomplete information
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 41-70
%K database theory

%A G.W. Wasilkowski
%T n-evaluation conjecture for multipoint iterations
for the solution of scalar nonlinear equations
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 71-80
%K numerical computation

%A James O. Achugbue
%A Francis Y. Chin
%T Bounds on schedules for independent tasks
with similar execution times
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 81-99
%K operations research

%A J. Bruno
%A G.N. Frederickson
%T Sequencing tasks with exponential service times to minimize
the expected flow time of make-span
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 100-113
%K operations research

%A Ashok K. Chandra
%A Dexter C. Kozen
%A Larry J. Stockmeyer
%T Alternation
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 114-133
%K theory of computation

%A Zvi Galil
%T String matching in real time
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 134-149
%K theory of computation

%A David G. Kirkpatrick
%T A unified lower bound for selection and set partitioning problems
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 150-165
%K theory of computation

%A Benton L. Leong
%A Joel I. Seiferas
%T New real-time simulations of multihead tape units
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 166-180
%K theory of computation

%A John H. Rowland
%A Philip J. Davis
%T On the use of transcendentals for program testing
%J Journal of the ACM
%K jacm
%V 28
%N 1
%D January 1981
%P 181-190
%K theory of computation

%A Peter B. Andrews
%T Theorem proving via general matings
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 193-214
%K artificial intelligence

%A Prabhaker Mateti
%T A decision procedure for the correctness of a class of programs
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 215-232
%K artificial intelligence

%A Gerald E. Peterson
%A Mark E. Stickel
%T Complete sets of reductions for some equational theories
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 233-264
%K artificial intelligence

%A C.K. Chu
%T A note on multiple error detection
in ASCII numeric data communication
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 265-269
%K computer systems

%A Kishor S. Trivedi
%A Timothy M. Sigmon
%T Optimal design of linear storage hierarchies
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 270-288
%K computer systems

%A Gaston H. Gonnet
%T Expected length of the longest probe sequence in hash code searching
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 289-304
%K data structures and algorithms

%A Michael Karr
%T Summation in finite terms
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 305-350
%K numerical computation

%A R.M. Feldman
%A G.W. Adkins
%A G.L. Curry
%A U.W. Pooch
%T Measurement bias in feedback queues
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 351-357
%K operations research

%A K.C. Sevcik
%A I. Mitrani
%T The distribution of queuing network states
at input and output instants
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 358-371
%K operating systems

%A C.J. Hogger
%T Derivation of logic programs
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 372-392
%K programming languages and methodology

%A Martin Rem
%T The closure statement: a programming language construct
allowing ultraconcurrent execution
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 393-410
%K programming languages and methodology

%A K.J. Lieberherr
%A E. Specker
%T Complexity of partial satisfaction
%J Journal of the ACM
%K jacm
%V 28
%N 2
%D April 1981
%P 411-421
%K theory of computation

%A Mark E. Stickel
%T A unification algorithm for associative-commutative functions
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 423-434
%K artificial intelligence

%A Yehoshua Sagiv
%A Claude Delobel
%A D. Stott Parker,\ Jr.
%A Ronald Fagin
%T An equivalence between relational database dependencies
and a fragment of propositional logic
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 435-453
%K database theory

%A David Dobkin
%A J. Ian Munro
%T Optimal time minimal space selection algorithms
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 454-461
%K data structures and algorithms

%A Francis Y. Chin
%A Long-Lieh Tsai
%T On J-maximal and J-minimal flow-shop schedules
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 462-476
%K operations research

%A Leonard Kleinrock
%A Arne Nilsson
%T On optimal scheduling algorithms for time-shared systems
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 477-486
%K operating systems

%A Hanan Samet
%T Connected component labeling using quadtrees
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 487-501
%K picture processing

%A Sarangan Krishna Kumar
%A Melvin A. Breuer
%T Probabilistic aspects of boolean switching functions
via a new transform
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 502-520
%K switching theory

%A R.P. Brent
%A H.T. Kung
%T The area-time complexity of binary multiplication
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 521-534
%K theory of computation

%A Eitan M. Gurari
%A Oscar H. Ibarra
%T The complexity of the equivalence problem for simple programs
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 535-560
%K theory of computation

%A Ernst W. Mayr
%A Albert R. Meyer
%T The complexity of the finite containment problem for Petri nets
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 561-576
%K theory of computation

%A Robert Endre Tarjan
%T A unified approach to path problems
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 577-593
%K theory of computation

%A Robert Endre Tarjan
%T Fast algorithms for solving path problems
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 594-614
%K theory of computation

%A Andrew Chi-Chih Yao
%T Should tables be sorted ?
%J Journal of the ACM
%K jacm
%V 28
%N 3
%D July 1981
%P 615-628
%K theory of computation

%A M. Reiser
%A S.S. Lavenberg
%T Mean-value analysis of closed multichain queuing networks
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 629-630

%A Wolfgang Bibel
%T On matrices with connections
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 633-645
%K artificial intelligence

%A D.W. Loveland
%A C.R. Reddy
%T Deleting repeated goals in the problem reduction format
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 646-661
%K artificial intelligence

%A Guy Latouche
%T Algorithmic analysis
of a multiprogramming-multiprocessor computer system
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 662-679
%K computer systems

%A David Maier
%A Yehoshua Sagiv
%A Mihalis Yannakakis
%T On the complexity of testing implications
of functional and join dependencies
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 680-695
%K database theory

%A Michael L. Fredman
%T A lower bound on the complexity of orthogonal range queries
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 696-705
%K data structures and algorithms

%A A. Ehrenfeucht
%A G. Rozenberg
%A K. Ruohonen
%T A morphic representation of complements
of recursively enumerable sets
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 706-714
%K formal languages

%A Mehdi Jazayeri
%T A simpler construction for showing the intrinsically exponential
complexity of the circularity problem for attribute grammars
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 715-720
%K formal languages

%A Ernest Davis
%A Jeffrey M. Jaffe
%T Algorithms for scheduling tasks on unrelated processors
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 721-736
%K operations research

%A Stefania Gnesi
%A Ugo Montanari
%A Alberto Martelli
%T Dynamic programming as graph searching: an algebraic approach
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 737-751
%K operations research

%A N. Katoh
%A T. Ibaraki
%A H. Mine
%T An algorithm for K best solutions of the resource allocation problem
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 752-764
%K operations research

%A Christos H. Papadimitriou
%T On the complexity of integer programming
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 765-768
%K operations research

%A Robert Shostak
%T Deciding linear inequalities by computing loop residues
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 769-779
%K programming languages and methodology

%A Andrew Chi-Chih Yao
%T A lower bound to finding convex hulls
%J Journal of the ACM
%K jacm
%V 28
%N 4
%D October 1981
%P 780-787
%K theory of computation

%A George W. Ernst
%A Michael M. Goldstein
%T Mechanical discovery of classes of problem-solving strategies
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 1-23

%A Eugene C. Freuder
%T A sufficient condition for backtrack-free search
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 24-32

%A Drew McDermott
%T Nonmonotonic logic II: nonmonotonic modal theories
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 33-57

%A Ronald L. Becker
%A Stephen R. Schach
%A Vehoshua Perl
%T A shifting algorithm for min-max tree partitioning
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 58-67

%A Christoph M. Hoffmann
%A Michael J. O'Donnell
%T Pattern matching in trees
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 68-95

%A Zvi Galil
%T An almost linear-time algorithm for computing a dependency basis
in a relational database
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 96-102

%A Yehoshoa Sagiv
%A Scott F. Walecka
%T Subset dependencies and a completeness result
for a subclass of embedded multivalued dependencies
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 103-117

%A H.A. Maurer
%A A. Salomaa
%A D. Wood
%T Dense hierarchies of grammatical families
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 118-126

%A D. Chow
%A C.T. Yu
%T On the construction of feedback queries
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 127-151

%A C.T. Yu
%A K. Lam
%A G. Salton
%T Term wighting in information retrieval using the term precision model
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 152-170

%A Ronald V. Book
%T Confluent and other types of Thue systems
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 171-182

%A James E. Burns
%A Paul Jackson
%A Nancy A. Lynch
%A Michael J. Fischer
%A Gary L. Peterson
%T Data requirements for implementation of N-process mutual exclusion
using a single shared variable
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 183-205

%A H.-D. Ehrich
%T On the theory of specification, implementation, and parameterization
of abstract data types
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 206-227

%A H.B. Hunt,\ III
%T On the complexity of flowchart and loop program schemes
and programming languages
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 228-249

%A Michael L. Fredman
%T The complexity of maintaining an array and computing partial sums
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 250-260

%A Charles Backoff
%T Relativized questions involving probabilistic algorithms
%J Journal of the ACM
%K jacm
%V 29
%N 1
%D January 1982
%P 261-268

%A Steve Winker
%T Generation and verification of finte models and counterexamples
using an automated theorem prover answering two open questions
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 273-284

%A Christos H. Papadimitriou
%A Mihalis Yannakakis
%T The complexity of restricted spanning tree problems
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 285-309

%A Barry E. Jacobs
%T On database logic
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 310-332

%A Y. Edmund Lien
%T On the equivalence of database models
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 333-362

%A Fereidoon Sadri
%A Jeffrey D. Ullman
%T Template dependencies: a large class of dependencies
in relational databases and its complete axiomatization
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 363-372

%A Edward Sciore
%T A complete axiomatization of full join dependencies
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 373-393

%A Ravi Sethi
%T Useless actions make a difference:
strict serializability of database updates
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 394-403

%A Christopher Bader
%A Arnaldo Moura
%T A generalization of Ogden's lemma
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 404-407

%A Jacques Cohen
%A Timothy Hickey
%A Joel Katcoff
%T Upper bounds for speedup in parallel parsing
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 408-428

%A H.B. Hunt,\ III
%T On the decidability of grammar problems
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 429-447

%A Theodore Brown
%T Determination of the conditional response
for quantum allocation algorithms
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 448-460

%A R.M. Bryant
%T Maximum rates of memory bound systems
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 461-477

%A Hisao Kameda
%T A finite-sequence queue with different customers
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 478-491

%A Simon S. Lam
%T Dynamic scaling and growth behavior
of queueing network normalization constants
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 492-513

%A Manfred Ruschitzka
%T The performance of job classes with distinct policy functions
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 514-526

%A Percy Tzelnic
%A Izidor Gertner
%T An approach to program behavior modeling and optimal memory control
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 527-554

%A Albert R. Meyer
%A Joseph Y. Halpern
%T Axiomatic definitions of programming languages:
a theoretical assessment
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 555-576

%A Michael A. Arbib
%A Ernest G. Manes
%T The pattern-of-calls expansion
is the canonical fixpoint for recursive definitions
%J Journal of the ACM
%K jacm
%V 29
%N 2
%D April 1982
%P 577-602

%A Robert W. Floyd
%A Jeffrey D. Ullman
%T The compilation of regular expressions into integrated circuits
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 603-622

%A K. Takamizawa
%A T. Nishizeki
%A N. Saito
%T Linear-time computability of combinatorial problems
on series-parallel graphs
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 623-641

%A David Nassimi
%A Sartaj Sahni
%T Parallel permutation and sorting algorithms
and a new generalized connection network
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 642-667

%A Peter Honeyman
%T Testing satisfaction of functional dependencies
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 668-677

%A Seymour Ginsburg
%A Sami Mohammed Zaiddan
%T Properties of functional-dependency families
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 678-698

%A Anthony Klug
%T Equivalence of relational algebra and relational calculus
query languages having aggregate functions
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 699-717

%A Mihalis Yannakakis
%T A theory of safe locking policies in database systems
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 718-740

%A Dana Angluin
%T Inference of reversible languages
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 741-765

%A Harold N. Gabow
%T An almost-linear algorithm for two-processor scheduling
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 766-780

%A Errol L. Lloyd
%T Critical path scheduling with resource and processor constraints
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 781-811

%A Charles Martel
%T Preemptive scheduling with release times, deadlines, and due times
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 812-829

%A Christopher L. Samelson
%A William C. Bulgren
%T A note on product-form solution for queueing networks
with Poisson arrivals and general service-time distributions
with finite means
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 830-840

%A Krzysztof R. Apt
%A M.H. van\ Emden
%T Contributions to the theory of logic programming
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 841-862

%A Eitan M. Gurari
%A Oscar H. Ibarra
%T Two-way counter machines and Diophantine equations
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 863-873

%A Mark Jerrum
%A Marc Snir
%T Some exact complexity results
for straight-line computations over semirings
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 874-897

%A Andrew Chi-Chih Yao
%T On parallel computation for the knapsack problem
%J Journal of the ACM
%K jacm
%V 29
%N 3
%D July 1982
%P 898-903

%A Fouad A. Tobagi
%T Distribution of packet delay and interdeparture time
in slotted ALOHA and carrier sense multiple access
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 907-927

%A James A. Storer
%A Thomas G. Szymanski
%T Data compression via textual substitution
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 928-951

%A Ronald Fagin
%T Horn clauses and database dependencies
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 952-985

%A John Grant
%A Barry E. Jacobs
%T On the family of generalized dependency constraints
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 986-997

%A Christos H. Papadimitriou
%T A theorem in database concurrency control
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 998-1006

%A John C. Beatty
%T On the relationship between the LL(1) and LR(1) grammars
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 1007-1022

%A Toshimi Minoura
%T Deadlock avoidance revisited
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 1023-1048

%A Eugene W. Stark
%T Semaphore primitives and starvation-free mutual exclusion
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 1049-1072

%A Leslie M. Goldschlager
%T A unversal interconnection pattern for parallel computers
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 1073-1086

%A Thomas Lengauer
%A Robert E. Tarjan
%T Asymptotically tight bounds on time-space trade-offs in a pebble game
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 1087-1130

%A David W. Matula
%T Basic digit sets for radix representation
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 1131-1143

%A Carl H. Smith
%T The power of pluralism for automatic program synthesis
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 1144-1165

%A Esko Ukkonen
%T The equivalence problem
for some non-real-time deterministic pushdown automata
%J Journal of the ACM
%K jacm
%V 29
%N 4
%D October 1982
%P 1166-1181

%A A. Bagchi
%A A. Mahanti
%T Search algorithms under different kinds of heuristics
- a comparative study
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 1-21
%K artificial intelligence

%A Dennis de\ Champeaux
%T Bidirectional heuristic search again
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 22-32
%K artificial intelligence

%A D.V. Sarwarte
%T A note on "A note on multiple error detection
in ASCII numeric data communication"
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 33-35
%K computer systems

%A Anthony Klug
%T Locking expressions for increased database concurrency
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 36-54
%K database theory

%A Henry F. Korth
%T Locking primitives in a database system
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 55-79
%K database theory

%A Greg N. Frederickson
%T Implicit data structures for the dictionary problem
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 80-94
%K data structures and algorithms

%A H.A. Maurer
%A A. Salomaa
%A D. Wood
%T A supernormal-form theorem for context-free grammars
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 95-102
%K formal language

%A R.E. Lord
%A J.S. Kowalik
%A S.P. Kumar
%T Solving linear algebraic equations on an MIMD computer
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 103-117
%K numerical computation

%A Bezalel Gavish
%T Formulations and algorithms
for the capacitated minimal directed tree problem
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 118-132
%K operations research

%A Ravindran Kannan
%T Polynomial-time aggregation of integer programming problems
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 133-145
%K operations research

%A R. Schassberger
%A H. Daduna
%T The time for a round trip in a cycle of exponential queues
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 146-150
%K operations research

%A Steven Fortune
%A Daniel Leivant
%A Michael O'Donnell
%T The expressiveness of simple and second-order type structures
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 151-185
%K programming languages and methodology

%A H.R. Strong
%T Vector execution of flow graphs
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 186-196
%K programming languages and methodology

%A Krzysztof R. Apt
%T Formal justification of a proof system
for communicating sequential processes
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 197-216
%K programming languages and systems

%A Oscar H. Ibarra
%A Shlomo Moran
%T Probabilistic algorithms
for deciding equivalence of straight-line programs
%J Journal of the ACM
%K jacm
%V 30
%N 1
%D January 1983
%P 217-228
%K theory of computation

%A Jeffrey Scott Vitter
%T Analysis of the search performance of coalesced hashing
%J Journal of the ACM
%K jacm
%V 30
%N 2
%D April 1983
%P 231-258
%K data structures and algorithms

%A Seppo Sippu
%A Eljas Soisalon-Soininen
%A Esko Ukkonen
%T The complexity of LALR(k) testing
%J Journal of the ACM
%K jacm
%V 30
%N 2
%D April 1983
%P 259-270
%K formal languages

%A G.W. Stewart
%T Computable error bounds for aggregated Markov chains
%J Journal of the ACM
%K jacm
%V 30
%N 2
%D April 1983
%P 271-285
%K operations research

%A K.M. Chandy
%A A.J. Martin
%T A characterization of product-form queueing networks
%J Journal of the ACM
%K jacm
%V 30
%N 2
%D April 1983
%P 286-299
%K operating systems

%A Jeffrey M. Jaffe
%T Decentralized simulation of resource managers
%J Journal of the ACM
%K jacm
%V 30
%N 2
%D April 1983
%P 300-322
%K operating systems

%A Daniel Brand
%A Pitro Zafiropulo
%T On communicating finite-state machines
%J Journal of the ACM
%K jacm
%V 30
%N 2
%D April 1983
%P 323-342
%K programming languages and systems

%A C. Farshid Nourani
%T Abstract implementations and their correctness proofs
%J Journal of the ACM
%K jacm
%V 30
%N 2
%D April 1983
%P 343-359
%K programming languages and systems

%A Zvi Galil
%A Wolfgang J. Paul
%T An efficient general-purpose parallel computer
%J Journal of the ACM
%K jacm
%V 30
%N 2
%D April 1983
%P 360-387
%K theory of computation

%A Michael Tarsi
%T Optimal search on some game trees
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 389-396
%K artificial intelligence

%A Arnold L. Rosenberg
%T Three-dimensional VLSI: a case study
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 397-416
%K circuit design

%A David W. Matula
%A Leland L. Beck
%T Smallest-last ordering and clustering and graph coloring algorithms
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 417-427
%K combinatorics and graph theory

%A Kenneth J. Sopuwit
%T The relative neighbourhood graph,
with an application to minimum spanning trees
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 428-448
%K combinatorics and graph theory

%A Eshrat Arjomandi
%A Michael J. Fisher
%A Nancy A. Lynch
%T Efficiency of synchronous versus asynchronous distributed systems
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 449-456
%K computer systems

%A E.G. Coffman,\ Jr.
%A Ravi Sethi
%T Instruction sets for evaluating arithmetic expressions
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 457-478
%K computer systems

%A Catriel Beeri
%A Ronald Fagin
%A David Maier
%A Mihalis Yannakakis
%T On the desirability of acyclic database schemes
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 479-513
%K database theory

%A Ronald Fagin
%T Degrees of acyclicity for hypergraphs and relational database schemes
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 514-550
%K database theory

%A Dan Gusfield
%T Parametric combinatorial computing
and a problem of program module distribution
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 551-563
%K operations research

%A Rajan Suri
%T Robustness of queueing network formulas
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 564-594
%K operations research

%A Jean-Claude Raoult
%A Ravi Sethi
%T Properties of a notation for combining functions
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 595-611
%K programming languages and methodology

%A Edmund M. Clarke,\ Jr.
%A Steven M. German
%A Joseph Y. Halpern
%T Effective axiomatizations of Hoare logics
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 612-636
%K programming languages and methodology

%A Georg Gati
%T The complexity of solving polynomial equations by quadrature
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 637-640
%K theory of computation

%A Oscar H. Ibarra
%A Brian S. Leininger
%T On the simplification and equivalence problems
for straight-line programs
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 641-656
%K theory of computation

%A Joseph Ja' Ja'
%T Time-space trade-offs for some algebraic problems
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 657-667
%K theory of computation

%A L. Lamport
%T The weak Byzantine generals problem
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 668-676
%K theory of computation

%A Xu Mei-Rui
%A John E. Doner
%A Ronald V. Book
%T Refining nondeterminism in relativizations of complexity classes
%J Journal of the ACM
%K jacm
%V 30
%N 3
%D July 1983
%P 677-685
%K theory of computation

%A Dana S. Nau
%T Decision quality as a function of search depth on game trees
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 687-708
%K artificial intelligence

%A Jia-Wei Hong
%A Kurt Mehlhorn
%A Arnold L. Rosenberg
%T Cost trade-offs in graph embedding, with applications
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 709-728
%K combinatorics and graph theory

%A Ari Widgerson
%T Improving the performance guarantee for approximate graph coloring
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 729-735
%K combinatorics and graph theory

%A Toshihide Ibaraki
%A Hussein M. Abdel-Wahab
%A Tiko Kameda
%T Design of minimum-cost deadlock-free systems
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 736-751
%K computer system modeling and analysis

%A Giorgio Ausiello
%A Alessandro D'Atri
%A Domenico Sacca
%T Graph algorithms for functional dependency manipulation
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 752-766
%K database theory

%A Nathan Goodman
%A Oded Shmueli
%T Syntactic characterization of tree database schemas
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 767-786
%K database theory

%A Zvi M. Kedem
%A Abraham Silberschatz
%T Locking protocols: from exclusive to shared locks
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 787-804
%K database theory

%A Per-Ake Larson
%T Analysis of uniform hashing
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 805-819
%K data structures and algorithms

%A Yael Krevner
%A Amiram Yehidai
%T An iteration theorem for simple precedence languages
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 820-833
%K formal languages

%A Bruce Hajek
%T The proof of a folk theorem on queuing delay
with applications to routing in networks
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 834-851
%K operating systems

%A Nimrod Megiddo
%T Applying parallel computation algorithms
in the design of serial algorithms
%J Journal of the ACM
%K jacm
%V 30
%N 4
%D October 1983
%P 852-865
%K theory of computation

%A Robert E. Shostak
%T Deciding combinations of theories
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 1-12
%K artificial intelligence

%A H.J. Hoover
%A M.M. Klawe
%A N.J. Pippenger
%T Bounding fan-out in logical networks
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 13-18
%K circuit design

%A Peter Eades
%A Michael Hickey
%A Ronald C. Read
%T Some Hamilton paths and a minimal change algorithm
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 19-29
%K combinatorics and graph theory

%A Catriel Beeri
%A Martin Dowd
%A Ronald Fagin
%A Richard Statman
%T On the structure of Armstrong relations for functional dependencies
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 30-46
%K database theory

%A Lawrence J. Henschen
%A Shamim A. Naqwi
%T On compiling queries in recursive first-order databases
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 47-85
%K database theory

%A Aurel A. Lazar
%T Optimal flow control of an M/M/m queue
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 86-98
%K operating systems

%A Sidnie Dresher Feit
%T A fast algorithm for the two-variable integer programming problem
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 99-113
%K operations research

%A Nimrod Megiddo
%T Linear programming in linear time when the dimension is fixed
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 114-127
%K operations research

%A O.J. Boxma
%A F.P. Kelly
%A A.G. Konheim
%T The product form for sojourn time distributions
in cyclic exponential queues
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 128-133
%K system modeling and analysis

%A B. Simon
%T Priority queues with feedback
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 134-149
%K system modeling and analysis

%A J. Ja' Ja'
%A V.K. Prasanna Kumar
%T Information transfer in distributed computing
with applications to VLSI
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 150-162
%K theory of computation

%A Douglas R. Smith
%T Random trees and the analysis of branch and bound procedures
%J Journal of the ACM
%K jacm
%V 31
%N 1
%D January 1984
%P 163-188
%K theory of computation

%A Allan Gottlieb
%A Clyde P. Kruskal
%T Complexity results for permuting data
and other computations of parallel processors
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 193-209
%K computer systems

%A Richard Hull
%T Finitely specifiable implicational dependency families
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 210-226
%K database theory

%A Mihalis Yannakakis
%T Serializability by locking
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 227-244
%K database theory

%A Robert E. Tarjan
%A Jan van\ Leeuwen
%T Worst-case analysis of set union algorithms
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 245-281
%K data structures and algorithms

%A Karel Culik,\ II
%A Tero Harju
%T The omega-sequence equivalence problem for D0L systems is decidable
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 282-298
%K formal languages

%A H.B. Hunt,\ III
%T Terminating Turing machine computations and the complexity and/or
decidability of correspondence problems, grammars and program schemes
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 299-318
%K formal languages

%A C.W. Clenshaw
%A F.W.J. Olver
%T Beyond floating point
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 319-328
%K numerical computation

%A George M. Trojan
%T Lower bounds and fast algorithms for secure acceleration
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 329-335
%K numerical computation

%A Hans Rock
%T The three-machine no-wait flow shop is NP-complete
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 336-345
%K operations research

%A J. McKenna
%A Debasis Mitra
%T Asymptotic expansions and integral representations
of moments of queue lengths in closed Markovian networks
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 346-360
%K system modeling and analysis

%A Akeo Adachi
%A Shigeki Iwata
%T Some combinatorial game problems require OMEGA(n^k) time
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 361-376
%K theory of computation

%A Joseph Ja' Ja'
%T The VLSI complexity of selected graph problems
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 377-391
%K theory of computation

%A Christos H. Papadimitriou
%T On the complexity of unique solutions
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 392-400
%K theory of computation

%A John H. Reif
%T Symmetric complementation
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 401-421
%K theory of computation

%A John E. Savage
%T Space-time trade-offs for banded matrix problems
%J Journal of the ACM
%K jacm
%V 31
%N 2
%D April 1984
%P 422-437
%K theory of computation

%A Robert S. Boyer
%A J. Strother Moore
%T A mechanical proof of the unsolvability of the halting problem
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 441-458
%K artificial intelligence

%A Yuri Gurevich
%A Larry Stockmeyer
%A Uzi Vishkin
%T Solving NP-hard problems on graphs that are almost trees
and an application to facility location problems
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 459-473
%K combinatorics and graph theory

%A Francois Baccelli
%A Erol Gelenbe
%A Brigitte Plateau
%T An end-to-end approach to the resequencing problem
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 474-485
%K computer systems

%A Ajoy Datta
%A S. Ghosh
%T Synthesis of a class of deadlock-free Petri nets
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 486-506
%K computer systems

%A Eli Upfal
%T Efficient schemes for parallel communication
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 507-517
%K computer systems

%A Richard Hull
%A Chee K. Yap
%T The format model: a theory of database organization
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 518-537
%K database theory

%A Michael L. Fredman
%A Janos Komlos
%A Endre Szemeredi
%T Storing a sparse table with O(1) worst case access time
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 538-544
%K data structures and algorithms

%A J.F. Traub
%A H. Wozniakowski
%T On the optimal solution of large linear systems
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 545-559
%K numerical computation

%A S.D. Brookes
%A C.A.R. Hoare
%A A.W. Roscoe
%T A theory of communicating sequential processes
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 560-599
%K programming languages and methodology

%A John McLean
%T A formal method for the abstract specification of software
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 600-627
%K programming languages and methodology

%A Micha Hofri
%T Analysis of interleaved storage via a constant-service queuing system
with Markov-chain-driven input
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 628-648
%K system modeling and analysis

%A Mikhail J. Atallah
%A S. Rao Kosaraju
%T Graph problems on a mesh-connected processor array
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 649-667n
%K theory of computation

%A Friedhelm Meyer auf def Heide
%T A polynomial linear search algorithm
for the n-dimensional knapsack problem
%J Journal of the ACM
%K jacm
%V 31
%N 3
%D July 1984
%P 668-676
%K theory of computation

%A S.G. Williamson
%T Depth-first search and Kuratowski subgraphs
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 681-693
%K combinatorics and graph theory

%A Jonathan W. Greene
%A Abbas el Gamal
%T Configuration of VLSI arrays in the presence of defects
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 694-717
%K computer systems

%A Catriel Beeri
%A Moshe Y. Vardi
%T A proof procedure for data dependencies
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 718-741
%K database theory

%A Stavros S. Cosmadakis
%A Christos H. Papadimitriou
%T Updates of relational views
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 742-760
%K database theory

%A Tomasz Imielinski
%A Witold Lipski,\ Jr.
%T Incomplete information in relational databases
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 761-791
%K database theory

%A A. Bojanczyk
%T Optimal asynchronous Newton method
for the solutions of nonlinear equations
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 792-803
%K numerical computation

%A P.-J. Courtois
%A P. Semal
%T Bounds for the positive eigenvectors of nonnegative matrices
and for their approximations by decomposition
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 804-825
%K numerical computation

%A A.R. Calderbank
%A E.G. Coffman,\ Jr.
%A L. Flatto
%T Optimum head separation in a disk system with two read/write heads
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 826-838
%K system modeling and analysis

%A Benjamin Melamed
%A Micha Yadin
%T Numerical computation of sojourn-time distributions
in queuing networks
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 839-854
%K system modeling and analysis

%A Debasis Mitra
%A P.J. Weinberger
%T Probabilistic models of database locking:
solutions, computational algorithms, and asymptotics
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 855-878
%K system modeling and analysis

%A P.A. Bloniarz
%A H.B. Hunt,\ III
%A D.J. Rosenkrantz
%T Algebraic structures with hard equivalence and minimization problems
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 879-904
%K theory of computation

%A J. Pachi
%A E. Korach
%A D. Rotem
%T Lower bounds for distributed maximum-finding algorithms
%J Journal of the ACM
%K jacm
%V 31
%N 4
%D October 1984
%P 905-918
%K theory of computation