[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/645946.675009guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract)

Published: 26 September 1989 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2021)Four Shades of Deterministic Leader Election in Anonymous NetworksProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461794(265-274)Online publication date: 6-Jul-2021
  • (2020)Deterministic Leader Election in Anonymous Radio NetworksProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400276(407-417)Online publication date: 6-Jul-2020
  • (2019)Almost Logarithmic-Time Space Optimal Leader Election in Population ProtocolsThe 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323178(93-102)Online publication date: 17-Jun-2019
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
Proceedings of the 3rd International Workshop on Distributed Algorithms
September 1989
314 pages
ISBN:3540516875

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 September 1989

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Four Shades of Deterministic Leader Election in Anonymous NetworksProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461794(265-274)Online publication date: 6-Jul-2021
  • (2020)Deterministic Leader Election in Anonymous Radio NetworksProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400276(407-417)Online publication date: 6-Jul-2020
  • (2019)Almost Logarithmic-Time Space Optimal Leader Election in Population ProtocolsThe 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323178(93-102)Online publication date: 17-Jun-2019
  • (2019)Impact of Knowledge on Election Time in Anonymous NetworksAlgorithmica10.1007/s00453-018-0444-381:1(238-288)Online publication date: 1-Jan-2019
  • (2018)Fast space optimal leader election in population protocolsProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175286(265-266)Online publication date: 7-Jan-2018
  • (2017)Impact of Knowledge on Election Time in Anonymous NetworksProceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3087556.3087563(207-215)Online publication date: 24-Jul-2017
  • (2017)Time vs. Information Tradeoffs for Leader Election in Anonymous TreesACM Transactions on Algorithms10.1145/303987013:3(1-41)Online publication date: 6-Mar-2017
  • (2016)Time vs. information tradeoffs for leader election in anonymous treesProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884479(600-609)Online publication date: 10-Jan-2016
  • (2016)Election vs. SelectionProceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/2935764.2935772(377-386)Online publication date: 11-Jul-2016
  • (2016)Anonymous Meeting in NetworksAlgorithmica10.1007/s00453-015-9982-074:2(908-946)Online publication date: 1-Feb-2016
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media