A 2 n -2 step algorithm for routing in an nxn array with constant size queues
T. Leighton, Fillia S. Makedon, Ioannis G. Tollis · 1989
Article Free Access Share on A 2n-2 step algorithm for routing in an nxn array with constant size queues Authors: T. Leighton Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MAView Profile , F. Makedon Department of Computer Science, University of Texas at Dallas, Richardson, TX Department of Computer Science, University of Texas at Dallas, Richardson, TXView Profile , I. G. Tollis Department of Computer Science, University of Texas at Dallas, Richardson, TX Department of Computer Science, University of Texas at Dallas, Richardson, TXView Profile Authors Info & Claims SPAA '89: Proceedings of the first annual ACM symposium on Parallel algorithms and architecturesMarch 1989 Pages 328–335https://doi.org/10.1145/72935.72970Published:01 March 1989Publication History 64citation353DownloadsMetricsTotal Citations64Total Downloads353Last 12 Months19Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF