Theory of Computing Systems
Volume 32 Noumber 3

S.E.Hamhrusdi Editors' Foreword 211
and B. M. Maggs

G. E. Blellocli and 'Pipelining with Futures 213
M. Reid-Miller

C. (1. Plaxton, R. Rajarainan, Accessing Nearby Copies of Replicated Objects
and A. W. Richa in a Distributed Environment 241

P. Berenbrink, F. Meyer Allocating Weighted Jobs in Parallel 281
aufderHeidc,and
K. Schroder

M. Feng and Efficient Detection of Determinancy Races in
C. E. Uiserson Cilk Programs 301

P. B. Gibbons, Y. Matias, Cailvt Shared-Memory Model Serve as a
and V. Ramachandran Bridging Model for Parallel Computation? 327

M. Mitzenmacher On the Analysis of Randomized Load
Balancing Schemes 361

M. Flamniini and Simple. Efficient Routing Schemes for
C. Schddfcler All-Optical Networks 387

Instructions to Authors on page 42 1

_______________________________________

Theory of Computing Systems
Volume: 32, Number: 1, January/February 1999

S. Bozapalidis Equational Elements in Additive Algebras 1

0. Bournez Some Bounds on the Computational Power of
Piecewise Constant Derivative Systems 35

R. Freund, L. Kari, DNA Computing Based on Splicing: The
and Gh. Paun Existence of Universal Computers 69

__________________________________________

Theory of Computing Systems
Volume: 32, Number: 2, March/April 1999

P. Berinaii and On Approximation Properties of the
T. Fujito Independent Set Problem for Low
Degree graphs 115

C. Holton and Descendants ol Primitive Substitutions 133
L. Q. Zamboni

F. Drewes A Chracterization oF the Sets of Hypertrees
Generated by Hyperedge-Replacement
Graph Grammars 159