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

Bibliography

[1] H. Abelson, “Lower Bounds on Information Transfer in Distributed Computations,” 19thAnn.
IEEESymp.FoundationsofComputerScience(1978 ), 151-158.
[2] H. Abelson, “A Note on Time-Space Tradeoffs for Computing Continuous Functions,” Inf. Proc.
Letters 8 (1979), 215-217.
[3] H. Abelson and P. Andreae, “Information Transfer and Area-Time Tradeoffs for VLSI Multiplica-
tion,” Comm.ACM 23 (1980), 20-23.
[4] K. Abrahamson, “Time-Space Tradeoffs for Branching Programs Contrasted with Those for Straight-
Line Programs,” Proc.27thAnn.IEEESymp.FoundationsofComputerScience(1986), 402-409.
[5] K. Abrahamson, “A Time-Space Tradeoff for Boolean Matrix Multiplication,” Proc. 31st Ann.
IEEESymp.FoundationsofComputerScience(1990), 412-419.
[6] K. Abrahamson, “Time-Space Tradeoffs for Algebraic Problems on General Sequential Machines,”
J.Comp.SystemsSci. 43 (1991), 269-289.
[7] A. Aggarwal, B. Alpern, A. Chandra, and M. Snir, “A Model for Hierarchical Memory,” Proc.19th
Ann.ACMSymp.TheoryofComputing(1987), 305-314.
[8] A. Aggarwal, A. Chandra, and M. Snir, “Hierarchical Memory with Block Transfer,” Proc. 28th
Ann. IEEESymp.FoundationsofComputerScience(1987), 204-216.
[9] A. Aggarwal and J. S. Vitter, “The Input/Output Complexity of Sorting and Related Problems,”
Comm.ACM 31 (1988), 1116-1127.
[10] A. V. Aho, J. E. Hopcroft, and J. D. Ullman, TheDesignandAnalysis ofComputerAlgorithms,
Addison-Wesley, Reading, MA, 1974.
[11] A. V. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques and Tools, Addison-
Wesley, Reading, MA, 1986.
[12] A. V. Aho, J. D. Ullman, and M. Yannakakis, “On Notions of Information Transfer in VLSI
Circuits,” 15thAnn.ACMSymp.TheoryofComputing(1983), 133-139.
[13] M. Ajtai, “ Σ

1 -Formulae on Finite Structures,” Ann.PureandAppliedLogic 24 (1983), 1-48.

605