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

[343] L. G. Valiant, “Graph-Theoretic Properties in Computational Complexity,” J.Comp.SystemsSci.
13 (1976), 278-285.
[344] L. G. Valiant, “Completeness Classes in Algebra,” Proc.11thAnn.ACMSymp.TheoryofCom-
puting(1979), 249-261.
[345] L. G. Valiant, “Reducibility by Algebraic Projections,” L'Enseignement Math. XXVIII (1982),
253-268.
[346] L. G. Valiant, “Short Monotone Formulae for the Majority Function,” J. Algorithms 5 (1984),
363-366.
[347] L. G. Valiant, “Negation is Powerless for Slice Functions,” SIAMJ.Comput.15 (1986), 531-535.
[348] L. G. Valiant, “A Bridging Model for Parallel Computation,” Comm.ACM 33 (1990), 103-111.
[349] P. van Emde Boas and J. van Leeuwen, “Move Rules and Trade-Offs in the Pebble Game,” Vakgroep
Informatica, Univ. Utrecht, Report RUU-CS-78-4, Utrecht, Netherlands, 1978.
[350] P. van Emde Boas, “Machine Models and Simulations,” in Handbook of Theoretical Computer
Science,Vol.A, J. van Leeuwen, ed., Elsevier, Amsterdam, NY, Oxford, Tokyo; MIT Press, Cam-
bridge, MA, 1990, 2-66.
[351] C. C. Van Voorhis, “An Improved Lower Bound for Sorting Networks,” IEEETrans. Computers
C-21 (1972), 612-613.
[352] H. Venkateswaran and M. Tompa, “A New Pebble Game That Characterizes Parallel Complexity
Classes,” SIAMJ.Comput.18 (1989), 53-549.
[353] U. Vishkin, “Implementation of Simultaneous Memory Address Access in Models That Forbid It,”
J.Algorithms 4 (1983), 45-50.
[354] J. S. Vitter and E. A. M. Shriver, “Optimal Disk I/O with Parallel Block Transfer,” Proc. 22nd
Ann.ACMSymp.TheoryofComputing(1990), 159-169.
[355] J. Vuillemin, “A Combinatorial Limit to the Computing Power of VLSI Circuits,” Proc.21stAnn.
IEEESymp.FoundationsofComputerScience(Oct. 13-15, 1980), 294-300.
[356] C. S. Wallace, “A Suggestion for a Fast Multiplier,” IEEETrans.ComputersEC-13 (1964), 14-17.
[357] I. Wegener, “Boolean Functions Whose Monotone Complexity Is of Size n 2 / log n ,” Theoret.
Comp.Sci. 21 (1982), 213-224.
[358] I. Wegener, “On the Complexity of Slice Functions,” Theoret.Comp.Sci.38 (1985), 55-68.
[359] I. Wegener, “Relating Monotone Formula Size and Monotone Depth of Boolean Functions,” Inf.
Proc.Letters 16 (1983), 41-42.
[360] I. Wegener, TheComplexityofBooleanFunctions, Wiley-Teubner, Stuttgart and New York, 1987.
[361] J. Weiss, “An n 3 / 2 Lower Bound on the Monotone Network Complexity of the Boolean Convolu-
tion,” Info.andControl 59 (1983), 184-188.
[362] J. R. Wicks, Linear Algebra: An Interactive Laboratory Approach with Mathematica, Addison
Wesley Longman, Reading, MA, 1996.
[363] R. Wilber, “White Pebbles Help,” J.Comp.SystemsSci.36 (1988), 108-124.
[364] S. Winograd, “On the Algebraic Complexity of Functions,” Actes Congres Int. Math. 3 (1970),
283-288.
[365] M. Wloka, “Parallel VLSI Synthesis,” Dept. of Computer Science, Brown University, CS-91-35,
1991.
[366] A. C-C. Yao, “Some Complexity Questions Related to Distributive Computing,” Proc.11thAnn.
ACMSymp.TheoryofComputing(1979), 209-213.