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

[321] S. Swamy and J. E. Savage, “Space-Time Tradeoffs for Linear Recursion,” Math. SystemsTheory
16 (1983), 9-27.
[322] R. Szelepscenyi, “The Method of Forcing for Nondeterministic Automata,” Bull. EATCS 33
(1987), 96-100.
[323] K. Tanaka and T. Nishino, “On the Complexity of Negation-Limited Boolean Networks (Prelimi-
nary Version),” Proc.26thAnn.ACMSymp.TheoryofComputing(1994), 38-47.
[324] E. Tardos, “The Gap Between Monotone and Non-Monotone Circuit Complexity is Exponential,”
Combinatorica 8 (1988), 141-142.
[325] S. R. Tate, “Newton Iteration and Integer Division,” in Synthesis ofParallelAlgorithms,JohnH.
Reif, ed., Morgan Kaufmann, San Mateo, CA, 1993.
[326] C. D. Thompson, “Area-Time Complexity for VLSI,” Proc. 11th Ann. ACMSymp. Theory of
Computing(1979), 81-88.
[327] C. D. Thompson, “A Complexity Theory for VLSI,” Dept. Computer Science, Carnegie-Mellon
University, Ph.D. Thesis, 1980.
[328] C. D. Thompson, “Fourier Transforms in VLSI,” IEEE Trans. Computers C-32 (1983), 1047-
1057.
[329] C. D. Thompson, “The VLSI Complexity of Sorting,” IEEE Trans. Computers C-32 (1983),
1171-1184.
[330] J. Tiekenherinrich, “A 4 n Lower Bound on the Monotone Network Complexity of a One-Output
Boolean Function,” Inf.Proc.Letters 18 (1984), 201-202.
[331] M. Tompa, “Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of
Their Circuits,” J.Comp.SystemsSci. 20 (1980), 118-132.
[332] M. Tompa, “Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity
Properties of Their Circuits,” J.Comput.SystemSci. 23 (1981), 106.
[333] M. Tompa, “Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time,
Sublinear Space Implementations,” SIAMJ.Comput.11 (1982), 130-137.
[334] B. A. Trakhtenbrot, “Turing Computations with Logarithmic Delays,” AlgebraiLogika 3 (1964),
33-48.
[335] B. A. Trakhtenbrot, “A Survey of Russian Approaches to Perebor (Brute-Force Search) Algorithms,”
Ann.Hist.ofComput.6 (1984), 384-400.
[336] G. Turan, “Lower Bounds for Synchronous Circuits and Planar Circuits,” Info.ProcessingLetters
30 (1989), 37-40.
[337] G. Turan, “On restricted Boolean circuits,” in Proceedings of the International Conference on
Fundamentals of Computation Theory,J.Csirik,J.DemetrovicsandF.Gecseg, eds., Springer,
Lecture Notes in Computer Science, 380, New York, 1989, 460-469.
[338] A. M. Turing, “On Computable Numbers with an Application to the Entscheidungsproblem,”
Proc.LondonMath.Soc.42 (1936), 230-265, Correction in Vol. 43, pp. 544-546.
[339] J. D. Ullman, ComputationalAspectsofVLSI, Computer Science Press, Rockville, MD, 1984.
[340] E. Upfal, “A Probabilistic Relation Between Desirable and Feasible Models of Parallel Computa-
tion,” Proc.16thAnn.ACMSymp.TheoryofComputing(1984), 258-265.
[341] E. Upfal and A. Wigderson, “How to Share Memory in a Distributed System,” JACM 34 (1987),
116-127.
[342] L. G. Valiant, “General Context-Free Recognition in Less Than Cubic Time,” J.Comp. Systems
Sci. 10 (1975), 308-315.