Constant time per edge is optimal on rooted tree networks
Michael Mitzenmacher · 1996
Article Free Access Share on Constant time per edge is optimal on rooted tree networks Author: Michael Mitzenmacher Computer Science Division, U.C. Berkeley, Berkeley, CA Computer Science Division, U.C. Berkeley, Berkeley, CAView Profile Authors Info & Claims SPAA '96: Proceedings of the eighth annual ACM symposium on Parallel Algorithms and ArchitecturesJune 1996 Pages 162–169https://doi.org/10.1145/237502.237524Published:24 June 1996Publication History 6citation156DownloadsMetricsTotal Citations6Total Downloads156Last 12 Months7Last 6 weeks3 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