Theoretical Computer Science, Volume 52

Volume 52, 1987

• Marek Zaionc: Word Operation Definable in the Typed lambda-Calculus. 1-14 BibTeX
• Ker-I Ko: On Helping by Robust Oracle Machines. 15-36 BibTeX
• Richard Kennaway: On ``On Graph Rewritings''. 37-58 BibTeX
• Jacques Sakarovitch: On Regular Trace Languages. 59-75 BibTeX
• Joachim von zur Gathen: Factoring Polynomials and Primitive Elements for Special Primes. 77-89 BibTeX
• B. Seite: A Yacc Extension for LRR Grammar Parsing. 91-143 BibTeX
• Daniele Mundici: Satisfiability in Many-Valued Sentential Logic is NP-Complete. 145-153 BibTeX
• Paul G. Spirakis: The Parallel Complexity of Deadlock Detection. 155-163 BibTeX
• Tetsuo Moriya: Topological Characterizations of Infinite Tree Languages. 165-171 BibTeX
• Changwook Kim, Ivan Hal Sudborough: The Membership and Equivalence Problems for Picture Languages. 177-191 BibTeX
• John M. Marberg, Eli Gafni: Distributed Sorting Algorithms for Multi-Channel Broadcast Networks. 193-203 BibTeX
• Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba: A Syntactic Theory of Sequential Control. 205-237 BibTeX
• R. G. Nigmatullin: Models of Lower-Bounds Proofs. 239-249 BibTeX
• José L. Balcázar, Josep Díaz, Joaquim Gabarró: On Characterizations of the Class PSPACE/POLY. 251-267 BibTeX
• Erol Gelenbe, David Finkel: Stationary Deterministic Flows: II. The Single-Server Queue. 269-280 BibTeX
• Rodney W. Topor: Domain-Independent Formulas and Databases. 281-306 BibTeX
• Gheorghe Stefanescu: On Flowchart Theories: Part II. The Nondeterministic Case. 307-340 BibTeX
• Franz-Josef Brandenburg: A Note on: `Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages'. 341-342 BibTeX , ->TCS 40: 163-174 (1985)