{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:05:10Z","timestamp":1725728710058},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184782"},{"type":"electronic","value":"9783662011102"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/978-3-662-01110-2_6","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T16:05:22Z","timestamp":1370275522000},"page":"82-88","source":"Crossref","is-referenced-by-count":1,"title":["New lower bounds for distributed leader finding in asynchronous rings of processors"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Distributed computing, Structure and Complexity, Ph. D. Thesis","author":"HL Bodlaender","year":"1986","unstructured":"Bodlaender, H.L., Distributed computing, Structure and Complexity, Ph. D. Thesis, Univ. of Utrecht, Utrecht, 1986."},{"key":"6_CR2","volume-title":"Extremal Graph Theory","author":"B Bollobas","year":"1978","unstructured":"Bollobas, B., Extremal Graph Theory, Academic Press, London, 1978."},{"key":"6_CR3","volume-title":"Rep","author":"JE Burns","year":"1980","unstructured":"Burns, J.E., A formal model for message passing systems, Techn. Rep. 91, Computer Science Dept., Indiana Univ., Bloomington, IN., 1980."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/359104.359108","volume":"22","author":"E Chang","year":"1979","unstructured":"Chang, E., and R. Roberts, An improved algorithm for decentralized extrema-finding in circular configurations of processes, C. ACM 22 (1979) 281\u2013283.","journal-title":"C. ACM"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev, D., M. Klawe, and N. Rodeh, An O(nlogn) unidirectional distributed algorithm for extrema finding in a circle, J. Algorithms 3 (1982) 245\u2013260.","journal-title":"J. Algorithms"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Duris, P., and Z. Galil, Two lower bounds in asynchronous distributed computation, To appear in: Proc. 28th Ann. Symp. on Foundations of Comp. Science,1987.","DOI":"10.1109\/SFCS.1987.60"},{"key":"6_CR7","volume-title":"Average case behaviour of distributed extrema-finding algorithms, Report ACT-49\/T-147","author":"P Everhardt","year":"1984","unstructured":"Everhardt, P., Average case behaviour of distributed extrema-finding algorithms, Report ACT-49\/T-147, Coordinated Science Lab., University of Illinois at U.C., 1984."},{"key":"6_CR8","volume-title":"personal communication","author":"Flayolet","year":"1986","unstructured":"Flayolet, P., personal communication, 1986."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Franklin, W.R., On an improved algorithm for decentralized extrema-finding in circular configurations of processors, C. ACM25 (1982) 336\u2013337.","DOI":"10.1145\/358506.358517"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N., and N.A. Lynch, Electing a leader in a synchronous ring, J. ACM 34 (1987) 98\u2013115.","journal-title":"J. ACM"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"RG Gallager","year":"1983","unstructured":"Gallager, R.G., P.A. Humblet, and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM. Trans. Prog. Lang. Syst. 5 (1983) 66\u201377.","journal-title":"Trans. Prog. Lang. Syst"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"Hirschberg, D.S1, and J. B. Sinclair","year":"1980","unstructured":"Hirschberg, D.S1, and J. B. Sinclair, Decentralized extrema-finding in circular configurations of processors, C. ACM 23 (1980) 627\u2013628.","journal-title":"C. ACM"},{"key":"6_CR13","volume-title":"A probabilistic algorithm for decentralized extrema-finding in a circular configuration of processors, Res. Rep. CS-81-19, Dept. of Computer Science","author":"E Korach","year":"1981","unstructured":"Korach, E., D. Rotem, and N. Santoro, A probabilistic algorithm for decentralized extrema-finding in a circular configuration of processors, Res. Rep. CS-81\u201319, Dept. of Computer Science, Univ. of Waterloo, Waterloo, 1981."},{"key":"6_CR14","first-page":"115","volume":"16","author":"E Korach","year":"1984","unstructured":"Korach, E., D. Rotem, and N. Santoro, Distributed election without a sense of orientation, Internat. J. Comput. Math. 16 (1984) 115\u2013124.","journal-title":"J. Comput. Math"},{"key":"6_CR15","volume-title":"manuscript","author":"S Moran","year":"1985","unstructured":"Moran, S., M. Shalom, and S. Zaks, An algorithm for distributed leader finding in bidirectional rings without common sense of direction, manuscript, 1985."},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachl","year":"1984","unstructured":"Pachl, J., E. Korach, and D. Rotem, Lowerbounds for distributed maximum-finding algorithms, J. ACM31 (1984) 905\u2013918.","journal-title":"J. ACM"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0196-6774(87)90027-7","volume":"8","author":"JK Pachl","year":"1987","unstructured":"Pachl, J. K., A lowerbound for probabilistic distributed algorithms, J. Algorithms 8 (1987) 53\u201365.","journal-title":"J. Algorithms"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"GL Peterson","year":"1982","unstructured":"Peterson, G.L., An O(nlogn) unidirectional algorithm for the circular extrema problem, ACM Trans. Prog. Lang. e.4 Syst. 4 (1982) 758\u2013762.","journal-title":"ACM Trans. Prog. Lang. e.4 Syst."},{"key":"6_CR19","volume-title":"An improved upperbound for decentralized extrema-finding in bidirectional rings of processors, Tech. Rep. RUU-CS-85-23, Dept. of Computer Science","author":"J van Leeuwen","year":"1985","unstructured":"van Leeuwen, J., and R.B. Tan, An improved upperbound for decentralized extrema-finding in bidirectional rings of processors, Tech. Rep. RUU-CS-85\u201323, Dept. of Computer Science, Univ. of Utrecht, Utrecht, 1985."}],"container-title":["Informatik-Fachberichte","GI \u2014 17. Jahrestagung Computerintegrierter Arbeitsplatz im B\u00fcro"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-01110-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T13:36:50Z","timestamp":1557754610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-01110-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184782","9783662011102"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-01110-2_6","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1987]]}}}