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

[14] M. Ajtai, J. Komlos, and E. Szemeredi, “Sorting in c log n Parallel Steps,” Combinatorica3 (1983),
1-19.
[15] S. B. Akers, “Binary Decision Diagrams,” IEEETrans.Computers C-27 (1978), 509-516.
[16] S. G. Akl, Parallel Computation:Models andMethods,Prentice-Hall,Inc.,UpperSaddleRiver,
NJ, 1997.
[17] N. Alon and R. B. Bopanna, “The Monotone Circuit Complexity of Boolean Functions,” Combi-
natorica 7 (1987), 1-22.
[18] B. Alpern, L. Carter, and E. Feig, “Uniform Memory Hierarchies,” Proc. 31stAnn. IEEESymp.
FoundationsofComputerScience(1990), 600-608.
[19] H. Alt, T. Hagerup, K. Mehlhorn, and F. P. Preparata, “Deterministic Simulation of Idealized
Parallel Computers on More Realistic Ones ,” SIAMJ.Computing 16 (1987).
[20] K. Amano and A. Maruoka, “Potential of the Approximation Method,” Proc. 37th Ann. IEEE
Symp.FoundationsofComputerScience(1996), 431-440.
[21] G. M. Amdahl, “Validity of the Single Processor Approach to Achieving Large Scale Computing
Capabilities,” AFIPSJCC 30 (1967), 483-485.
[22] A. E. Andreev, “On a Method for Obtaining Lower Bounds for the Complexity of Individual
Monotone Functions,” Dokl.Akad.NaukSSSR(SovietMath.Dokl.) 282 (1985), 1033-1037.
[23] A. E. Andreev, “A Family of Boolean Matrices,” Vestnik Moskov. Univ. Mat. 41 (1986), 97-100,
(in Russian); English translation in Moscow University Math. Bull. 41 (2) (1986), 79-82.
[24] A. E. Andreev, “On a Method for Obtaining More Than Quadratic Effective Lower Bounds for
the Complexity of π -Schemes,” VestnikMoskovUniv.Math. 42 (1987), 63-66.
[25] S. Axler, LinearAlgebraDoneRight, Springer, Berlin, Heidelberg, and New York, 1996.
[26] J. Backus, “Can Programming Be Liberated from the von Neumann Style? A Function Style and
Its Algebra of Programs,” Comm.ACM 21 (1978), 613-641.
[27] J. L. Balcazar, J. Dıaz, and J. Gabarro, Structural Complexity I, Springer-Verlag, Berlin, Heidel-
berg, and New York, 1995.
[28] V. Bar-Hillel, M. Perles, and E. Shamir, “On Formal Properties of Simple Phrase-Structure Gram-
mars,” Zeitschr. Phonetik, Sprachwissenschaft und Kommunikationsforschung 14 (1961), 143-
172.
[29] K. E. Batcher, “Sorting Networks and Their Applications,” Proc. AFIPS SJCC 32 (1968), 307-
314.
[30] G. M. Baudet, “On the Area Required by VLSI Circuits,” in VLSISystemsandComputations,H.
T. Kung, B. Sproull, and G. Steele, eds., Computer Science Press, Rockville, MD, 1981, 100-107.
[31] G. M. Baudet, F. P. Preparata, and J. E. Vuillemin, “Area-Time Optimal VLSI Circuits for Convo-
lution,” IEEETrans.onComputers C-32 (July 1983), 684-688.
[32] R. Beals, T. Nishino, and K. Tanaka, “More on the Complexity of Negation-Limited Circuits,”
Proc.27thAnn.ACMSymp.TheoryofComputing(1995), 585-595.
[33] P. W. Beame, S. A. Cook, and H. J. Hoover, “Log Depth Circuits for Division and Related Prob-
lems,” SIAMJ.Comput.15 (1986), 994-1003.
[34] P. Beame, “A General Sequential Time-Space Tradeoff for Finding Unique Elements,” Proc. 21st
Ann.ACMSymp.TheoryofComputing(1989), 197-203.
[35] L. Belady, “A Study of Replacement Algorithms for a Virtual-Store Computer,” IBMSystems J. 5
(1966), 78-101.