{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:00Z","timestamp":1742617140537,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540516873"},{"type":"electronic","value":"9783540467502"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51687-5_27","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:12:30Z","timestamp":1330204350000},"page":"1-12","source":"Crossref","is-referenced-by-count":8,"title":["Random leaders and random spanning trees"],"prefix":"10.1007","author":[{"given":"Judit","family":"Bar-Ilan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dror","family":"Zernik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y. and Gafni, E., Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks, PODC 1985, pp 199\u2013207.","DOI":"10.1145\/323596.323613"},{"key":"1_CR2","unstructured":"Aho, V. A., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Linear Time Distributed Algorithms for Minimum Spanning Trees, leader election, counting and related problems, 19th STOC, 1987, pp. 230\u2013240.","DOI":"10.1145\/28395.28421"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Broder, A. Z., Generating Random Spanning Trees, To appear in 30th FOCS, 1989.","DOI":"10.1109\/SFCS.1989.63516"},{"key":"1_CR5","unstructured":"Biggs, N., Algebraic Graph Theory"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Broder, A. Z. and Karlyn, A. R., Bounds on Cover Time 29th FOCS, 1988.","DOI":"10.1109\/SFCS.1988.21964"},{"key":"1_CR7","unstructured":"Burns, J. E., A Formal Model for Message Passing Systems, TR-91, Indiana University, 1980."},{"key":"1_CR8","unstructured":"Even, S., Graph Algorithms, Maryland, Computer Science Press, 1979."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Fredrickson, G. N. and Lynch N. A., The Impact of Synchronous Communication On the Problem of Electing a Leader in a Ring, STOC84, pp. 493\u2013503.","DOI":"10.1145\/800057.808719"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Gafni, E., Improvements in the Time Complexity of Two Message-Optimal Election Algorithms, PODC85, pp 175\u2013184.","DOI":"10.1145\/323596.323612"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. G. Gallager","year":"1983","unstructured":"Gallager, R. G., Humblet, P. A. and Spira, P. M., A Distributed Algorithm for Minimum Weight Spanning Trees, ACM Trans. Program. Lang. Syst., vol 5. pp. 66\u201377, January 1983.","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0196-6774(83)90022-6","volume":"4","author":"A. Guenoche","year":"1983","unstructured":"Guenoche, A., Random Spanning Trees, J. Algorithm, vol 4, pp. 214\u2013220, 1983.","journal-title":"J. Algorithm"},{"key":"1_CR13","unstructured":"Harary, F., Graph Theory Addison-Wesley, 1972."},{"key":"1_CR14","unstructured":"Kemeny, J.G and Snell, J.L., Finite Markov Chains Lect. Notes in Math, vol 69."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Mulmuley, K., Vazirani, U. V. and Vazirani, V. J., Matching is as Easy as Matrix Inversion, 19th STOC, 1987, pp. 345\u2013354.","DOI":"10.1145\/28395.383347"},{"issue":"3","key":"1_CR16","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","volume":"16","author":"M. J. Quinn","year":"1984","unstructured":"Quinn, M. J. and Narsingh Deo, Parallel Graph Algorithms, Computing Surveys, vol 16. No. 3, September 1984, pp 319\u2013348.","journal-title":"Computing Surveys"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Vitanyi, P., Distributed Election in an Archimedian Ring of Processors, STOC84, pp 542\u2013547.","DOI":"10.1145\/800057.808725"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51687-5_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:56:35Z","timestamp":1742590595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51687-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540516873","9783540467502"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-51687-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}