Journal of the ACM -- 1966
- B.
W. Arden, B. A.
Galler, T. C. O'Brien,
and F. H. Westervelt.
Program and addressing structure in a time-sharing environment.
Journal of the ACM, 13(1):1-16, January 1966.
References
and Citations.
[BibTeX entry]
- A. P. Yershov. ALPHA -- an
automatic programming system of high efficiency. Journal of the
ACM, 13(1):17-24, January 1966.
[BibTeX entry]
- J. Schwartz. Large parallel
computers. Journal of the ACM, 13(1):25-32, January 1966.
[BibTeX entry]
- A.
Gill. Realization of input-output relations by sequential machines.
Journal of the ACM, 13(1):33-42, January 1966.
[BibTeX entry]
- L.
P. Horwitz, R. M.
Karp, R. E.
Miller, and S.
Winograd. Index register allocation. Journal of the
ACM, 13(1):43-61, January 1966.
Citations.
[BibTeX entry]
- Seymour Ginsburg and Joseph Ullian. Ambiguity in
context free languages. Journal of the ACM, 13(1):62-89,
January 1966.
References
and Citations.
[BibTeX entry]
- Philip Gilbert. On the syntax of
algorithmic languages. Journal of the ACM, 13(1):90-107,
January 1966.
References.
[BibTeX entry]
- Charles B. Dunham. Convergence
problems in Maehly's second method: Part II. Journal of the
ACM, 13(1):108-113, January 1966.
References.
[BibTeX entry]
- George D. Byrne and Robert J. Lambert.
Pseudo-Runge-Kutta methods involving two points. Journal of the
ACM, 13(1):114-123, January 1966.
References
and Citations.
[BibTeX entry]
- R.
N. Maddison. A procedure for nonlinear least squares refinement in
adverse practical conditions. Journal of the ACM,
13(1):124-134, January 1966.
[BibTeX entry]
- C.
A. Barlow, Jr. and E. L.
Jones. A method for the solution of roots of a nonlinear equation
and for solution of the general eigenvalue problem. Journal of the
ACM, 13(1):135-142, January 1966.
[BibTeX entry]
- Takao
Tsuda and Hiroshi
Matsumoto. A note on linear extrapolation of multivariable functions
by the Monte Carlo method. Journal of the ACM,
13(1):143-150, January 1966.
Citations.
[BibTeX entry]
- Michael A. Harrison. On
asymptotic estimates in switching and automata theory. Journal of
the ACM, 13(1):151-157, January 1966.
References.
[BibTeX entry]
- Arto Salomaa. Two complete axiom
systems for the algebra of regular events. Journal of the
ACM, 13(1):158-169, January 1966.
References
and Citations.
[BibTeX entry]
- Charles Trauth, Jr..
Group-type automata. Journal of the ACM, 13(1):170-175,
January 1966.
References
and Citations.
[BibTeX entry]
Volume 13, Number 2, April 1966
- Leonard Kleinrock. Sequential
processing machines (S.P.M) analyzed with a queuing theory model.
Journal of the ACM, 13(2):179-193, April 1966.
Citations.
[BibTeX entry]
- Ruth
A. Weiss. BE VISION, a package of IBM 7090 FORTRAN programs to draw
orthographic views of combinations of plane and quadric surfaces.
Journal of the ACM, 13(2):194-204, April 1966.
Citations.
[BibTeX entry]
- John
T. Welch, Jr.. A mechanical analysis of the cyclic structure of
undirected linear graphs. Journal of the ACM,
13(2):205-210, April 1966.
Citations.
[BibTeX entry]
- C. V. Ramamoorthy. Analysis of
graphs by connectivity considerations. Journal of the ACM,
13(2):211-222, April 1966.
References
and Citations.
[BibTeX entry]
- Stephen A. Cook. The solvability
of the derivability problem for one-normal systems. Journal of the
ACM, 13(2):223-225, April 1966.
References.
[BibTeX entry]
- Ward Douglas Maurer. A
theory of computer instructions. Journal of the ACM,
13(2):226-235, April 1966.
[BibTeX entry]
- Kojiro Kobayashi and Shigeru Sekiguchi. On the
class of predicates decidable by two-way multitape finite automata.
Journal of the ACM, 13(2):236-261, April 1966.
References.
[BibTeX entry]
- Howard Holtz and C. T. Leondes. The synthesis of
recursive digital filters. Journal of the ACM,
13(2):262-280, April 1966.
References.
[BibTeX entry]
- Marvin Minsky and Seymour Papert. Unrecognizable
sets of numbers. Journal of the ACM, 13(2):281-286, April
1966.
References
and Citations.
[BibTeX entry]
- Riaz
A. Usmani. Boundary value techniques for the numerical solution of
certain initial value problems in ordinary differential equations.
Journal of the ACM, 13(2):287-295, April 1966.
[BibTeX entry]
- Philip Rabinowitz. Numerical
experiments in conformal mapping by the method of orthonormal
polynomials. Journal of the ACM, 13(2):296-303, April 1966.
[BibTeX entry]
- W. W.
Bledsoe. Some results on multicategory pattern recognition.
Journal of the ACM, 13(2):304-316, April 1966.
[BibTeX entry]
Volume 13, Number 3, July 1966
- B. Krishnamoorthi and Roger C. Wood. Time-shared
computer operations with both interarrival and service times
exponential. Journal of the ACM, 13(3):317-338, July 1966.
References
and Citations.
[BibTeX entry]
- Lewis T. Reinwald and Richard M. Soland. Conversion
of limited-entry decision tables to optimal computer programs I: Minimum
average processing time. Journal of the ACM, 13(3):339-358,
July 1966.
References
and Citations.
[BibTeX entry]
- Philip K. Hooper. Monogenic Post
normal systems of arbitrary degree. Journal of the ACM,
13(3):359-363, July 1966.
[BibTeX entry]
- Seymour Ginsburg and Joseph Ullian. Preservation of
unambiguity and inherent ambiguity in context-free languages.
Journal of the ACM, 13(3):364-368, July 1966.
References
and Citations.
[BibTeX entry]
- Sigmund N. Porter. Use of
multiwrite for general programmability of search memories. Journal
of the ACM, 13(3):369-373, July 1966.
References.
[BibTeX entry]
- Fred
T. Krogh. Predictor-corrector methods of high order with improved
stability characteristics. Journal of the ACM,
13(3):374-385, July 1966.
References
and Citations.
[BibTeX entry]
- Bruce A. Chartres. Automatic
controlled precision calculations. Journal of the ACM,
13(3):386-403, July 1966.
References
and Citations.
[BibTeX entry]
- M. Donald MacLaren. Internal
sorting by radix plus sifting. Journal of the ACM,
13(3):404-411, July 1966.
References.
[BibTeX entry]
- John
S. Bailey. Generalized single-ended counters. Journal of the
ACM, 13(3):412-418, July 1966.
References.
[BibTeX entry]
- William T. Weeks. Numerical
inversion of Laplace transforms using Laguerre functions. Journal
of the ACM, 13(3):419-429, July 1966.
Citations.
[BibTeX entry]
- R.
W. Hamming and R. S.
Pinkham. A class of integration formulas. Journal of the
ACM, 13(3):430-438, July 1966.
[BibTeX entry]
- Ivan Erdelyi. On the ``reverse
order law'' related to the generalized inverse of matrix products.
Journal of the ACM, 13(3):439-443, July 1966.
References.
[BibTeX entry]
- D. L.
Overheu. An abstract machine for symbolic computation. Journal
of the ACM, 13(3):444-468, July 1966.
References.
[BibTeX entry]
- Franco Mileto and Gianfranco Putzolu.
Corrigenda: ``Statistical complexity of algorithms for Boolean function
minimization''. Journal of the ACM, 13(3):469, July 1966.
References.
[BibTeX entry]
Volume 13, Number 4, October 1966
- Azriel Rosenfeld and John L. Pfaltz. Sequential
operations in digital picture processing. Journal of the
ACM, 13(4):471-494, October 1966.
References
and Citations.
[BibTeX entry]
- E. K.
Blum. A formal system for differentiation. Journal of the
ACM, 13(4):495-504, October 1966.
[BibTeX entry]
- Edward B. Anders. An extension
of Romberg integration procedures to N-variables.
Journal of the ACM, 13(4):505-510, October 1966.
References.
[BibTeX entry]
- Satya
D. Dubey. Statistical determination of certain mathematical
constants and functions using computers. Journal of the
ACM, 13(4):511-525, October 1966.
[BibTeX entry]
- Junichi Toyoda, Yoshikazu Tezuka, and Yoshiro Kasahara. Analysis
of the address assignment problem for clustered keys. Journal of
the ACM, 13(4):526-532, October 1966.
[BibTeX entry]
- F. C.
Hennie and R. E.
Stearns. Two-tape simulation of multitape Turing machines.
Journal of the ACM, 13(4):533-546, October 1966.
References
and Citations.
[BibTeX entry]
- Gregory J. Chaitin. On the
length of programs for computing finite binary sequences. Journal
of the ACM, 13(4):547-569, October 1966.
Citations.
[BibTeX entry]
- Rohit J. Parikh. On context-free
languages. Journal of the ACM, 13(4):570-581, October 1966.
References
and Citations.
[BibTeX entry]
- Sheila A. Greibach. The
unsolvability of the recognition of linear context-free languages.
Journal of the ACM, 13(4):582-587, October 1966.
References
and Citations.
[BibTeX entry]
- Thomas N. Hibbard and Joseph Ullian. The independence
of inherent ambiguity from complementedness among context-free
languages. Journal of the ACM, 13(4):588-593, October 1966.
References
and Citations.
[BibTeX entry]
- Philip K. Hooper. The
immortality problem for Post normal systems. Journal of the
ACM, 13(4):594-599, October 1966.
[BibTeX entry]
- H.
Shaw. Discrete analogs for continuous filters. Journal of the
ACM, 13(4):600-604, October 1966.
[BibTeX entry]
- C. D.
Negron. Digital one-third octave spectral analysis. Journal of
the ACM, 13(4):605-614, October 1966.
[BibTeX entry]
- J. S.
Mamelak. The placement of computer logic modules. Journal of
the ACM, 13(4):615-629, October 1966.
References.
[BibTeX entry]
Shortcuts: