Flammini, M.; Scheideler, C. Simple, efficient routing schemes for all-optical networks. (English) Zbl 0929.68008 Theory Comput. Syst. 32, No. 3, 387-420 (1999). MSC: 68M10 × Cite Format Result Cite Review PDF Full Text: DOI
Mitzenmacher, M. On the analysis of randomized load balancing schemes. (English) Zbl 0932.68003 Theory Comput. Syst. 32, No. 3, 361-386 (1999). MSC: 68M10 68M07 68W05 × Cite Format Result Cite Review PDF Full Text: DOI
Gibbons, P. B.; Matias, Y.; Ramachandran, V. Can a shared-memory model serve as a bridging model for parallel computation? (English) Zbl 0929.68071 Theory Comput. Syst. 32, No. 3, 327-359 (1999). MSC: 68Q10 68W10 × Cite Format Result Cite Review PDF Full Text: DOI
Feng, M.; Leiserson, C. E. Efficient detection of determinacy races in cilk programs. (English) Zbl 0929.68023 Theory Comput. Syst. 32, No. 3, 301-326 (1999). MSC: 68N15 × Cite Format Result Cite Review PDF Full Text: DOI
Berenbrink, P.; Meyer auf der Heide, Friedhelm; Schröder, K. Allocating weighted jobs in parallel. (English) Zbl 0929.68002 Theory Comput. Syst. 32, No. 3, 281-300 (1999). MSC: 68M07 68W05 × Cite Format Result Cite Review PDF Full Text: DOI
Plaxton, C. G.; Rajaraman, R.; Richa, A. W. Accessing nearby copies of replicated objects in a distributed environment. (English) Zbl 0929.68126 Theory Comput. Syst. 32, No. 3, 241-280 (1999). MSC: 68W05 × Cite Format Result Cite Review PDF Full Text: DOI
Blelloch, G. E.; Reid-Miller, M. Pipelining with futures. (English) Zbl 0929.68125 Theory Comput. Syst. 32, No. 3, 213-239 (1999). MSC: 68W05 68W10 68P10 × Cite Format Result Cite Review PDF Full Text: DOI
Hambrusch, Susanne E. (ed.); Maggs, Bruce M. (ed.) Special issue: 8th ACM symposium on Parallel algorithms and architectures, Padua, Italy, June 24–26, 1996. (English) Zbl 0929.00078 Theory Comput. Syst. 32, No. 3, 211-422 (1999). MSC: 00B25 68-06 × Cite Format Result Cite Review PDF Full Text: DOI