{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T04:30:25Z","timestamp":1775190625917,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0196-6774(91)90002-g","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"204-238","source":"Crossref","is-referenced-by-count":39,"title":["Better computing on the anonymous ring"],"prefix":"10.1016","volume":"12","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[]},{"given":"Marc","family":"Snir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(91)90002-G_BIB1","series-title":"Proceedings, 2nd International Workshop on Distributed Algorithms","first-page":"324","article-title":"Randomized function evaluation on a ring","volume":"Vol. 312","author":"Abrahamson","year":"1987"},{"key":"10.1016\/0196-6774(91)90002-G_BIB2","article-title":"Probabilistic Evaluation of Common Function on Rings of Known Size","author":"Abrahamson","year":"1988"},{"key":"10.1016\/0196-6774(91)90002-G_BIB3","series-title":"Proceedings, 12th Annual ACM Symp. on Theory of Computing","first-page":"82","article-title":"Local and global properties in networks of processors","author":"Angluin","year":"1980"},{"key":"10.1016\/0196-6774(91)90002-G_BIB4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"19","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"issue":"No. 4","key":"10.1016\/0196-6774(91)90002-G_BIB5","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/48014.48247","article-title":"Computing on the anonymous ring","volume":"35","author":"Attiya","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(91)90002-G_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/323596.323614","article-title":"Computing on the Anonymous Ring","author":"Attiya","year":"1985"},{"key":"10.1016\/0196-6774(91)90002-G_BIB7","article-title":"Distributed Algorithms: Structure and Complexity","author":"Bodlaender","year":"1986"},{"key":"10.1016\/0196-6774(91)90002-G_BIB8","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0196-6774(91)90002-G_BIB9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/359104.359108","article-title":"An improved algorithm for decentralized extrema-finding in circular configurations","volume":"22","author":"Chang","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(91)90002-G_BIB10","series-title":"Proceedings, 28th Annual IEEE Symposium on Foundations of Computer Science","first-page":"326","article-title":"Two lower bounds in asynchronous distributed computation","author":"Duris","year":"1987"},{"key":"10.1016\/0196-6774(91)90002-G_BIB11","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0196-6774(91)90002-G_BIB12","volume":"Vol. 1","author":"Feller","year":"1968"},{"key":"10.1016\/0196-6774(91)90002-G_BIB13","article-title":"Randomized Distributed Computing on Rings","author":"Higham","year":"1988"},{"key":"10.1016\/0196-6774(91)90002-G_BIB14","series-title":"Proceedings, 5th ACM Symposium on Principles of Distributed Computations","first-page":"141","article-title":"Gap theorems for distributed computation","author":"Moran","year":"1986"},{"key":"10.1016\/0196-6774(91)90002-G_BIB15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0196-6774(87)90027-7","article-title":"A lower bound for probabilistic distributed algorithm","volume":"8","author":"Pachl","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(91)90002-G_BIB16","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","article-title":"A new technique for proving lower bounds for distributed maximum-finding algorithms","volume":"31","author":"Pachl","year":"1984","journal-title":"J. Assoc. Compt. Mach"},{"key":"10.1016\/0196-6774(91)90002-G_BIB17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(82)90010-1","article-title":"N-process synchronization by 4 \u00b7 log2N-valued shared variable","volume":"25","author":"Rabin","year":"1982","journal-title":"J. Compt. System Sci."},{"key":"10.1016\/0196-6774(91)90002-G_BIB18","article-title":"Randomized Rounding and Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and Packing Problems","author":"Raghavan","year":"1986"},{"key":"10.1016\/0196-6774(91)90002-G_BIB19","series-title":"Proceedings, 2nd International Workshop on Distributed Algorithms, Amsterdam, Netherlands, July 1987","first-page":"332","article-title":"Average complexity of a distributed orientation algorithm","volume":"Vol. 312","author":"Syrotiuk","year":"1987"},{"key":"10.1016\/0196-6774(91)90002-G_BIB20","series-title":"18th Annual Symposium on Foundations of Computer Science","first-page":"222","article-title":"Probabilistic computations: Toward a unified measure of complexity","author":"Yao","year":"1977"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190002G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190002G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:53:54Z","timestamp":1548744834000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749190002G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["019667749190002G"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90002-g","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}