{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T05:56:28Z","timestamp":1673502988340},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,2,1]],"date-time":"1987-02-01T00:00:00Z","timestamp":539136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1987,2]]},"DOI":"10.1007\/bf00290707","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T06:39:30Z","timestamp":1096958370000},"page":"79-91","source":"Crossref","is-referenced-by-count":13,"title":["Electing a leader in a ring with link failures"],"prefix":"10.1007","volume":"24","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liuba","family":"Shrira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Burns, J.E.: A Formal Model for Message Passing Systems. TR-91, Indiana University 1980"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/359104.359108","volume":"22","author":"E. Chang","year":"1979","unstructured":"Chang, E., Roberts, R.: An Improved Algorithm for Decentralized Extrema-Finding in Circular Configuration of Processes. Commun ACM 22, 281?283 (1979)","journal-title":"Commun ACM"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D., Klawe, M., Rodeh, M.: An O(n log n) Unidirectional Distributed Algorithm for Extremafinding in a Circle. J. Algorithms 3, 245?250 (1982)","journal-title":"J. Algorithms"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/358506.358517","volume":"25","author":"R. Franklin","year":"1982","unstructured":"Franklin, R.: On an Improved Algorithm for Decentralized Extrema-Finding in Circular Configuration of Processes. Commun. ACM 25, 336?337 (1982)","journal-title":"Commun. ACM"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Frederickson, G.R., Lynch, N.A.: The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring. Proc. of the 16th ACM Symp. on Theory of Computing. pp. 493?503. Washington, D.C., 1984","DOI":"10.1145\/800057.808719"},{"key":"CR6","unstructured":"Frederickson, G.R., Lynch, N.A.: A General Lower Bound for Electing a Leader in a Ring. To appear in JACM"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A Distributed Algorithm for Minimum-Weight Spanning Tree. ACM Trans. Program Lang Syst. 5, 66?77 (1983)","journal-title":"ACM Trans. Program Lang Syst."},{"key":"CR8","volume-title":"Consultation in the Presence of Faults: Two Lower Bounds","author":"O. Goldreich","year":"1985","unstructured":"Goldreich, O., Shrira, L.: Consultation in the Presence of Faults: Two Lower Bounds. TR-355, Computer Science Dept., Technion, Haifa 32000, February 1985"},{"key":"CR9","volume-title":"Electing a Leader in the Presence of Faults: A Ring as a Special Case","author":"O. Goldreich","year":"1985","unstructured":"Goldreich, O., Shrira, L.: Electing a Leader in the Presence of Faults: A Ring as a Special Case. TR-354, Computer Science Dept., Technion, Haifa 32000, February 1985"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"D.E. Hirschberg","year":"1980","unstructured":"Hirschberg, D.E., Sinclair, J.B.: Decentralized Extrema-Finding in Circular Configuration of Processors. Commun. ACM 23, 627?628 (1980)","journal-title":"Commun. ACM"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, M.: Symmetry Breaking in a Distributed Environment, Proc. of the 22nd IEEE Symp. on Foundation Comput. Sci. pp. 150?157. Nashville, Tennessee, 1981","DOI":"10.1109\/SFCS.1981.41"},{"key":"CR12","first-page":"137","volume-title":"Proc. of the 25th IEEE Symp. on Foundation Comput. Sci.","author":"A. Itai","year":"1984","unstructured":"Itai, A., Rodeh, M.: The Multi-Tree Approach to Reliability in Distributed Networks. Proc. of the 25th IEEE Symp. on Foundation Comput. Sci. pp. 137?147. Singer Island, Florida, 1984"},{"key":"CR13","first-page":"155","volume-title":"Information Processing 77","author":"G. LeLann","year":"1977","unstructured":"LeLann, G.: Distributed Systems-Towards a Formal Approach. In: Information Processing 77. (Gilchrist B. ed.), pp. 155?160. Amsterdam: North Holland 1977"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(81)90109-2","volume":"13","author":"N.A. Lynch","year":"1981","unstructured":"Lynch, N.A., Fischer, M.J.: On Describing the Behavior and Implementation of Distributed Systems. Theor. Comput. Sci. 13, 17?43 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Meritt, M: Elections in the Presence of Faults. Proc. of the 3fd PODC. pp. 134?142. 1984","DOI":"10.1145\/800222.806741"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G.L. Peterson","year":"1982","unstructured":"Peterson, G.L.: An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. ACM Trans. Program. Lang. Syst. 4, 758?762 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"CR17","volume-title":"Methodological Construction of Reliable Distributed Algorithms","author":"L. Shrira","year":"1985","unstructured":"Shrira, L., Rodeh, M.: Methodological Construction of Reliable Distributed Algorithms. TR-361, Computer Science Dept., Technion, Haifa 32000, February 1985"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Vitanyi, P.M.B.: Distributed Election in an Archimedean Ring of Processors. Proc. of the 16th ACM Symp. on Theory of Computing. pp. 542?547. Washington, D.C., 1984","DOI":"10.1145\/800057.808725"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290707.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00290707\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T08:14:37Z","timestamp":1585901677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00290707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["BF00290707"],"URL":"https:\/\/doi.org\/10.1007\/bf00290707","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}