Bibliography - Models of Computation: Exploring the Power of Computing - page 608

[59] R. P. Brent and H. T. Kung, “The Area-Time Complexity of Binary Multiplication,” JACM 28
(July 1981), 521-534.
[60] R. E. Bryant, “Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams,” ACM
Comput.Surveys 24 (1992), 293-318.
[61] D. A. Carlson, “Time-Space Tradeoffs for Back-to-Back FFT Algorithms,” IEEETrans.Computers
C-32 (1983), 585-589.
[62] D. A. Carlson, “Time-Space Efficient Algorithms for Computing Convolutions and Related Prob-
lems,” Info.andComputation 75 (1987), 1-14.
[63] D. A. Carlson, “Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Em-
bedded Fast Fourier Transforms,” SIAMJ.Discr.Math. 1 (1988), 22-37.
[64] D. A. Carlson and J. E. Savage, “Extreme Time-Space Tradeoffs for Graphs with Small Space
Requirements,” Inf.Proc.Letters 14 (1982), 223-227.
[65] D. A. Carlson and J. E. Savage, “Size-Space Tradeoffs for Oblivious Computations,” J. Comp.
SystemsSci. 2 (1983), 65-81.
[66] A. K. Chandra, “Efficient Compilation of Linear Recursive Programs,” Proc. 14th Ann. IEEE
Symp.SwitchingandAutomataTheory(1973), 16-25.
[67] B. Chazelle and L. Monier, “A Model of Computation for VLSI with Related Complexity Results,”
JACM 32 (1985), 573-588.
[68] N. Chomsky, “Three Models for the Description of Languages,” PGIT 2 (1956), 113-124.
[69] N. Chomsky, “On Certain Formal Properties of Grammars,” Info. and Control 2 (1959), 137-
167.
[70] N. Chomsky, “Context-Free Grammar and Pushdown Storage,” MIT Research Laboratory in Elec-
tronics, Quarterly Progress Report, Cambridge, MA, 1965.
[71] N. Chomsky and G. A. Miller, “Finite-State Languages,” Info.andControl 1 (1958), 91-112.
[72] A. Church, “An Unsolvable Problem of Elementary Number Systems,” Amer. J.Math. 58 (1936),
345-363.
[73] A. Cobham, “The Recognition Problem for the Set of Perfect Squares,” IEEE 7th Ann. IEEE
Symp.SwitchingAutomataTheory(1966), 78-87.
[74] S. A. Cook, “The Complexity of Theorem-Proving Procedures,” Proc.3rdAnn.ACMSymp.The-
oryofComputing(1971), 151-158.
[75] S. A. Cook, “An Observation on Time-Storage Trade Off,” Proc.5thAnn.Symp.TheoryofCom-
puting(1973), 29-33.
[76] S. A. Cook, “Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log
Squared Space,” Proc.11thAnn.ACMSymp.TheoryofComputing(1979), 338-345.
[77] S. A. Cook and R. A. Reckhow, “Time-Bounded Random Access Machines,” J. Comp. Systems
Sci. 7 (1973), 354-475.
[78] S. A. Cook and R. Sethi, “Storage Requirements for Deterministic Polynomial Finite Recognizable
Languages,” J.Comp.SystemsSci. 13 (1976), 25-37.
[79] S. A. Cook, “An Observation on Time-Storage Trade Off,” J.Comp.SystemsSci. 9 (1974), 308-
316.
[80] J. W. Cooley and J. W. Tukey, “An Algorithm for the Machine Calculation of Complex Fourier
Series,” Math.Computation 19 (1965), 297-301.
[81] D. Coppersmith and S. Winograd, “Matrix Multiplication via Arithmetic Progressions,” J. Sym-
bolicComputing 9 (1990), 251-280.