JCSS, Volume 36

Volume 36, Number 1, February 1988

• 
  Pierre Baldi:
  Group Actions and Learning for a Family of Automata. 1-15
• 
  Peter A. Lindsay:
  On Alternating omega-Automata. 16-24
• 
  Masashi Katsura:
  Automorphism Groups and Factor Automata of Strongly Connected Automata. 25-65
• 
  Zoltán Ésik:
  Independence of the Equational Axioms for Iteration Theories. 66-76
• 
  Dirk Van Gucht, Patrick C. Fischer:
  Multilevel Nested Relational Structures. 77-105

Volume 36, Number 2, April 1988

Selected Papers of

STOC 1985

• 
  Robert E. Wilber:
  White Pebbles Help. 108-124
• 
  Péter Gács, John H. Reif:
  A Simple Three-Dimensional Real-Time Reliable Cellular Array. 125-147
• 
  Fan R. K. Chung, D. J. Hajela, Paul D. Seymour:
  Self-organizing Sequential Search and Hilbert's Inequalities. 148-157
• 
  J. W. de Bakker, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog, Jeffery I. Zucker:
  Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency. 158-224
• 
  Richard M. Karp, Eli Upfal, Avi Wigderson:
  The Complexity of Parallel Search. 225-253
• 
  László Babai, Shlomo Moran:
  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. 254-276

Volume 36, Number 3, June 1988

Selected Papers of the Structure in Complexity Theory Conference, June 2-5, 1986

• 
  Ian Parberry, Georg Schnitger:
  Parallel Computation with Threshold Functions. 278-302
• 
  Christopher B. Wilson:
  A Measure of Relativized Space Which Is Faithful With Respect to Depth. 303-312
• 
  Martin Dietzfelbinger, Wolfgang Maass:
  Lower Bound Arguments with "Inaccessible" Numbers. 313-335
• 
  Eric Allender:
  Isomorphisms and 1-L Reductions. 336-350
• 
  Jonathan F. Buss:
  Relativized Alternation and Space-Bounded Computation. 351-378
• 
  Michael Sipser:
  Expanders, Randomness, or Time versus Space. 379-383
• 
  Kenneth W. Regan:
  The Topology of Provability in Complexity Theory. 384-432
• 
  Stathis Zachos:
  Probabilistic Quantifiers and Games. 433-451
• 
  Anne Condon, Richard E. Ladner:
  Probabilistic Game Automata. 452-489
• 
  Mark W. Krentel:
  The Complexity of Optimization Problems. 490-509