@article{Valiant/75,
AUTHOR = {Valiant, L.G.},
TITLE = {Regularity and related problems for deterministic pushdown automata},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {1-10},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hsu/75,
AUTHOR = {Hsu, H.T.},
TITLE = {An algorithm for finding a minimal equivalent graph of a digraph},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {11-16},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yu/75,
AUTHOR = {Yu, C.T.},
TITLE = {A formal construction of term classes},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {17-37},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Horowitz-Sahni/75,
AUTHOR = {Horowitz, E. and Sahni, S.},
TITLE = {On computing the exact determinant of matrices with polynomial entries},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {38-50},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Micchelli-Miranker/75,
AUTHOR = {Micchelli, C.A. and Miranker, W.L.},
TITLE = {High order search methods for finding roots},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {51-60},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Rice/75,
AUTHOR = {Rice, J.R.},
TITLE = {A metalgorithm for adaptive quadrature},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {61-82},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fuller-Baskett/75,
AUTHOR = {Fuller, S.H. and Baskett, F.},
TITLE = {An analysis of drum storage units},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {83-105},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kohler-Steiglitz/75,
AUTHOR = {Kohler, Walter H. and Steiglitz, Kenneth},
TITLE = {Exact, approximate, and guaranteed accuracy algorithms for the flow-shop problem $n|2|F|\bar F$},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {106-114},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sahni/75,
AUTHOR = {Sahni, S.},
TITLE = {Approximate algorithms for the 0/1 knapsack problem},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {115-124},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Wright/75,
AUTHOR = {Wright, J.W.},
TITLE = {The change-making problem},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {125-128},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Boyer-Moore/75,
AUTHOR = {Boyer, R.S. and Moore, J.S.},
TITLE = {Proving theorems about LISP functions},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {129-144},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yelowitz/75,
AUTHOR = {Yelowitz, L.},
TITLE = {Derivation of a path-connectivity matrix for tagged flowcharts},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {145-154},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ladner/75a,
AUTHOR = {Ladner, Richard E.},
TITLE = {On the structure of polynomial time reducibility},
JOURNAL = {J. ACM},
VOLUME = {22},
NUMBER = {1},
PAGES = {155-171},
YEAR = {1975, January},
KEYWORDS = {polynomial time computation, Turing reducibility, many-one reducibility},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lowrance-Wagner/75,
AUTHOR = {Lowrance, R. and Wagner, R.A.},
TITLE = {An extension of the string-to-string correction problem},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {177-183},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Morgenstern/75,
AUTHOR = {Morgenstern, J.},
TITLE = {The linear complexity of computation},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {184-194},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Muller-Preparata/75,
AUTHOR = {Muller, D.E. and Preparata, F.P.},
TITLE = {Bounds to complexities of networks for sorting and for switching},
JOURNAL = {J. ACM},
VOLUME = {22},
NUMBER = {2},
PAGES = {195-201},
YEAR = {1975, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Perl-Garey-Even/75,
AUTHOR = {Perl, Y. and Garey, M.R. and Even, S.},
TITLE = {Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {202-214},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Tarjan/75,
AUTHOR = {Tarjan, R.E.},
TITLE = {Efficiency of a good but not linear set union algorithm},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {215-225},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Knauer/75,
AUTHOR = {Knauer, B.},
TITLE = {A simple planarity criterion},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {226-230},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Babad/75,
AUTHOR = {Babad, J.M.},
TITLE = {A generalized multi-entrance time-sharing priority queue},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {231-247},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Baskett-Chandy-Muntz-Palacios/75,
AUTHOR = {Baskett, F. and Chandy, K.M. and Muntz, R.R. and Palacios, F.G.},
TITLE = {Open, closed, and mixed networks of queues with different classes of customers},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {248-260},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gelenbe/75,
AUTHOR = {Gelenbe, E.},
TITLE = {On approximate computer system models},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {261-269},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hofri-Yadin/75,
AUTHOR = {Hofri, M. and Yadin, M.},
TITLE = {A processor in series with demand-interrupting devices -- a stochastic model},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {270-290},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Musser/75,
AUTHOR = {Musser, David R.},
TITLE = {Multivariate polynomial factorization},
JOURNAL = {J. ACM},
VOLUME = {22},
NUMBER = {2},
PAGES = {291-308},
YEAR = {1975, April},
KEYWORDS = {factorization, polynomials, Hensel's lemma, finite fields, modular arithmetic},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Schank-Goldman-Rieger-Riesbeck/75,
AUTHOR = {Schank, R.C. and Goldman, N.M. and Rieger III, C.J. and Riesbeck, C.K.},
TITLE = {Inference and paraphrase by computer},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {309-328},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chaitin/75,
AUTHOR = {Chaitin, G.J.},
TITLE = {A theory of program size formally identical to information theory},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {329-340},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lynch/75a,
AUTHOR = {Lynch, N.},
TITLE = {On reducibility to complex or sparse sets},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {341-345},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Manacher/75,
AUTHOR = {Manacher, G.},
TITLE = {A new linear-time ``on-line'' algorithm for finding the smallest initial palindrome of a string},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {346-351},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Goodman-Hedetniemi-Slater/75,
AUTHOR = {Goodman, S.E. and Hedetniemi, S.T. and Slater, P.J.},
TITLE = {Advances on the Hamiltonian completion problem},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {352-360},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Pfaltz/75,
AUTHOR = {Pfaltz, J.L.},
TITLE = {Representing graphs by Knuth trees},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {361-366},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Elias-Flower/75,
AUTHOR = {Elias, P. and Flower, R.A.},
TITLE = {The complexity of some simple retrieval problems},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {367-379},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Dressler-Parker/75,
AUTHOR = {Dressler, R.E. and Parker, T.},
TITLE = {Primes with a prime subscript},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {380-381},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bruno-Lassagne/75,
AUTHOR = {Bruno, J.L. and Lassagne, T.},
TITLE = {The generation of optimal code for stack machines},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {382-396},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Oney/75,
AUTHOR = {Oney, W.C.},
TITLE = {Queueing analysis of the scan policy for moving-head disks},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {397-412},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ross-Klingman-Napier/75,
AUTHOR = {Ross, G.T. and Klingman, D. and Napier, A.},
TITLE = {A computational study of the effects of problem dimensions on solution times for transportation problems},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {413-424},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Svoboda/75,
AUTHOR = {Svoboda, A.},
TITLE = {The concept of term exclusiveness and its effect on the theory of Boolean functions},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {425-440},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Easton-Wong/75,
AUTHOR = {Easton, M.C. and Wong, C.K.},
TITLE = {The effect of a capacity constraint on the minimal cost of a partition},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {441-449},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Horowitz/75,
AUTHOR = {Horowitz, E.},
TITLE = {A sorting algorithm for polynomial multiplication},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {450-462},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ibarra-Kim/75,
AUTHOR = {Ibarra, Oscar H. and Kim, Chul E.},
TITLE = {Fast approximation algorithms for the knapsack and sum of subset problems},
JOURNAL = {J. ACM},
VOLUME = {22},
NUMBER = {4},
PAGES = {463-468},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kung-Luccio-Preparata/75,
AUTHOR = {Kung, H.T. and Luccio, F. and Preparata, F.},
TITLE = {On finding the maxima of a set of vectors},
JOURNAL = {J. ACM},
VOLUME = {22},
NUMBER = {4},
PAGES = {469-476},
YEAR = {1975, October},
KEYWORDS = {maxima of a set of vectors, computational complexity, number of comparisons},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Winograd/75,
AUTHOR = {Winograd, S.},
TITLE = {On the parallel evaluation of certain arithmetic expressions},
JOURNAL = {J. ACM},
VOLUME = {22},
NUMBER = {4},
PAGES = {477-492},
YEAR = {1975, October},
KEYWORDS = {parallelism, arithmetic expression, Horner expressions, continued fraction, computational complexity},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bertsch/75,
AUTHOR = {Bertsch, E.},
TITLE = {An observation on relative parsing time},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {493-498},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sudborough/75,
AUTHOR = {Sudborough, I.H.},
TITLE = {A note on tape-bounded complexity classes and linear context-free languages},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {499-500},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Dass/75,
AUTHOR = {Dass, B.K.},
TITLE = {A sufficient bound for codes correcting bursts with weight constraint},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {501-503},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Cash/75,
AUTHOR = {Cash, J.R.},
TITLE = {A class of implicit Runge-Kutta methods for the numerical integration of stiff ordinary differential equations},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {504-511},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Miller/75,
AUTHOR = {Miller, W.},
TITLE = {Computer search for numerical instability},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {512-521},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Krause-Shen-Schwetman/75,
AUTHOR = {Krause, K.L. and Shen, V.Y. and Schwetman, H.D.},
TITLE = {Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {522-550},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
NOTE = {see Errata in J.ACM 24. 527-528},
}
@article{Hayes/75,
AUTHOR = {Hayes, J.P.},
TITLE = {The fanout structure of switching functions},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {551-571},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kowalski/75,
AUTHOR = {Kowalski, R.},
TITLE = {A proof procedure using connection graphs},
JOURNAL = {J. ACM},
VOLUME = {22},
PAGES = {572-595},
YEAR = {1975},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Jump-Thiagarajan/75,
AUTHOR = {Jump, J. Robert and Thiagarajan, P.S.},
TITLE = {On the interconnection of asynchronous control structures},
JOURNAL = {J. ACM},
VOLUME = {22},
NUMBER = {4},
PAGES = {596-612},
YEAR = {1975, October},
KEYWORDS = {asynchronous control structure, asynchronous control system, interconnected systems},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}