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

[277] J. H. Reif, ed., SynthesisofParallelAlgorithms, Morgan Kaufmann, San Mateo, CA, 1993.
[278] J. H. Reif and S. R. Tate, “Optimal Size Integer Division Circuits,” Proc. 21stAnn.ACMSymp.
TheoryofComputing(1989), 264-273.
[279] R. Reischuk, “Improved Bounds on the Problem of Time-Space Trade-off in the Pebble Game,”
JACM 27 (1980), 839-849.
[280] H. G. Rice, “Classes of Recursively Enumerable Sets and Their Decision Problems,” Trans. AMS
74 (1953), 358-366.
[281] J. Riordan and C. E. Shannon, “The Number of Two-Terminal Series-Parallel Networks,” J.Math.
Phys. 21 (1942), 83-93.
[282] A. L. Rosenberg, “Three-Dimensional Integrated Circuitry,” in VLSISystemsandComputations,
H. T. Kung, B. Sproull, and G. Steele, eds., Computer Science Press, Rockville, MD, 1981, 69-80.
[283] A. L. Rosenberg, “Three-Dimensional VLSI: A Case Study,” JACM 30 (1983), 397-416.
[284] C. Savage, “A Systolic Design for Connectivity Problems,” IEEETrans.Computers C-33 (1984),
99-104.
[285] J. E. Savage, “The Complexity of Decoders - Part II: Computational Work and Decoding Time,”
IEEETrans. Inf.Theory IT-17 (1971), 77-84.
[286] J. E. Savage, “Computational Work and Time on Finite Machines,” JACM 19 (1972), 660-674.
[287] J. E. Savage, TheComplexityofComputing, John Wiley & Sons, New York, 1976.
[288] J. E. Savage, “Planar Circuit Complexity and the Performance of VLSI Algorithms,” in VLSISys-
tems and Computations, H. T. Kung, B. Sproull, and G. Steele, eds., Computer Science Press,
Rockville, MD, 1981, 61-68.
[289] J. E. Savage, “Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Mod-
els,” J.Comp.SystemsSci.(1981), 230-242.
[290] J. E. Savage, “Multilective Planar Circuit Size,” Proc. 20thAnn. AllertonConf. onCommunica-
tion,Control,andComputing(1982), 665-671.
[291] J. E. Savage, “The Performance of Multilective VLSI Algorithms,” J. Comp. Systems Sci. 29
(1984), 243-273.
[292] J. E. Savage, “Space-Time Tradeoffs for Banded Matrix Problems,” JACM 31 (1984), 422-437.
[293] J. E. Savage and S. Swamy, “Space-Time Tradeoffs on the FFT Algorithm,” IEEETrans. Info.Th.
IT-24 (1978), 563-568.
[294] J. E. Savage and S. Swamy, “Space-Time Tradeoffs for Oblivious Integer Multiplication,” in Au-
tomata,LanguagesandProgramming, H. A. Maurer, ed., Springer-Verlag, Lecture Notes in Com-
puter Science, 71, Berlin, Heidelberg, and New York, 1979, 498-504.
[295] J. E. Savage, “Extending the Hong-Kung Model to Memory Hierarchies,” in Computing and
Combinatorics, Ding-Zhu Du and Ming Li, eds., Springer-Verlag, Lecture Notes in Computer
Science, 959 , 1995, 270-281.
[296] J. E. Savage and J. S. Vitter, “Parallelism in Space-Time Tradeoffs,” in VLSI: Algorithms and
Architectures, P. Bertolazzi and F. Luccio, eds., Elsevier Science Publishers (North Holland), 1985,
49-58.
[297] W. J. Savitch, “Relationships Between Nondeterministic and Deterministic Tape Complexities,” J.
Comp.SystemsSci.4 (1970), 177-192.
[298] W. J. Savitch and M. J. Stimson, “Time-Bounded Random Access Machines with Parallel Process-
ing,” JACM 26 (1979), 103-118.