Tight bounds for oblivious routing in the hypercube

Abstract

Article Free Access Share on Tight bounds for oblivious routing in the hypercube Authors: C. Kaklamanis Aiken Computation Laboratory, Harvard University, Cambridge, MA Aiken Computation Laboratory, Harvard University, Cambridge, MAView Profile , D. Krizanc Department of Computer Science, University of Rochester, Rochester, NY Department of Computer Science, University of Rochester, Rochester, NYView Profile , T. Tsantilas Aiken Computation Laboratory, Harvard University, Cambridge, MA Aiken Computation Laboratory, Harvard University, Cambridge, MAView Profile Authors Info & Claims SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architecturesMay 1990 Pages 31–36https://doi.org/10.1145/97444.97453Published:01 May 1990Publication History 57citation682DownloadsMetricsTotal Citations57Total Downloads682Last 12 Months63Last 6 weeks8 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