JCSS, Volume 38

Volume 38, Number 1, February 1989

Selected Papers of

STOC 1986

• 
  Edward G. Coffman Jr., Frank Thomson Leighton:
  A Provably Efficient Algorithm for Dynamic Storage Allocation. 2-35
• 
  Mihalis Yannakakis:
  Embedding Planar Graphs in Four Pages. 36-67
• 
  Jin-yi Cai:
  With Probability One, a Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy. 68-85
• 
  James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan:
  Making Data Structures Persistent. 86-124
• 
  Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
  Optimal Parallel Selection has Complexity O(Log Log n). 125-133
• 
  Zvi Galil, Ravi Kannan, Endre Szemerédi:
  On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. 134-149
• 
  David A. Mix Barrington:
  Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹. 150-164
• 
  Herbert Edelsbrunner, Leonidas J. Guibas:
  Topologically Sweeping an Arrangement. 165-194
• 
  Joseph Y. Halpern, Moshe Y. Vardi:
  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds. 195-237

Volume 38, Number 2, April 1989

Selected Papers of PODS 1986

• 
  Heikki Mannila, Kari-Jouko Räihä:
  Automatic Generation of Test Data for Relational Queries. 240-258
• 
  Jeffrey F. Naughton:
  Data Independent Recursion in Deductive Databases. 259-289
• 
  Nicole Bidoit, Richard Hull:
  Minimalism, Justification and Non-Monotonicity in Deductive Databases. 290-325
• 
  François Bancilhon, Setrag Khoshafian:
  A Calculus for Complex Objects. 326-340
• 
  Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman:
  On the Convergence of Query Evaluation. 341-359
• 
  Thanasis Hadzilacos, Mihalis Yannakakis:
  Deleting Completed Transactions. 360-379
• 
  Yehoshua Sagiv, Oded Shmueli:
  A Characterization of Finite fd-Acyclicity. 380-404
• 
  Frank Olken, Doron Rotem:
  Rearranging Data to Maximize the Efficiency of Compression. 405-430

Volume 38, Number 3, June 1989

• 
  Juraj Hromkovic, Katsushi Inoue, Itsuo Takanami:
  Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines. 431-451
• 
  Oscar H. Ibarra, Tao Jiang, Jik H. Chang:
  On Iterative and Cellular Tree Arrays. 452-473
• 
  Marie-Paule Flé:
  Serialization of Concurrent Programs. 474-493
• 
  Victor Y. Pan, John H. Reif:
  Fast and Efficient Solution of Path Algebra Problems. 494-510
• 
  Craig A. Rich:
  Positive Relativizations of the P = ? NP Problem. 511-523