Theory of Computing Systems, Volume 33

Volume 33, Number 1, 2000

• Pierluigi Crescenzi, Luca Trevisan:
  On Approximation Scheme Preserving Reducibility and Its Applications. 1-16
  
• Yoshifumi Sakai, Akira Maruoka:
  Learning Monotone Log-Term DNF Formulas under the Uniform Distribution. 17-33
  
• Sanjay Jain, Arun Sharma:
  Team Learning of Computable Languages. 35-58
  
• Akio Fujiyoshi, Takumi Kasai:
  Spinal-Formed Context-Free Tree Grammars. 59-83
  
• Stefan D. Bruda, Selim G. Akl:
  The Characterization of Data-Accumulating Algorithms. 85-96
  
• Hong-Chung Chen, Yue-Li Wang:
  An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees. 97-105
  
• Luis B. Morales, A. Sánchez-Flores:
  Erratum: Diagonal Polynomials and Diagonal Orders on Multidimensional Lattices. 107
  

Volume 33, Number 2, 2000

• David W. Juedes, Jack H. Lutz:
  Modeling Time-Bounded Prefix Kolmogorov Complexity. 111-123
  
• Bruno Courcelle, Johann A. Makowsky, Udi Rotics:
  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. 125-150
  
• Wolfgang Lindner, Rainer Schuler, Osamu Watanabe:
  Resource-Bounded Measure and Learnability. 151-170
  

Volume 33, Number 3, 2000

• Panagiota Fatourou, Paul G. Spirakis:
  Efficient Scheduling of Strict Multithreaded Computations. 173-232
  
• C. Greg Plaxton, Torsten Suel:
  A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks. 233-254
  

Volume 33, Number 4, 2000

• Alessandra Cherubini, Pierluigi San Pietro:
  Tree Adjoining Languages and Multipushdown Languages. 257-293
  
• Jochen Alber, Rolf Niedermeier:
  On Multidimensional Curves with Hilbert Property. 295-312
  
• Martin Sauerhoff:
  An Improved Hierarchy Result for Partitioned BDDs. 313-329
  

Volume 33, Number 5/6, 2000

• Arnold L. Rosenberg:
  Editorial Message. 333
  
• Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias:
  Guest Editors' Foreword. 335-335
  
• Micah Adler, Christian Scheideler:
  Efficient Communication Strategies for Ad Hoc Wireless Networks. 337-391
  
• Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan:
  On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks. 393-426
  
• Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung:
  Robust Parallel Computations through Randomization. 427-464
  
• Artur Czumaj:
  Recovery Time of Dynamic Allocation Processes. 465-487
  
• Hannah Bast:
  On Scheduling Parallel Tasks at Twilight. 489-563