Volume 62, Number 1, February 2001

• 
  Silvia Ghilezan: Full Intersection Types and Topologies in Lambda Calculus. 1-14
• 
  Fosca Giannotti, Dino Pedreschi, Carlo Zaniolo: Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases. 15-42
• 
  Paolo Liberatore, Marco Schaerf: Belief Revision and Update: Complexity of Model Checking. 43-72
• 
  Anna Philippou, David Walker: A Process-Calculus Analysis of Concurrent Operations on B-Trees. 73-122
• 
  Sally A. Goldman, Stephen Kwek, Stephen D. Scott: Agnostic Learning of Geometric Patterns. 123-151
• 
  Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman: On the Benefit of Supporting Virtual Channels in Wormhole Routers. 152-177
• 
  Sanjay Jain, Carl H. Smith, Rolf Wiehagen: Robust Learning Is Rich. 178-212

Volume 62, Number 2, March 2001

• 
  Lance Fortnow: Guest Editor's Foreword. 215
• 
  J. Maurice Rojas: Computational Arithmetic Geometry I. Sentences Nearly in the Polynomial Hierarchy. 216-235
• 
  Madhu Sudan, Luca Trevisan, Salil P. Vadhan: Pseudorandom Generators without the XOR Lemma. 236-266
• 
  Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi: Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. 267-289
• 
  Marcus Schaefer: Graph Ramsey Theory and the Polynomial Hierarchy. 290-322
• 
  Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh: The Communication Complexity of Pointer Chasing. 323-355
• 
  Eric Allender, Michael E. Saks, Igor Shparlinski: A Lower Bound for Primality. 356-366
• 
  Russell Impagliazzo, Ramamohan Paturi: On the Complexity of k-SAT. 367-375
• 
  John Watrous: Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. 376-391

Volume 62, Number 3, May 2001

• 
  Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts: Competitive Routing of Virtual Circuits with Unknown Duration. 385-397
• 
  John H. Reif: Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems. 398-412
• 
  John Case, Sanjay Jain: Synthesizing Learners Tolerating Computable Noisy Data. 413-441
• 
  Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis: The Stability of Saturated Linear Dynamical Systems Is Undecidable. 442-462
• 
  Francesco Buccafurri, Thomas Eiter, Georg Gottlob, Nicola Leone: On ACTL Formulas Having Linear Counterexamples. 463-515
• 
  Yi Li, Philip M. Long, Aravind Srinivasan: Improved Bounds on the Sample Complexity of Learning. 516-527
• 
  Jinde Cao, Qing Tao: Estimation on Domain of Attraction and Convergence Rate of Hopfield Continuous Feedback Neural Networks. 528-534

Volume 62, Number 4, June 2001

• 
  Yasunori Ishihara, Shougo Shimizu, Hiroyuki Seki, Minoru Ito: Refinements of Complexity Results on Type Consistency for Object-Oriented Databases. 537-564
• 
  Juraj Hromkovic, Sebastian Seibert, Thomas Wilke: Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. 565-588
• 
  Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan: Linear-Consistency Testing. 589-607
• 
  Changwook Kim: Separation Results for Separated Apex NLC and NCE Graph Languages. 608-628
• 
  Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. 629-652
• 
  Marcus Hutter: New Error Bounds for Solomonoff Prediction. 653-667
• 
  Yonit Kesten, Amir Pnueli, Moshe Y. Vardi: Verification by Augmented Abstraction: The Automata-Theoretic View. 668-690

last updated on Fri May 24 06:16:51 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page