JCSS, Volume 57

Volume 57, Number 1, August 1998

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

Volume 57, Number 2, October 1998

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

Volume 57, Number 3, December 1998

• Anthony J. Bonner, Giansalvatore Mecca:
  Sequences, Datalog, and Transducers. 234-259
  
• Vinay K. Chaudhri, Vassos Hadzilacos:
  Safe Locking Policies for Dynamic Databases. 260-271
  
• Mariano P. Consens, Tova Milo:
  Algebras for Querying Text Regions: Expressive Power and Optimization. 272-288
  
• Guozhu Dong, Jianwen Su:
  Arity Bounds in First-Order Incremental Evaluation and Definition of Polynomial Time Database Queries. 289-308
  
• Idit Keidar, Danny Dolev:
  Increasing the Resilience of Distributed and Replicated Database Systems. 309-324
  
• Philippe Picouet, Victor Vianu:
  Semantics and Expressiveness Issues in Active Databases. 325-355
  

• Sanjay Jain:
  Learning with Refutation. 356-365
  
• Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde:
  Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. 366-375
  
• Peter Auer, Philip M. Long, Aravind Srinivasan:
  Approximating Hyper-Rectangles: Learning and Pseudorandom Sets. 376-388
  
• Eugene Asarin, Oded Maler:
  Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy. 389-398
  

• Leonard J. Schulman:
  A Three-Party Communication Problem. 399-401
  

Last update Sat May 18 20:40:44 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page