Journals in DBLP

Theory Comput. Syst.
1999, volume: 32, number: 3

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