{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:27Z","timestamp":1725467907062},"publisher-location":"New York, NY","reference-count":13,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387968186"},{"type":"electronic","value":"9780387347707"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[[1988]]},"DOI":"10.1007\/bfb0040400","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T20:03:50Z","timestamp":1154549030000},"page":"329-338","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Better computing on the anonymous ring"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[]},{"given":"Marc","family":"Snir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"D. Angluin, \u201cLocal and Global Properties in Networks of Processors,\u201d 12th Ann. ACM Symp. on Theory of Computing, (1980) 82\u201393.","DOI":"10.1145\/800141.804655"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"H. Attiya and M. Snir \u201cBetter Computing on the Anonymous Ring,\u201d Research Report, IBM T. J. Watson Res. Center, April 1988.","DOI":"10.1145\/48014.48247"},{"key":"33_CR3","unstructured":"H. Attiya, M. Snir and M. Warmuth, \u201cComputing on the Anonymous Ring,\u201d J. of the ACM, to appear."},{"key":"33_CR4","unstructured":"H. Bodleander, \u201cDistributed Algorithms: Structure and Complexity,\u201d Ph.D. Thesis, University of Utrecht, 1986."},{"key":"33_CR5","first-page":"223","volume":"23","author":"H. Chernoff","year":"1983","unstructured":"H. Chernoff, \u201cA Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations,\u201d Annals of Math. Stat., 23 (1983) 223\u2013234.","journal-title":"Annals of Math. Stat."},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/359104.359108","volume":"22","author":"E. Chang","year":"1979","unstructured":"E. Chang and R. Roberts, \u201cAn Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations,\u201d Comm. of the ACM, 22 (1979) 281\u2013283.","journal-title":"Comm. of the ACM"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"P. Duris and Z. Galil, \u201cTwo Lower Bounds in Asynchronous Distributed Computation,\u201d proceedings, 28th Ann. IEEE Symp. on Foundations of Computer Science, (1987) 326\u2013330.","DOI":"10.1109\/SFCS.1987.60"},{"key":"33_CR8","volume-title":"An Introduction to Probability Theory and its Applications","author":"W. Feller","year":"1968","unstructured":"W. Feller, An Introduction to Probability Theory and its Applications, Third Edition, Vol. 1. John Wiley & Sons Inc., New York, 1968.","edition":"Third Edition"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0196-6774(87)90027-7","volume":"8","author":"J. Pachl","year":"1987","unstructured":"J. Pachl, \u201cA Lower Bound for Probabilistic Distributed Algorithm,\u201d J. of Algorithms, 8 (1987) 53\u201365.","journal-title":"J. of Algorithms"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachl","year":"1984","unstructured":"J. Pachl, E. Korach and D. Rotem, \u201cA New Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms,\u201d J. ACM, 31 (1984) 905\u2013918.","journal-title":"J. ACM"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(82)90010-1","volume":"25","author":"M. Rabin","year":"1982","unstructured":"M. Rabin, \u201cN-Process Synchronization by 4 Log2\n                N-Valued Shared Variable,\u201d J. of Computer and System Sciences, 25 (1982) 66\u201375.","journal-title":"J. of Computer and System Sciences"},{"key":"33_CR12","unstructured":"P. Raghavan, \u201cRandomized Rounding and Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and packing Problems,\u201d Report UCB\/CSD 87\/312, Comp. Sc. Div., Univ. of California Berkeley, July 1986."},{"key":"33_CR13","unstructured":"V. Syrotiuk and J. Pachl, \u201cAverage Complexity of a Distributed Orientation Algorithm,\u201d Research Report CS-87-23, Univ. of Waterloo, March 1987."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T15:53:16Z","timestamp":1578498796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040400"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780387968186","9780387347707"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0040400","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}