Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms
Under a Creative Commons license
open archive
Cited by (0)
- ∗
This research was supported in part by NSF Grants DCR-84-01633, CCR-8702271, CCR-8902221 and CCR-8906949 by ORN Grant N00014-85-K-0046, by an IBM faculty development award, and by a John Simon Guggenheim Memorial Foundation Fellowship.
Copyright © 1991 Published by Elsevier Inc.