{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:02Z","timestamp":1725455702892},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020432","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"164-178","source":"Crossref","is-referenced-by-count":1,"title":["Finding the extrema of a distributed multiset"],"prefix":"10.1007","author":[{"given":"P.","family":"Alimonti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Flocchini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"P. Alimonti, P. Flocchini, N. Santoro: Finding the Extrema of a Distributed Multiset. Tec. Rep. n. TR-238 Carleton University (1994)","DOI":"10.1007\/BFb0020432"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"H. Attiya, M. Snir, M.K. Warmuth: Computing on an Anonymous Ring. Proc. of 4th ACM Symposium on Principles of Distributed Computing (1985) 196\u2013203","DOI":"10.1145\/323596.323614"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"H. Attiya, M. Snir, M.K. Warmuth: Computing on an Anonymous Ring. Journal of the ACM 35 (4) (1988) 845\u2013875","journal-title":"Journal of the ACM"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01783661","volume":"4","author":"A. Bar-Noi","year":"1990","unstructured":"A. Bar-Noi, J. Naor, M. Naor: One Bit Algorithms. Distributed Computing 4 (1) (1990) 3\u20138","journal-title":"Distributed Computing"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(91)90193-6","volume":"81","author":"H.L. Bodlaender","year":"1991","unstructured":"H.L. Bodlaender: New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Ring Processors. Theoretical Computer Science 81 (1991) 237\u2013256","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(90)90187-3","volume":"36","author":"H.L. Bodlaender","year":"1990","unstructured":"H.L. Bodlaender, G. Tel: Bit-optimal Election in Synchronous Rings. Information Processing Letters 36 (1) (1990) 53\u201356","journal-title":"Information Processing Letters"},{"key":"13_CR7","unstructured":"J. Burns: A Formal Model for Message Passing Systems. Technical Report UTR-91, Indiana University (1981)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D. Dolev","year":"1986","unstructured":"D. Dolev, M. Klawe, M. Rodeh: An O(n log n) Unidirectional Algorithm for Extrema Finding in a Circle. Journal of Algorithms 3 (1986) 245\u2013260","journal-title":"Journal of Algorithms"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/7531.7919","volume":"34","author":"G.N. Frederickson","year":"1987","unstructured":"G.N. Frederickson, N.A. Lynch: Electing a Leader in a Synchronous Ring. Journal of the ACM. 34 (1) (1987) 95\u2013115","journal-title":"Journal of the ACM"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"E. Gafni: Improvements in the Time Complexity of two Message-Optimal Election Algorithms. Proc. of 4th ACM Symposium on Principles of Distributed Computing (1985) 175\u2013185","DOI":"10.1145\/323596.323612"},{"key":"13_CR11","first-page":"347","volume":"267","author":"J. Leeuwen van","year":"1987","unstructured":"J. van Leeuwen, N. Santoro, J. Urrutia. S. Zaks: Guessing Games and Distributed Computations in Synchronous Networks. Proc. of 14th International Colloquium on Automata, Languages and Programming 267 (1987) 347\u2013356","journal-title":"Languages and Programming"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(87)90018-1","volume":"54","author":"A. Marchetti-Spaccamela","year":"1987","unstructured":"A. Marchetti-Spaccamela: New Protocols for the Election of a Leader in a Ring. The oretical Computer Science 54 (1) (1987) 53\u201364","journal-title":"The oretical Computer Science"},{"key":"13_CR13","unstructured":"U.M. O'Reilly, N. Santoro: The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence. Proc. of 18th International Workshop on Graph-Theoretic Concepts in Computer Science, (1992) 321\u2013332"},{"key":"13_CR14","unstructured":"M. Overmars, N. Santoro: Time vs bits: an Improved Bounds for Leader Election in Synchronous Rings. Proc. of 6th Symposium on Theoretical Aspects of Computer Science (1989) 282\u2013293"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachl","year":"1984","unstructured":"J. Pachl, D. Rotem, E. Korach: Lower bounds for Distributed Maximum Finding algorithms. Journal of the ACM 31 (1984) 380\u2013401","journal-title":"Journal of the ACM"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G.L. Peterson","year":"1982","unstructured":"G.L. Peterson: An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. ACM Transaction on Programming, Languages and Systems 4 (1982) 758\u2013762.","journal-title":"ACM Transaction on Programming, Languages and Systems"},{"key":"13_CR17","unstructured":"N. Santoro, D. Rotem: On the Complexity of Distributed Elections in Synchronous Graphs. Proc. of 11th International Workshop on Graph-Theoretic Concepts in ComputerScience (1985) 337\u2013346"},{"key":"13_CR18","unstructured":"B. Schmeltz: Optimal Tradeoffs between Time and Bit Complexity in Synchronous Rings. Proc. of 10th Symposium on Theoretical Aspects of Computer Science (1990) 275\u2013284"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"P. Spirakis, B. Tampakas: Efficient Distributed Algorithms by using the Archimedean Time Assumption. Proc. of 5th Symposium on Theoretical Aspects of Computer Science (1988) 248\u2013263","DOI":"10.1007\/BFb0035849"},{"key":"13_CR20","unstructured":"P. Vitanyi: Distributed Elections in an Archimedean Ring of Entities. Proc. of 16th ACM Symposium on Theory of Computing (1984) 542\u2013547"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:45:55Z","timestamp":1586551555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0020432","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}