{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:07Z","timestamp":1725664027579},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:16Z","timestamp":1330253776000},"page":"264-276","source":"Crossref","is-referenced-by-count":3,"title":["Message terminate algorithms for anonymous rings of unknown size"],"prefix":"10.1007","author":[{"given":"Israel","family":"Cidon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Shavitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson, A. Adler, L. Higham, and D. Kirkpatrick. Randomized function evaluation on a ring. In J. van Leeuwen, editor, Proceedings, 2nd International Workshop on Distributed Algorithms, pages 324\u2013331, July 1987. Lecture Notes in Computer Science, Vol. 312.","DOI":"10.1007\/BFb0019812"},{"key":"18_CR2","unstructured":"K. Abrahamson, A. Adler, L. Higham, and D. Kirkpatrick. Optimal algorithms for probabilistic solitude detection on anonymous rings. Technical report TR 90-3, University of British Columbia, 1990."},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0196-6774(91)90002-G","volume":"12","author":"H. Attiya","year":"1991","unstructured":"H. Attiya and M. Snir. Better computing on the anonymous ring. Journal of Algorithms, 12(2):204\u2013238, June 1991.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"18_CR4","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"H. Attiya, M. Snir, and M. K. Warmuth. Computing on the anonymous ring. Journal of the ACM, 35(4):845\u2013875, 1988.","journal-title":"Journal of the ACM"},{"key":"18_CR5","volume-title":"EE Pub. 793","author":"I. Cidon","year":"1991","unstructured":"I. Cidon and Y. Shavitt. Message terminate algorithms for rings of unknown size. EE Pub. 793, Technion-Israel Institute of Technology, Dept. of Electrical Engineering, Haifa 32000, ISRAEL, August 1991."},{"key":"18_CR6","unstructured":"D. H. Greene and D. E. Knuth. Mathematics for the Analysis of Algorithms. Birkhauser, second edition, 1982."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Jalfon. Uniform self stabilizing ring orientation. Information and Computation, 1991. to be published.","DOI":"10.1007\/3-540-54099-7_1"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"A. Itai and M. Rodeh. Symmetry breaking in distributed networks. In Proceedings of the 22nd annual IEEE symp. of fundations of computer science (FOCS), pages 150\u2013158, 1981.","DOI":"10.1109\/SFCS.1981.41"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Information and Computation, 88(1), September 1990.","DOI":"10.1016\/0890-5401(90)90004-2"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"S. Moran and M. K. Warmuth. Gap theorms for distributed computation. In Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 141\u2013150, 1986.","DOI":"10.1145\/10590.10602"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0196-6774(87)90027-7","volume":"8","author":"J. K. Pachl","year":"1987","unstructured":"J. K. Pachl. A lower bound for probabilistic distributed algorithms. Journal of Algorithms, 8:53\u201365, 1987.","journal-title":"Journal of Algorithms"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"B. Schieber and M. Snir. Calling names on nameless networks. In Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 319\u2013328, 1989.","DOI":"10.1145\/72981.73004"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:50Z","timestamp":1605646970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}