Theory of Computing Systems, Volume 32

Volume 32, Number 1, 1999

• Symeon Bozapalidis:
  Equational Elements in Additive Algebras. 1-33
  
• Olivier Bournez:
  Some Bounds on the Computational Power of Piecewise Constant Derivative Systems. 35-67
  
• Rudolf Freund, Lila Kari, Gheorghe Paun:
  DNA Computing Based on Splicing: The Existence of Universal Computers. 69-112
  

Volume 32, Number 2, 1999

• Piotr Berman, Toshihiro Fujito:
  On Approximation Properties of the Independent Set Problem for Low Degree Graphs. 115-132
  
• Charles Holton, Luca Q. Zamboni:
  Descendants of Primitive Substitutions. 133-157
  
• Frank Drewes:
  A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars. 159-208
  

Volume 32, Number 3, 1999

• Susanne E. Hambrusch, Bruce M. Maggs:
  Editors' Foreword. 211
  
• Guy E. Blelloch, Margaret Reid-Miller:
  Pipelining with Futures. 213-239
  
• C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa:
  Accessing Nearby Copies of Replicated Objects in a Distributed Environment. 241-280
  
• Petra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder:
  Allocating Weighted Jobs in Parallel. 281-300
  
• Mingdong Feng, Charles E. Leiserson:
  Efficient Detection of Determinacy Races in Cilk Programs. 301-326
  
• Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
  Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation? 327-359
  
• Michael Mitzenmacher:
  On the Analysis of Randomized Load Balancing Schemes. 361-386
  
• Michele Flammini, Christian Scheideler:
  Simple, Efficient Routing Schemes for All-Optical Networks. 387-420
  

Volume 32, Number 4, 1999

• Petr Kurka:
  Zero-Dimensional Dynamical Systems, Formal Languages, and Universality. 423-433
  
• Ricardo A. Baeza-Yates, Ricard Gavaldà, Gonzalo Navarro, R. Scheihing:
  Bounding the Expected Length of Longest Common Subsequences and Forests. 435-452
  
• Frederic Green:
  Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates. 453-466
  
• H.-C. Yen:
  Integer Linear Programming and the Analysis of Some Petri Net Problems. 467-485
  
• Beate Bollig, Ingo Wegener:
  Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. 487-503
  

Volume 32, Number 5, 1999

• Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
  An Isoperimetric Problem in Cayley Graphs. 507-516
  
• Y. Wang:
  Randomness, Stochasticity, and Approximations. 517-529
  
• Gianfranco Bilardi, Franco P. Preparata:
  Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. 531-559
  
• Eric J. Schwabe, Ian M. Sutherland:
  Flexible Usage of Redundancy in Disk Arrays. 561-587
  

Volume 32, Number 6, November/December 1999

• Basilis Mamalis, Paul G. Spirakis, Basil Tampakas:
  Optimal High-Performance Parallel Text Retrieval via Fat-Trees. 591-623
  
• Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung:
  Robust Reductions. 625-647
  
• Zoltán Fülöp, Heiko Vogler:
  A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. 649-676