{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T02:08:02Z","timestamp":1706321282370},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":[[1989,9]]},"DOI":"10.1007\/bf01784021","type":"journal-article","created":{"date-parts":[[2005,6,20]],"date-time":"2005-06-20T01:59:56Z","timestamp":1119232796000},"page":"107-117","source":"Crossref","is-referenced-by-count":7,"title":["Randomized function evaluation on a ring"],"prefix":"10.1007","volume":"3","author":[{"given":"Karl","family":"Abrahamson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Adler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Higham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01784021_CR1","unstructured":"Abrahamson, K, Adler A, Higham L, Kirkpatrick D (1986a) Probabilistic solitude detection II: rings size known exactly. Tech Rep 86-26, University of British Columbia"},{"key":"BF01784021_CR2","doi-asserted-by":"crossref","unstructured":"Abrahamson K, Adler A, Higham L, Kirkpatrick D (1986b) Probabilistic solitude verification on a ring. Proc 5th Annu ACM Symp on Principles of Distributed Computing, pp 161\u2013173","DOI":"10.1145\/10590.10604"},{"key":"BF01784021_CR3","unstructured":"Abrahamson K, Adler A, Higham L, Kirkpatrick D (1987) Probabilistic solitude detection I: rings size known approximately. Tech Rep 87-8, University of British Columbia"},{"key":"BF01784021_CR4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1137\/0218002","volume":"18","author":"K Abrahamson","year":"1989","unstructured":"Abrahamson K, Adler A, Gelbart R, Higham L, Kirkpatrick D (1989) The bit complexity of randomized leader election on a ring. SIAM J Comput 18: 12\u201329","journal-title":"SIAM J Comput"},{"key":"BF01784021_CR5","doi-asserted-by":"crossref","unstructured":"Attiya H, Snir M, Warmuth M (1985) Computing on an anonymous ring. Proc 4th Annu ACM Symp on Principles of Distributed Computing, pp 196\u2013203","DOI":"10.1145\/323596.323614"},{"key":"BF01784021_CR6","doi-asserted-by":"crossref","unstructured":"Attiya H, Snir M (1988) Better computing on the anonymous ring. Proc Aegean Workshop on Computing, pp. 329\u2013338","DOI":"10.1007\/BFb0040400"},{"key":"BF01784021_CR7","unstructured":"Burns J (1980) A formal model for message passing systems. Tech Rep TR-91, Indiana University"},{"key":"BF01784021_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev D, Klawe M, Rodeh M (1982) AnO(n logn) unidirectional distributed algorithm for extrema finding in a circle. J Algorithms 3: 245\u2013260","journal-title":"J Algorithms"},{"key":"BF01784021_CR9","volume-title":"Randomized distributed computing on rings","author":"L Higham","year":"1988","unstructured":"Higham L (1988) Randomized distributed computing on rings. PhD thesis, University of British Columbia, Vancouver, Canada"},{"key":"BF01784021_CR10","unstructured":"Itai A, Rodeh M (1981) Symmetry breaking in distributed networks. Proc 23nd Annu Symp on Foundations of Computer Science, pp 150\u2013158"},{"key":"BF01784021_CR11","doi-asserted-by":"crossref","unstructured":"Mansour Y, Zaks S (1986) On the bit complexity of distributed computations in a ring with a leader. Proc 5th Annu ACM Symp on Principles of Distributed Computing, pp 151\u2013160","DOI":"10.1145\/10590.10603"},{"key":"BF01784021_CR12","doi-asserted-by":"crossref","unstructured":"Moran S, Warmuth M (1986) Gap theorems for distributed computation. Proc 5th Annu ACM Symp on Principles of Distributed Computing, pp 131\u2013140","DOI":"10.1145\/10590.10602"},{"key":"BF01784021_CR13","volume-title":"Introduction to number theory","author":"T Nagell","year":"1951","unstructured":"Nagell T (1951) Introduction to number theory. Wiley, New York"},{"key":"BF01784021_CR14","series-title":"Tech Rep CS-85-25","volume-title":"A lower bound for probabilistic distributed algorithms","author":"J Pachl","year":"1985","unstructured":"Pachl J (1985) A lower bound for probabilistic distributed algorithms. Tech Rep CS-85-25, University of Waterloo, Waterloo, Ontario"},{"key":"BF01784021_CR15","series-title":"Proc 1st Int Workshop on Distributed Algorithms","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1515\/9780773573475-008","volume-title":"Distributed Algorithms on Graphs","author":"J Pachl","year":"1986","unstructured":"Pachl J, Rotem D (1986) Notes on distributed algorithms in unifirectional rings. In: Gafni C, Santor N (eds) Distributed Algorithms on Graphs (Proc 1st Int Workshop on Distributed Algorithms) Carleton University Press, Ottawa, Canada, pp 115\u2013122"},{"key":"BF01784021_CR16","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"J Pachl","year":"1984","unstructured":"Pachl J, Korach E, Rotem D (1984) Lower bounds for distributed maximum finding. J Assoc Comput Mach 31: 905\u2013918","journal-title":"J Assoc Comput Mach"},{"key":"BF01784021_CR17","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G Peterson","year":"1982","unstructured":"Peterson G (1982) AnO (n logn) algorithm for the circular extrema problem. ACM Trans Prog Lang Syst 4: 758\u2013752","journal-title":"ACM Trans Prog Lang Syst"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01784021.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01784021\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01784021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T01:16:50Z","timestamp":1706318210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01784021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["BF01784021"],"URL":"https:\/\/doi.org\/10.1007\/bf01784021","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}