Theoretical Computer Science, Volume 1

Volume 1, Number 1, 1975

A. A. Schönhage: A Lower Bound for the Length of Addition Chains. 1-12 BibTeX
Mike Paterson: Complexity of Monotone Networks for Boolean Matrix Product. 13-20 BibTeX
Volker Strassen: Die Berechnungskomplexität der Symbolischen Differentiation von Interpolationspolynomen. 21-25 BibTeX
Gérard P. Huet: A Unification Algorithm for Typed lambda-Calculus. 27-57 BibTeX
Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg: Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions. 59-75 BibTeX
Ann Reedy, Walter J. Savitch: The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages. 77-91 BibTeX

Antonio Restivo: A Combinatorial Property of Codes Having Finite Synchronization Delay. 95-101 BibTeX
Richard E. Ladner, Nancy A. Lynch, Alan L. Selman: A Comparison of Polynomial Time Reducibilities. 103-123 BibTeX
Gordon D. Plotkin: Call-by-Name, Call-by-Value and the lambda-Calculus. 125-159 BibTeX
L. H. Harper, W. N. Hsieh, S. E. Savage: A Class of Boolean Functions with Linear Combinational Complexity. 161-183 BibTeX
Franco P. Preparata: A Fast Stable Sorting Algorithm with Absolutely Minimum Storage. 185-190 BibTeX

Robert Moll: An Operator Embedding Theorem for Complexity Classes of Recursive Functions. 193-198 BibTeX
Jan van Leeuwen, Derick Wood: A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families. 199-214 BibTeX
Ronald V. Book: Translational Lemmas, Polynomial Time, and (log n)^j-Space. 215-226 BibTeX
Maurice Mignotte: Algorithmes rélatifs á la décomposition dds oolynômes. 227-235 BibTeX
M. R. Garey, David S. Johnson, Larry J. Stockmeyer: Some Simplified NP-Complete Graph Problems. 237-267 BibTeX

Sheila A. Greibach: Remarks on the Complexity of Nondeterministic Counter Languages. 269-288 BibTeX
Claus-Peter Schnorr: The Combinational Complexity of Equivalence. 289-295 BibTeX
Emily P. Friedman: The Inclusion Problem for Simple Languages. 297-316 BibTeX
Juhani Karhumäki: Two Theorems Concerning Recognizable N-Subsets of sigma*. 317-323 BibTeX
Andrzej Ehrenfeucht, Grzegorz Rozenberg, Sven Skyum: A Relationship between ET0L and EDT0L Languages. 325-330 BibTeX
V. Wiktor Marek, Zdzislaw Pawlak: Information Storage and Retrieval Systems: Mathematical Foundations. 331-354 BibTeX
Michael L. Fredman: How Good is the Information Theory Bound in Sorting? 355-361 BibTeX