Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchings
Baruch Shieber, Shlomo Moran · 1986
Article Free Access Share on Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchings Authors: Baruch Shieber Department of Computer Science, School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel Department of Computer Science, School of Mathematical Sciences, Tel Aviv University, Tel Aviv, IsraelView Profile , Shlomo Moran IBM J. Watson Research Center, Yorktown Heights, NY IBM J. Watson Research Center, Yorktown Heights, NYView Profile Authors Info & Claims PODC '86: Proceedings of the fifth annual ACM symposium on Principles of distributed computingNovember 1986 Pages 282–292https://doi.org/10.1145/10590.10615Published:01 November 1986Publication History 14citation230DownloadsMetricsTotal Citations14Total Downloads230Last 12 Months10Last 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