Publication Details
Title: The complexity of parallel search
Author: R.M. Karp, E. Upfal, and A. Wigderson
Group: Algorithms
Date: April 1988
PDF: [Not available online]
Bibliographic Information:
Journal of Computer and System Sciences, Vol. 36, No. 2. Also in the proceedings of the 17th Annual ACM Symposium on the Theory of Computing, Providence, Rhode Island, May 1985, pp. 225-53
Bibliographic Reference:
R.M. Karp, E. Upfal, and A. Wigderson. The complexity of parallel search. Journal of Computer and System Sciences, Vol. 36, No. 2. Also in the proceedings of the 17th Annual ACM Symposium on the Theory of Computing, Providence, Rhode Island, May 1985, pp. 225-53, April 1988
Author: R.M. Karp, E. Upfal, and A. Wigderson
Group: Algorithms
Date: April 1988
PDF: [Not available online]
Bibliographic Information:
Journal of Computer and System Sciences, Vol. 36, No. 2. Also in the proceedings of the 17th Annual ACM Symposium on the Theory of Computing, Providence, Rhode Island, May 1985, pp. 225-53
Bibliographic Reference:
R.M. Karp, E. Upfal, and A. Wigderson. The complexity of parallel search. Journal of Computer and System Sciences, Vol. 36, No. 2. Also in the proceedings of the 17th Annual ACM Symposium on the Theory of Computing, Providence, Rhode Island, May 1985, pp. 225-53, April 1988