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

[127] J. Hartmanis, P. M. Lewis II, and R. E. Stearns, “Hierarchies of Memory-Limited Computations,”
Proc.6thAnn.Symp.SwitchingCircuitTheoryandLogicDesign(1965), 179-190.
[128] J. Hartmanis and R. E. Stearns, “On the Computational Complexity of Algorithms,” Trans. AMS
117 (1965), 285-306.
[129] P. J. Hatcher and M. J. Quinn, Data-Parallel Programming onMIMDComputers, MIT Press,
Cambridge, MA, 1991.
[130] M. T. Heideman, D. H. Johnson, and C. S. Burrus, “Gauss and the History of the Fast Fourier
Transform,” Arch.Hist.ExactSci.34 (1985), 265-277.
[131] C. A. Heintz, LRI, Univ. Paris-Sud, On the Area Required for Matrix Multiplication with VLSI
Algorithms, Orsay, France, 1981.
[132] J. Hennessy and D. Patterson, ComputerArchitecture—AQuantitativeApproach,MorganKauf-
mann, San Mateo, CA, 1990.
[133] W. D. Hillis and G. L. Steele, Jr., “Data-Parallel Algorithms,” Comm. ACM 29 (1986), 1170-
1183.
[134] P. Hochschild, “Multiple Cuts, Input Repetition, and VLSI Complexity,” Info.ProcessingLetters
24 (1987), 19-24.
[135] R. W. Hockney and C. R. Jesshope, ParallelComputers, Adam Hilger, Bristol, 1981.
[136] L. Hodes and E. Specker, “Length of Formulas and Elimination of Quantifiers I,” in Contribu-
tions toMathematical Logic,H.A.Schmidt,K.Schutte,andJ.-J.Thiele,eds.,North-Holland,
Amsterdam, 1968, 175-188.
[137] J. -W. Hong and H. T. Kung, “I/O Complexity: The Red-Blue Pebble Game,” Proc. 13thAnn.
ACMSymp.TheoryofComputing(1981), 326-333.
[138] H. J. Hoover, M. M. Klawe, and N. J. Pippenger, “Bounding Fan-Out in Logical Networks,”
JACM 31 (1984), 13-18.
[139] J. E. Hopcroft, “An n log n Algorithm for Minimizing States in a Finite Automaton,” in Theory
of Machines and Computations, Z. Kohavi and A. Paz, eds., Academic Press, New York, 1971,
189-196.
[140] J. E. Hopcroft, W. J. Paul, and L. G. Valiant, “On Time Versus Space,” JACM24 (1977), 332-337.
[141] J. E. Hopcroft and J. D. Ullman, IntroductiontoAutomataTheory,Languages,andComputation,
Addison-Wesley, Reading, MA, 1979.
[142] J. Hromkovic, “Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear
Separators,” Info.andComputation 95 (1991), 117-128.
[143] J. Hromkovic, “Branching Programs Provide Lower Bounds on the Areas of Multilective Deter-
ministic and Nondeterministic VLSI-Circuits,” Info.ProcessingLetters 95 (1992), 168-178.
[144] D. A. Huffman, “The Synthesis of Sequential Switching Circuits,” J. Franklin Inst. 257 (1954),
161-190, 275-303.
[145] N. Immerman, “Nondeterministic Space is Closed under Complementation,” SIAMJ.Comput.
17 (1988), 935-938.
[146] K. Iverson, AProgrammingLanguage, John Wiley & Sons, New York, 1962.
[147] J. JaJa, “Time-Space Tradeoffs for Some Algebraic Problems,” JACM 30 (1983), 657-667.
[148] J. JaJa, AnIntroductiontoParallelAlgorithms, Addison-Wesley, Reading, MA, 1992.
[149] J. JaJa and V. K. P. Kumar, “Information Transfer in Distributed Computing with Applications to
VLSI,” JACM 31 (January 1984), 150-162.