Volume 52, 1987

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

last updated on Thu May 23 04:44:26 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page