Volume 23, Number 1, 1990

• 
  Dung T. Huynh: The Complexity of Ranking Simple Languages. 1-19
• 
  Josep Díaz, Jacobo Torán: Classes of Bounded Nondeterminism. 21-32
• 
  Hsu-Chun Yen: Communicating Processes, Scheduling, and the Complexity of Nondeterminism. 33-59
• 
  David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg: Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. 61-77

Volume 23, Number 2, 1990

• 
  Ian Parberry: Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification. 81-93
• 
  Jin-yi Cai, Lane A. Hemachandra: On the Power of Parity Polynomial Time. 95-106
• 
  Miroslaw Kutylowski: One-Way Multihead Finite Automata and 2-Bounded Languages. 107-139

Volume 23, Number 3, 1990

• 
  Mukkai S. Krishnamoorthy, Robert Ingalls: Guest Editors' Note: Special Issue in Honor of Robert McNaughton. 143
• 
  Robert McNaughton: Some Remarks. 145-146
• 
  David A. Mix Barrington: Extensions of an Idea of McNaughton. 147-164
• 
  Ronald V. Book, Shouwen Tang: Characterizing Polynomial Complexity Classes by Reducibilities. 165-174
• 
  Hantao Zhang, Deepak Kapur: Unnecessary Inferences in Associative-Commutative Completion Procedures. 175-206

Volume 23, Number 4, 1990

• 
  Mukkai S. Krishnamoorthy, Robert Ingalls: Guest Editors' Note: Special Issue in Honor of Robert McNaughton. 207
• 
  Richard Edwin Stearns, Harry B. Hunt III: Power Indices and Easier Hard Problems. 209-225
• 
  Arnold L. Rosenberg: Exposing Graph Uniformities via Algebraic Specification. 227-244
• 
  Paliath Narendran: It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set. 245-254

last updated on Wed May 22 06:01:25 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page