Multi-processor scheduling and expanders
References (16)
- et al.
Better expanders and superconcentrators
J. Algorithms
(1987) - et al.
The complexity of testing whether a graph is a superconcentrator
Inform. Process. Lett.
(1981) Graph theoretic properties in computational complexity
J. Comput. System Sci.
(1976)- et al.
Sorting in c log n parallel steps
Combinatorica
(1983) - et al.
On-line algorithms for path selection in a non-blocking network
Proc. 22nd STOC
(1990) Asymptotically optimal switching circuits
Problems Inform. Transmission
(1981)- et al.
Optimal scheduling for two-processor systems
Acta Inform.
(1972) - et al.
Computers and Intractability
(1979)
There are more references available in the full text version of this article.
Cited by (0)
- 1
Partially supported by the Russian Foundation for Fundamental Research.
Copyright © 1994 Published by Elsevier B.V.