Improvements in the time complexity of two message-optimal election algorithms
Eli M. Gafni · 1985
Article Improvements in the time complexity of two message-optimal election algorithms Share on Author: Eli Gafni Computer Science Department, University of California, Los Angeles, CA Computer Science Department, University of California, Los Angeles, CAView Profile Authors Info & Claims PODC '85: Proceedings of the fourth annual ACM symposium on Principles of distributed computingAugust 1985 Pages 175–185https://doi.org/10.1145/323596.323612Online:01 August 1985Publication History 63citation412DownloadsMetricsTotal Citations63Total Downloads412Last 12 Months9Last 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 SiteGet Access