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

[36] V. E. Benes, “Permutation Groups, Complexes, and Rearrangeable Multistage Connecting Net-
works,” BellSyst.Techn. J. 43 (1964), 1619-1640.
[37] S. Berkowitz, “On Some Relationships Between Monotone and Non-monotone Circuit Complex-
ity,” University of Toronto, Technical Report, 1982.
[38] D. P. Bertsekas and J. N. Tsitsiklis, Parallel andDistributedComputation: NumericalMethods,
Prentice-Hall, Inc., Englewood Cliffs, NJ, 1989.
[39] G. Bilardi, K. T. Herley, A. Pietracaprina, G. Pucci, and P. Spirakis, “BSP vs. LogP,” Proc. 8th
Ann.ACMSymp.ParallelAlgorithmsandArchitectures(1996), 25-32.
[40] G. Bilardi, M. Pracchi, and F. P. Preparata, “A Critique of Network Speed in VLSI Models of
Computation,” IEEEJ.Solid-StateCircuits SC-17 (1982), 696-702.
[41] G. Bilardi and F. P. Preparata, “Area-Time Lower-Bound Techniques with Applications to Sorting,”
Algorithmica 1 (1986), 65-91.
[42] G. Bilardi and F. P. Preparata, “Size-Time Complexity of Boolean Networks for Prefix Computa-
tions,” JACM 36 (1989), 362-382.
[43] G. Bilardi and F. P. Preparata, “Horizons of Parallel Computation,” J. Parallel and Distributed
Computing 27 (1995), 172-182.
[44] D. Bini and V. Y. Pan, PolynomialandMatrixComputations, Birkhauser, Boston, 1994.
[45] G. E. Blelloch, VectorModels forData-ParallelComputing, MIT Press, Cambridge, MA, 1990.
[46] M. Blum, “A Machine-Independent Theory of the Complexity of Recursive Functions,” JACM14
(1967), 322-336.
[47] M. Blum, “On Effective Procedures for Speeding Up Algorithms,” JACM 18 (1971), 290-305.
[48] N. Blum, “A Boolean Function Requiring 3 n Network Size,” Theoret. Comp. Sci. 28 (1984),
337-345.
[49] R. B. Bopanna, “Amplification of Probabilistic Boolean Functions,” in Advances in Computer
Research,Vol.5:RandomnessandComputation, S. Micali, ed., JAI Press, Greenwich, CT, 1989,
27-45.
[50] R. B. Bopanna and M. Sipser, “The Complexity of Finite Functions,” in HandbookofTheoretical
Computer Science, Vol. A,J.vanLeeuwen,ed.,Elsevier,Amsterdam,NY,Oxford,Tokyo;MIT
Press, Cambridge, MA, 1990, 757-804.
[51] A. Borodin, “Computational Complexity and the Existence of Complexity Gaps,” JACM 19
(1972), 158-174.
[52] A. Borodin, “On Relating Time and Space to Size and Depth,” SIAMJ.Comput.6 (1977), 733-
744.
[53] A. Borodin and S. Cook, “A Time-Space Tradeoff for Sorting on a General Sequential Model of
Computation,” SIAMJ.Comput.11 (1982), 287-297.
[54] A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal,andA.Wigderson,“ATime-SpaceTradeoff
for Element Distinctness,” SIAMJ.Comput.16 (1987), 97-99.
[55] A. Borodin, M. J. Fischer, D. G. Kirkpatrick, N. A. Lynch, and M. Tompa, “A Time-Space Tradeoff
for Sorting and Related Non-Oblivious Computations,” J.Comp. Systems Sci. 22 (1981), 351-
364.
[56] A. Borodin and I. Munro, TheComputationalComplexityofAlgebraic andNumericProblems,
American Elsevier, New York, 1975.
[57] R. P. Brent, “On the Addition of Binary Numbers,” IEEETrans.Computers 19 (1970), 758-759.
[58] R. P. Brent, “The Parallel Evaluation of General Arithmetic Expressions,” JACM 21 (1974), 201-
206.