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

[82] L. Csanky, “Fast Parallel Matrix Inversion,” SIAMJ.Comput.5 (1976), 618-623.
[83] D.E.Culler,R.M.Karp,D.Patterson,A.Sahay,E.E.Santos,K.E.Schauser,R.Subramonian,
and T. von Eicken, “LogP: A Practical Model of Parallel Computation,” Comm.ACM 39 (1996),
78-85.
[84] R. Cypher and G. Plaxton, “Deterministic Sorting in Nearly Logarithmic Time on the Hypercube
and Related Computers,” Proc.22ndAnn.ACMSymp.TheoryofComputing(1990), 193-203.
[85] E. Dekel, D. Nassimi, and S. Sahni, “Parallel Matrix and Graph Algorithms,” SIAMJ.Comput.
10 (1981), 657-675.
[86] E. Demenkov, A. Kojevnikov, A. S. Kulikov, and G. Yaroslavtsev, “New Upper Bounds on the
Boolean Circuit Complexity of Symmetric Functions,” InformationProcessingLetters110 (2010),
264-267.
[87] P. E. Dunne, “Lower Bounds on the Monotone Network Complexity of Threshold Functions,”
Proc.22ndAnn.AllertonConf.Communication,ControlandComputing(1984), 911-920.
[88] P. E. Dunne, “Techniques for the Analysis of Monotone Boolean Networks,” University of War-
wick, Ph.D. Dissertation, Theory of Computation Report No. 69, Coventry, England, 1984.
[89] P. E. Dunne, “The Complexity of Central Slice Functions,” Theoret.Comp.Sci. 44 (1986), 247-
257.
[90] P. E. Dunne, “On Monotone Simulations of Non-monotone Networks,” Theoret.Comp.Sci. 66
(1989), 15-25.
[91] P. E. Dunne, “Relationships Between Monotone and Non-monotone Network Complexity,” in
BooleanFunctionComplexity, M. S. Paterson, ed., London Math. Soc., Lecture Note Series 169,
Cambridge University Press, Cambridge, 1992, 1-24.
[92] P. E. Dunne, TheComplexityofBooleanNetworks, Academic Press, London, 1988.
[93] P. Duris and Z. Galil, “On the Power of Multiple Reads in a Chip,” Info.andControl 104 (1993),
277-287.
[94] J. Earley, “An Efficient Context-Free Parsing Algorithm,” Comm.ACM 13 (1970), 94-102.
[95] D. M. Eckstein, “Simultaneous Memory Access,” Computer Science Dept., Iowa State University,
TR-79-6, Ames, IA, 1979.
[96] J. Edmonds, “Paths, Trees, Flowers,” Canad. J.Math. 17 (1965), 449-467.
[97] J. Evey, “Application of Pushdown Store Machines,” Proc.AFIPSFJCC (1963), 215-217.
[98] D. K. Faddeev and V. N. Faddeeva, ComputionalMethodsinLinearAlgebra,W.H.Freeman,San
Francisco, 1963.
[99] C. N. Fischer and R. J. Le Blanc, Jr., CraftingaCompiler, Benjamin/Cummings, Menlo Park, CA,
1988.
[100] M. J. Fischer, “The Complexity of Negation-Limited Networks - A Brief Survey,” in Automata
Theory and Formal Languages, H. Brakhage, ed., Springer-Verlag, Lecture Notes in Computer
Science, 33, Berlin, Heidelberg, and New York, 1975, 71-82.
[101] M. J. Fischer, A. R. Meyer, and M. S. Paterson, “ Ω( n log n ) Lower Bounds on Length of Boolean
Formulas,” SIAMJ.Comput.11 (1982), 416-427.
[102] M. J. Flynn, “Very High-Speed Computing Systems,” Proc. IEEE 54 (1966), 1901-1909.
[103] S. Fortune and J. Wyllie, “Parallelism in Random Access Machines,” Proc.10thAnn.ACMSymp.
TheoryofComputing(1978), 114-118.
[104] M. J. Foster and H. T. Kung, “The Design of Special-Purpose VLSI Chips,” Computer 13 (1980),
26-40.