Journal: J. Comput. Syst. Sci.

Volume 57, Issue 3

234 -- 259Anthony J. Bonner, Giansalvatore Mecca. Sequences, Datalog, and Transducers
260 -- 271Vinay K. Chaudhri, Vassos Hadzilacos. Safe Locking Policies for Dynamic Databases
272 -- 288Mariano P. Consens, Tova Milo. Algebras for Querying Text Regions: Expressive Power and Optimization
289 -- 308Guozhu Dong, Jianwen Su. Arity Bounds in First-Order Incremental Evaluation and Definition of Polynomial Time Database Queries
309 -- 324Idit Keidar, Danny Dolev. Increasing the Resilience of Distributed and Replicated Database Systems
325 -- 355Philippe Picouet, Victor Vianu. Semantics and Expressiveness Issues in Active Databases
356 -- 365Sanjay Jain. Learning with Refutation
366 -- 375Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde. Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth
376 -- 388Peter Auer, Philip M. Long, Aravind Srinivasan. Approximating Hyper-Rectangles: Learning and Pseudorandom Sets
389 -- 398Eugene Asarin, Oded Maler. Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy
399 -- 401Leonard J. Schulman. A Three-Party Communication Problem

Volume 57, Issue 2

127 -- 143Manindra Agrawal, Eric Allender, Steven Rudich. Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
144 -- 161Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur. Integer Programming as a Framework for Optimization and Approximability
162 -- 171Samuel R. Buss, Toniann Pitassi. Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle
172 -- 186Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay. DNA Models and Algorithms for NP-Complete Problems
187 -- 199Uriel Feige, Joe Kilian. Zero Knowledge and the Chromatic Number
200 -- 212Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer. Nondeterministic ::::NC:::::::1::: Computation
213 -- 232Dieter van Melkebeek. Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets

Volume 57, Issue 1

3 -- 19Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi. The Relative Complexity of NP Search Problems
20 -- 36Persi Diaconis, Laurent Saloff-Coste. What Do We Know about the Metropolis Algorithm?
37 -- 49Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson. On Data Structures and Asymmetric Communication Complexity
50 -- 66Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan. Randomized Query Processing in Robot Path Planning
61 -- 73Jon M. Kleinberg, Éva Tardos. Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks
74 -- 93Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman. Sorting in Linear Time?
94 -- 124Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, Pravin Varaiya. What s Decidable about Hybrid Automata?