Leader election (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Leader election" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
11th place
8th place
910th place
593rd place
415th place
327th place
207th place
136th place
69th place
59th place

archive-it.org

wayback.archive-it.org

  • R. G. Gallager, P. A. Humblet, and P. M. Spira (January 1983). "A Distributed Algorithm for Minimum-Weight Spanning Trees" (PDF). ACM Transactions on Programming Languages and Systems. 5 (1): 66–77. doi:10.1145/357195.357200. S2CID 2758285. Archived from the original (PDF) on 2016-10-12. Retrieved 2007-09-30.{{cite journal}}: CS1 maint: multiple names: authors list (link)

arxiv.org

doi.org

  • R. G. Gallager, P. A. Humblet, and P. M. Spira (January 1983). "A Distributed Algorithm for Minimum-Weight Spanning Trees" (PDF). ACM Transactions on Programming Languages and Systems. 5 (1): 66–77. doi:10.1145/357195.357200. S2CID 2758285. Archived from the original (PDF) on 2016-10-12. Retrieved 2007-09-30.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  • Ephraim Korach, Shay Kutten, Shlomo Moran (1990). "A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms". ACM Transactions on Programming Languages and Systems. 12 (1): 84–101. CiteSeerX 10.1.1.139.7342. doi:10.1145/77606.77610. S2CID 9175968.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  • Haeupler, Bernhard; Ghaffari, Mohsen (2013). Near Optimal Leader Election in Multi-Hop Radio Networks. pp. 748–766. arXiv:1210.8439. doi:10.1137/1.9781611973105.54. ISBN 978-1-61197-251-1. S2CID 9976342. {{cite book}}: |journal= ignored (help)

mit.edu

theory.csail.mit.edu

  • R. G. Gallager, P. A. Humblet, and P. M. Spira (January 1983). "A Distributed Algorithm for Minimum-Weight Spanning Trees" (PDF). ACM Transactions on Programming Languages and Systems. 5 (1): 66–77. doi:10.1145/357195.357200. S2CID 2758285. Archived from the original (PDF) on 2016-10-12. Retrieved 2007-09-30.{{cite journal}}: CS1 maint: multiple names: authors list (link)

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

  • R. G. Gallager, P. A. Humblet, and P. M. Spira (January 1983). "A Distributed Algorithm for Minimum-Weight Spanning Trees" (PDF). ACM Transactions on Programming Languages and Systems. 5 (1): 66–77. doi:10.1145/357195.357200. S2CID 2758285. Archived from the original (PDF) on 2016-10-12. Retrieved 2007-09-30.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  • Ephraim Korach, Shay Kutten, Shlomo Moran (1990). "A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms". ACM Transactions on Programming Languages and Systems. 12 (1): 84–101. CiteSeerX 10.1.1.139.7342. doi:10.1145/77606.77610. S2CID 9175968.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  • Haeupler, Bernhard; Ghaffari, Mohsen (2013). Near Optimal Leader Election in Multi-Hop Radio Networks. pp. 748–766. arXiv:1210.8439. doi:10.1137/1.9781611973105.54. ISBN 978-1-61197-251-1. S2CID 9976342. {{cite book}}: |journal= ignored (help)