{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T13:26:45Z","timestamp":1680096405809},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1007\/bf02526036","type":"journal-article","created":{"date-parts":[[2006,11,7]],"date-time":"2006-11-07T23:45:41Z","timestamp":1162943141000},"page":"246-262","source":"Crossref","is-referenced-by-count":3,"title":["Improved bounds for electing a leader in a synchronous ring"],"prefix":"10.1007","volume":"18","author":[{"given":"M.","family":"Overmars","sequence":"first","affiliation":[]},{"given":"N.","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"BF02526036_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(90)90187-3","volume":"36","author":"H. L. Bodlaender","year":"1990","unstructured":"[BT] H. L. Bodlaender, G. Tel, Bit-optimal election in synchronous rings,Information Processing Letters,36(1) (1990), 53\u201364.","journal-title":"Information Processing Letters"},{"key":"BF02526036_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/7531.7919","volume":"34","author":"G. N. Frederickson","year":"1987","unstructured":"[FL] G. N. Frederickson, N. A. Lynch, Electing a leader in a synchronous ring,Journal of the Association for Computing Machinery,34 (1987), 95\u2013115.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02526036_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-16766-8_3","volume-title":"Proc. 2nd Internat. Workshop on Parallel Computing and VLSI","author":"G. N. Frederickson","year":"1986","unstructured":"[FS] G. N. Frederickson, N. Santoro, Symmetry breaking in synchronous networks, inProc. 2nd Internat. Workshop on Parallel Computing and VLSI, Loutraki, July 1986 (F. Makedon, K. Mehlhorn, T. Papatheodorou, P. Spirakis, eds.), Lecture Notes in Computer Science, Vol. 227, Springer-Verlag, Berlin, pp. 26\u201333."},{"key":"BF02526036_CR4","doi-asserted-by":"crossref","unstructured":"[G] E. Gafni, Improvements in the time complexity of two message-optimal election algorithms, inProc. 4th ACM Symp. on Principles of Distributed Computing, Minaki, Aug. 1985, pp. 175\u2013185.","DOI":"10.1145\/323596.323612"},{"key":"BF02526036_CR5","doi-asserted-by":"crossref","unstructured":"[IR] A. Itai, M. Rodeh, Symmetry breaking in synchronous networks, inProc. 22nd IEEE Symp. on Foundations of Computer Science, Nashville, Oct. 1981, pp. 150\u2013158.","DOI":"10.1109\/SFCS.1981.41"},{"key":"BF02526036_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/3-540-18088-5_29","volume-title":"Proc. 14th Internat. Coll. on Automata, Languages and Programming","author":"J. Leeuwen van","year":"1987","unstructured":"[LSUZ] J. van Leeuwen, N. Santoro, J. Urrutia, S. Zaks, Guessing games and distributed computations in synchronous networks, inProc. 14th Internat. Coll. on Automata, Languages and Programming, Karlsruhe, July 1987 (Th. Ottman, ed.), Lecture Notes in Computer Science, Vol. 267, Springer-Verlag, Berlin, pp. 347\u2013356."},{"issue":"1","key":"BF02526036_CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(87)90018-1","volume":"54","author":"A. Marchetti-Spaccamela","year":"1987","unstructured":"[M] A. Marchetti-Spaccamela, New protocols for the election of a leader in a ring,Theoretical Computer Science,54(1) (1987), 53\u201364.","journal-title":"Theoretical Computer Science"},{"key":"BF02526036_CR8","series-title":"Lecture Notes in Computer Science","first-page":"321","volume-title":"Proc. 18th Internat. Workshop on Graphtheoretic Concepts in Computer Science, Wiesbaden, June 1992","author":"U. M. O'Reilly","year":"1992","unstructured":"[ORS] U. M. O'Reilly, N. Santoro, The expressiveness of silence: Optimal algorithms for synchronous communication of information, inProc. 18th Internat. Workshop on Graphtheoretic Concepts in Computer Science, Wiesbaden, June 1992. Lecture Notes in Computer Science, Vol. 657, Springer-Verlag, Berlin, 1992, pp. 321\u2013332."},{"key":"BF02526036_CR9","unstructured":"[Sa] N. Santoro, Computing with time: Temporal dimensions in distributed computing, inProc 28th Allerton Conf. on Communication, Control and Computing, Monticello, Oct. 1990, pp. 558\u2013567."},{"key":"BF02526036_CR10","doi-asserted-by":"crossref","unstructured":"[Sc] B. Schmeltz, Optimal tradeoffs between time and bit complexity in synchronous rings, inProc. 7th Symp. on Theoretical Aspects of Computer Science, 1990, pp. 275\u2013284.","DOI":"10.1007\/BFb0020805"},{"key":"BF02526036_CR11","unstructured":"[SR] N. Santoro, D. Rotem, On the complexity of distributed elections in synchronous graphs, inProc. 11th Internat. Workshop on Graphtheoretic Concepts in Computer Science, June 1985 (H. Noltemeier, ed.), Trauner-Verlag, pp. 337\u2013346."},{"key":"BF02526036_CR12","doi-asserted-by":"crossref","unstructured":"[V] P. Vitanyi, Distributed elections in an Archimedean ring of entities, inProc. 16th ACM Symp. on Theory of Computing, Washington, April 1984, pp. 542\u2013547.","DOI":"10.1145\/800057.808725"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02526036.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02526036\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02526036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:52:42Z","timestamp":1558284762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02526036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF02526036"],"URL":"https:\/\/doi.org\/10.1007\/bf02526036","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}