{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:36Z","timestamp":1725455616935},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540537090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0020805","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:07:52Z","timestamp":1131862072000},"page":"275-284","source":"Crossref","is-referenced-by-count":3,"title":["Optimal tradeoffs between time and bit complexity in distributed synchronous rings"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Schmeltz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"G. Frederickson","year":"1987","unstructured":"G. Frederickson, N. Lynch, Electing a leader in a synchonous ring, J. ACM 34, 1987, pp. 98\u2013115.","journal-title":"J. ACM"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen, N. Santoro, J. Urrutria, S. Zaks, Guessing games and distributed computations in anonymous networks, Proc. 14th ICALP, 1987, pp 346\u2013356.","DOI":"10.1007\/3-540-18088-5_29"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"M. Overmars, N. Santoro, Time vs bits, an improved algorithm for leader election in synchronous rings, 6th STACS, 1989, pp 282\u2013293.","DOI":"10.1007\/BFb0028992"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachl","year":"1984","unstructured":"J. Pachl, E. Korach, D. Rotem, Lower bounds for distributed maximum finding algorithms, J. ACM 31, 1984, pp 905\u2013918.","journal-title":"J. ACM"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G. Peterson","year":"1982","unstructured":"G. Peterson, An O(n log n) unidirectional algorithm for the circular extrema problem, ACM Trans. Prog. Lang. Syst. 4, 1982, pp 758\u2013762.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"P. Vitanyi, Distributed elections in an Archimedian ring of processors, Proc. 16th SToC, 1984, pp 542\u2013547.","DOI":"10.1145\/800057.808725"}],"container-title":["Lecture Notes in Computer Science","STACS 91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020805.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:45:06Z","timestamp":1607550306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540537090"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0020805","relation":{},"subject":[]}}