Tight bounds for oblivious routing in the hypercube

  • Authors:
  • C. Kaklamanis;D. Krizanc;T. Tsantilas

  • Affiliations:
  • Aiken Computation Laboratory, Harvard University, Cambridge, MA;Department of Computer Science, University of Rochester, Rochester, NY;Aiken Computation Laboratory, Harvard University, Cambridge, MA

  • Venue:
  • SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
  • Year:
  • 1990

Quantified Score

Hi-index 0.01

Visualization

Abstract