{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:29Z","timestamp":1725663329989},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540991"},{"type":"electronic","value":"9783540474050"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54099-7_4","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:29:03Z","timestamp":1330208943000},"page":"41-56","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Spanning tree construction for nameless networks"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Lavall\u00e9e","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Lavault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"K. ABRAHAMSON, A. ADLER, L. HIGHAM and D. KIRKPATRICK, Probabilistic solitude verification on a ring, Proc. of the 5th ACM Symp. on Principles of Distributed Computing, 161\u2013173, Calgary, August 1986.","DOI":"10.1145\/10590.10604"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01784021","volume":"3","author":"K. Abrahamson","year":"1989","unstructured":"K. ABRAHAMSON, A. ADLER, L. HIGHAM and D. KIRKPATRICK, Randomized function evaluation on a ring, Distributed Computing3, 107\u2013119, Springer-Verlag, 1989.","journal-title":"Distributed Computing"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Y. AFEK, M. SAKS, Detecting global termination conditions in the face of uncertainty, Proc. of the 6th ACM Symp. on Principles of Distributed Computing, 109\u2013124, Vancouver, August 1987.","DOI":"10.1145\/41840.41850"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"D. ANGLUIN, Local and global properties in networks of processors, Proc. 12th Annual ACM Symposium on Theory of Computing, 82\u201393, Los Angeles, May 1980.","DOI":"10.1145\/800141.804655"},{"issue":"4","key":"4_CR5","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"H. ATTIYA, M. SNIR, M. K. WARMUTH, Computing on an Anonymous Ring, J. ACM, Vol. 35, No 4, 845\u2013875, October 1988.","journal-title":"J. ACM"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"A. ITAI, M. RODEH, Symmetry breaking in distributive networks, Proc. of the 22nd IEEE Symp. on the Foundation of Computer Science, 150\u2013158, Nashville, October 1981.","DOI":"10.1109\/SFCS.1981.41"},{"key":"4_CR7","unstructured":"I. LAVALL\u00c9E, C. LAVAULT, Yet another distributed election and spanning tree algorithm, R.R. INRIA No 1024, April 1989."},{"key":"4_CR8","unstructured":"I. LAVALL\u00c9E, C. LAVAULT, Efficient Routing Protocols in Nameless Networks, R.R. INRIA No 1254, June 1990."},{"key":"4_CR9","first-page":"183","volume":"392","author":"Y. Matias","year":"1989","unstructured":"Y. MATIAS, Y. AFEK, Simple and Efficient Election Algorithms for Anonymous Network, Proc. of the 3rd International Workshop on Distributed Algorithm, 183\u2013194, Nice, LNCS 392, Springer-Verlag, September 1989.","journal-title":"Nice, LNCS"},{"key":"4_CR10","unstructured":"A. PAPOULIS, Probabilities, Random variables, and Stochastic Processes, McGraw-Hill, 2nd Edition, 1984."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"B. SCHIEBER, M. SNIR, Calling Names on Nameless Networks, Proc. of the 8th ACM Symp. on Principles of Distributed Computing, 319\u2013328, Edmonton, August 1989.","DOI":"10.1145\/72981.73004"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54099-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:06:38Z","timestamp":1558267598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54099-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540991","9783540474050"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-54099-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}