A 2n-2 step algorithm for routing in an nxn array with constant size queues

  • Authors:
  • T. Leighton;F. Makedon;I. G. Tollis

  • Affiliations:
  • Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX

  • Venue:
  • SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
  • Year:
  • 1989

Quantified Score

Hi-index 0.01

Visualization

Abstract