{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T10:27:47Z","timestamp":1790418467817,"version":"4.1.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2007,3,7]],"date-time":"2007-03-07T00:00:00Z","timestamp":1173225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2007,3,23]]},"DOI":"10.1007\/s00446-007-0022-4","type":"journal-article","created":{"date-parts":[[2007,3,6]],"date-time":"2007-03-06T12:56:54Z","timestamp":1173185814000},"page":"403-418","source":"Crossref","is-referenced-by-count":17,"title":["Randomized leader election"],"prefix":"10.1007","volume":"19","author":[{"given":"Murali Krishna","family":"Ramanathan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronaldo A.","family":"Ferreira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suresh","family":"Jagannathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ananth","family":"Grama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,3,7]]},"reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0020-0190(97)00145-2","volume":"64","author":"D. Agrawal","year":"1997","unstructured":"Agrawal D., Egecioglu \u00d6. and Abbadi A.E. (1997). Billiard quorums on the grid. Inf. Process. Lett. 64(1): 9\u201316","journal-title":"Inf. Process. Lett."},{"key":"22_CR2","unstructured":"Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical Report, CS Department, Stanford University (2003)"},{"issue":"4","key":"22_CR3","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1137\/S0036144503423264","volume":"46","author":"S. Boyd","year":"2004","unstructured":"Boyd S., Diaconis P. and Xiao L. (2004). Fastest mixing markov chain on a graph. SIAM Rev. 46(4): 667\u2013689","journal-title":"SIAM Rev."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Cidon, I., Mokryn, O.: Propagation and leader election in a multihop broadcast environment. In: DISC \u201998 Proceedings of the 12th international symposium on distributed computing, pp. 104\u2013118, Springer, London (1998)","DOI":"10.1007\/BFb0056477"},{"issue":"1","key":"22_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev D., Dwork C. and Stockmeyer L. (1987). On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77\u201397","journal-title":"J. ACM"},{"issue":"2","key":"22_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.jpdc.2005.09.002","volume":"66","author":"R.A. Ferreira","year":"2006","unstructured":"Ferreira R.A., Grama A. and Jagannathan S. (2006). Plethora: a locality enhancing peer-to-peer network. J. Parallel Distrib. Comput. 66(2): 257\u2013273","journal-title":"J. Parallel Distrib. Comput."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Ferreira, R.A., Ramanathan, M.K., Grama, A., Jagannathan, S.: Randomized protocols for duplicate elimination in peer-to-peer storage systems. In: Proceedings of The Fifth IEEE international conference on peer-to-peer computing, Konstanz, Germany (2005)","DOI":"10.1109\/P2P.2005.30"},{"issue":"5","key":"22_CR8","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/32.815321","volume":"25","author":"C. Fetzer","year":"1999","unstructured":"Fetzer C. and Cristian F. (1999). A highly available local leader election service. IEEE Trans. Softw. Eng. 25(5): 603\u2013618","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"22_CR9","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson G.N. and Lynch N.A. (1987). Electing a leader in a synchronous ring. J. ACM 34(1): 98\u2013115","journal-title":"J. ACM"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of IEEE INFOCOM, 2004, Hong Kong (2004)","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"22_CR11","unstructured":"Gnutella. http:\/\/gnutella.wego.com\/"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, I., Renesse, R., Birman, K.P.: A probabilistically correct leader election protocol for large groups. In: DISC \u201900 Proceedings of the 14th international conference on distributed computing, pp. 89\u2013103, Springer, London (2000)","DOI":"10.1007\/3-540-40026-5_6"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"W. Hastings","year":"1970","unstructured":"Hastings W. (1970). Monte carlo sampling methods using markov chains and their applications. Biometrika 57: 97\u2013109","journal-title":"Biometrika"},{"issue":"5","key":"22_CR14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.ipl.2003.08.011","volume":"88","author":"K. Horowitz","year":"2003","unstructured":"Horowitz K. and Malkhi D. (2003). Estimating network size from local information. IPL J. 88(5): 237\u2013243","journal-title":"IPL J."},{"issue":"4","key":"22_CR15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/PL00008918","volume":"13","author":"Y. Joung","year":"2000","unstructured":"Joung Y. (2000). Asynchronous group mutual exclusion. Distrib. Comput. 13(4): 189\u2013206","journal-title":"Distrib. Comput."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J.: Choosing a random peer. In: PODC \u201904 Proceedings of the twenty-third annual ACM symposium on principles of distributed computing. pp. 125\u2013130, New York (2004)","DOI":"10.1145\/1011767.1011786"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Rabin, M.O.: Randomized mutual exclusion algorithms revisited. In: PODC \u201992 Proceedings of the eleventh annual ACM symposium on principles of distributed computing. pp. 275\u2013283 (1992)","DOI":"10.1145\/135419.135468"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Lin, S., Lian, Q., Chen, M., Zhang, Z.: A practical distributed mutual exclusion protocol in dynamic peer-to-peer systems. In IPTPS, pp. 11\u201321 (2004)","DOI":"10.1007\/978-3-540-30183-7_2"},{"key":"22_CR19","unstructured":"Lynch, N.A.: Distributed algorithms. Morgan Kaufmann Publishers, Inc. (1996)"},{"issue":"2","key":"22_CR20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"Maekawa M. (1985). A $${\\sqrt{N}}$$ algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2): 145\u2013159","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"22_CR21","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1006\/inco.2001.3054","volume":"170","author":"D. Malkhi","year":"2001","unstructured":"Malkhi D., Reiter M., Wool A. and Wright R. (2001). Probabilistic quorum systems. Inform. Comput. 170(2): 184\u2013206","journal-title":"Inform. Comput."},{"key":"22_CR22","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis N., Rosenbluth A., Rosenbluth M., Teller A. and Teller E. (1953). Equations of state calculations by fast computing machines. J. Chem. Phys. 21: 1087\u20131092","journal-title":"J. Chem. Phys."},{"key":"22_CR23","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01762123","volume":"3","author":"S.J. Mullender","year":"1988","unstructured":"Mullender S.J. and Vitanyi P.M.B. (1988). Distributed match-making. Algorithmica 3: 367\u2013391","journal-title":"Algorithmica"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Psaltoulis, D., Kostoulas, D., Gupta, I., Birman, K., Demers, A.: Practical algorithms for size estimation in large and dynamic groups. Springlass project at Cornell (2004)","DOI":"10.1109\/NCA.2005.15"},{"issue":"1","key":"22_CR25","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(82)90010-1","volume":"25","author":"M.O. Rabin","year":"1982","unstructured":"Rabin M.O. (1982). N-process mutual exclusion with bounded waiting by 4log 2 N valued shared variable. J. Comput. Syst. Sci. 25(1): 66\u201375","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M. Karp, R.M., Shenker, S.: A scalable content-addressable network. In: SIGCOMM \u201901 Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 161\u2013172, New York (2001)","DOI":"10.1145\/383059.383072"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware 2001 Proceedings of the IFIP\/ACM international conference on distributed systems platforms Heidelberg, pp. 329\u2013350, Springer, London (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"22_CR28","unstructured":"Schooler, E.M., Manohar, R., Chandy, K.M.: An analysis of leader election for multicast groups. Technical Report, ATT Labs-Research, Menlo Park (2002)"},{"issue":"1","key":"22_CR29","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica I., Morris R., Liben-Nowell D., Karger D.R., Kaashoek M.F., Dabek F. and Balakrishnan H. (2003). Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw. 11(1): 17\u201332","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"22_CR30","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032770","volume-title":"Average case analysis of algorithms on sequences","author":"W. Szpankowki","year":"2001","unstructured":"Szpankowki W. (2001). Average case analysis of algorithms on sequences. Wiley, New York"},{"key":"22_CR31","volume-title":"Distributed systems: principles and paradigms","author":"A.S. Tanenbaum","year":"2002","unstructured":"Tanenbaum A.S. and Steen M.V. (2002). Distributed systems: principles and paradigms. Prentice Hall, Englewood Cliffs"},{"key":"22_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0020419","volume-title":"Introduction to distributed algorithms","author":"G. Tel","year":"1994","unstructured":"Tel G. (1994). Introduction to distributed algorithms. Cambridge University Press, Cambridge"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0022-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-007-0022-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0022-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:36Z","timestamp":1559121996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-007-0022-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,7]]},"references-count":32,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2007,3,23]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1007\/s00446-007-0022-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,7]]}}}