Journal: J. Comput. Syst. Sci.

Volume 38, Issue 3

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

Volume 38, Issue 2

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

Volume 38, Issue 1

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