Information Technology Reference
In-Depth Information
[189] P. S. Landweber, “Three Theorems on Phrase-Structure Grammars of Type 1,” Info. andControl
6 (1963), 131-136.
[190] P. L. Lehman, “A Systolic (VLSI) Array for Processing Simple Relational Queries,” in VLSISystems
andComputations, H. T. Kung, B. Sproull, and G. Steele, eds., Computer Science Press, Rockville,
MD, 1981, 285-295.
[191] F. T. Leighton, “New Lower Bound Techniques for VLSI,” Math. Systems Theory 17 (1984),
47-70.
[192] F. T. Leighton, Introduction toParallel Algorithms andArchitectures:Arrays, Trees,Hypercubes,
Morgan Kaufman, San Mateo, CA, 1992.
[193] T. Lengauer, Combinatorial Algorithms for IntegratedCircuit Layout, John Wiley & Sons, Chi-
chester, England, 1990.
[194] T. Lengauer, “VLSI Theory,” in HandbookofTheoreticalComputerScience,Vol.A, J. van Leeuwen,
ed., Elsevier, Amsterdam, NY, Oxford, Tokyo; MIT Press, Cambridge, MA, 1990, 836-868.
[195] T. Lengauer and K. Mehlhorn, “Four Results on the Complexity of VLSI Computations,” in Ad-
vances inComputingResearch, F. P. Preparata, ed. #2, JAI Press, Greenwich, CT, 1984, 1-22.
[196] T. Lengauer and R. E. Tarjan, “The Space Complexity of Pebble Games on Trees,” Inf.Proc.Letters
10 (1980), 184-188.
[197] T. Lengauer and R. E. Tarjan, “Asymptotically Tight Bounds on Time-Space Tradeoffs in a Pebble
Game,” JACM 29 (1982), 1087-1130.
[198] S. J. Leon, LinearAlgebrawithApplications, Prentice-Hall, Englewood Cliffs, NJ, 1997 .
[199] L. A. Levin, “Universal Sorting Problems,” Probl.PeredaciInformacii 9 (1973), 115-116, (in Rus-
sian); English translation in Problems of Information Transmission 9 (1973) 265-266.
[200] H. R. Lewis and C. H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall,
Englewood Cliffs, NJ, 1981.
[201] A. Lingas, “A PSPACE-Complete Problem Related to a Pebble Game,” in Automata Languages
andProgramming,G.AussielloandC.Boehm,eds.,Springer-Verlag, Lecture Notes in Computer
Science, 62 , Berlin, Heidelberg, and New York, 1978, 300-321.
[202] R. J. Lipton and R. Sedgewick, “Lower Bounds for VLSI,” Proc. 13thAnn. ACMSymp.Theory
ofComputing(1981), 300-307.
[203] R. J. Lipton and R. E. Tarjan, “A Separator Theorem for Planar Graphs,” SIAMJ.Appl.Math.36
(1979), 177-189.
[204] R. J. Lipton and R. E. Tarjan, “Applications of a Planar Separator Theorem,” SIAMJ.Comput.9
(1980), 615-627.
[205] M. C. Loui, “Minimum Register Allocation Is Complete in Polynomial Space,” Lab. Comp. Sci.,
MIT, Technical Memorandum TM-128, Cambridge, MA, 1979.
[206] M. C. Loui, “The Space Complexity of Two Pebble Games on Trees,” Lab. Comp. Sci., MIT,
Technical Memorandum TM-133, Cambridge, MA, 1979.
[207] W. K. Luk and J. E. Vuillemin, “Recursive Implementation of Optimal-Time VLSI Integer Mul-
tiplier,” in Advances in Computing Research, 2,F.P.Preparata,ed.,JAIPress,Greenwich,CT,
1984, 67-93.
[208] O. B. Lupanov, “A Method of Circuit Synthesis,” Ivz.V.U.Z.Radiofiz. 1 (1958), 120-140.
[209] W. F. McColl, “Planar Circuits Have Short Specifications,” in Proc. Symp. Theoretical Aspects
ofComputerScience, K. Mehlhorn, ed. #2, Springer-Verlag, Lecture Notes in Computer Science,
182, 1985, 231-242.
Search WWH ::




Custom Search