Theoretical Computer Science, Volume 268

Volume 268, Number 1, 6 October 2001

• Stefano Leonardi, Alberto Marchetti-Spaccamela:
  Preface. 1
  
• Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
  A new lower bound for the list update problem in the partial cost model. 3-16
  
• Yossi Azar, Oded Regev:
  On-line bin-stretching. 17-41
  
• Yair Bartal, Moses Charikar, Piotr Indyk:
  On page migration and other relaxed task systems. 43-66
  
• Stefan Bischof, Ernst W. Mayr:
  On-line scheduling of parallel jobs with runtime restrictions. 67-90
  
• Esteban Feuerstein, Leen Stougie:
  On-line single-server dial-a-ride problems. 91-105
  
• Wlodzimierz Glazek:
  Online algorithms for page replication in rings. 107-117
  
• Tracy Kimbrel:
  Online paging and file caching with expiration times. 119-131
  
• John Noga, Steven S. Seiden:
  An optimal online algorithm for scheduling two machines with release times. 133-143
  
• Marco Riedel:
  Online request server matching. 145-160
  
• Rudolf Fleischer:
  On the Bahncard problem. 161-174
  

Volume 268, Number 2, 17 October 2001

• Rolf Wiehagen, Thomas Zeugmann:
  Foreword. 175-177
  
• M. R. K. Krishna Rao, Abdul Sattar:
  Polynomial-time learnability of logic programs with local variables from entailment. 179-198
  
• Marc Fischlin:
  Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions. 199-219
  
• Frank Stephan, Yuri Ventsov:
  Learning algebraic structures from text. 221-273
  
• Léa Meyer:
  Aspects of complexity of probabilistic learning under monotonicity constraints. 275-322
  
• John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan:
  Predictive learning models for concept drift. 323-349
  
• Eiju Hirowatari, Setsuo Arikawa:
  A comparison of identification criteria for inductive inference of recursive real-valued functions. 351-366
  
• Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
  Closedness properties in ex-identification. 367-393