Works matching IS 14324350 AND DT 1999 AND VI 32 AND IP 3

Results: 7

Simple, Efficient Routing Schemes for All-Optical Networks.

Published in:

Theory of Computing Systems, 1999, v. 32, n. 3, p. 387, doi. 10.1007/s002240000123

By:

Flammini, M.;
Scheideler, C.

Publication type:

Article

On the Analysis of Randomized Load Balancing Schemes.

Published in:

Theory of Computing Systems, 1999, v. 32, n. 3, p. 361, doi. 10.1007/s002240000122

By:

Mitzenmacher, M.

Publication type:

Article

Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?

Published in:

Theory of Computing Systems, 1999, v. 32, n. 3, p. 327, doi. 10.1007/s002240000121

By:

Gibbons,, P. B.;
Matias,, Y.;
Ramachandran, V.

Publication type:

Article

Efficient Detection of Determinancy Races in Cilk Programs.

Published in:

Theory of Computing Systems, 1999, v. 32, n. 3, p. 301, doi. 10.1007/s002240000120

By:

Feng, M.;
Leiserson, C. E.

Publication type:

Article

Allocating Weighted Jobs in Parallel.

Published in:

Theory of Computing Systems, 1999, v. 32, n. 3, p. 281, doi. 10.1007/s002240000119

By:

Berenbrink, P.;
auf der Heide, F. Meyer;
Schroder, K.

Publication type:

Article

Accessing Nearby Copies of Replicated Objects in a Distributed Environment.

Published in:

Theory of Computing Systems, 1999, v. 32, n. 3, p. 241, doi. 10.1007/s002240000118

By:

Plaxton, C. G.;
Rajaraman, R.;
Richa, A. W.

Publication type:

Article

Pipelining with Futures.

Published in:

Theory of Computing Systems, 1999, v. 32, n. 3, p. 213, doi. 10.1007/s002240000117

By:

Blelloch, G. E.;
Reid-Miller, M.

Publication type:

Article