{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:09:43Z","timestamp":1725455383331},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540193661"},{"type":"electronic","value":"9783540392392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019817","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:25:50Z","timestamp":1131859550000},"page":"374-387","source":"Crossref","is-referenced-by-count":2,"title":["Lower bounds for synchronous networks and the advantage of local information"],"prefix":"10.1007","author":[{"given":"R\u00fcdiger","family":"Reischuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meinolf","family":"Koshors","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"D. Angluin, Local and Global Properties in Networks of Processors, Proc. 12. ACM Symp. on Theory of Computing, 1980, 82\u201393.","DOI":"10.1145\/800141.804655"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"G. Frederickson, N. Lynch, The Impact of Synchronous Communication on the Problem of Electing a Leader on a Ring, Proc. 16. ACM Symp. on Theory of Computing 1984, 493\u2013503.","DOI":"10.1145\/800057.808719"},{"key":"28_CR3","unstructured":"R. Graham, B. Rothschild, J. Spencer, Ramsey Theory, J. Wiley, 1980."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. Gallager","year":"1983","unstructured":"R. Gallager, P. Humblet, P. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Tr. on Programming Languages and Systems 5, 1983, 66\u201377.","journal-title":"ACM Tr. on Programming Languages and Systems"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"E. Korach, S. Moran, S. Zaks, Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors, Proc.3.ACM Symp. on Principles of Distributed Computing, 1984, 199\u2013207.","DOI":"10.1145\/800222.806747"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachel","year":"1984","unstructured":"J. Pachel, E. Korach, D. Rotem, A New Technique for Proving Lower Bounds for Distributed Maximum \u2014 Finding Algorithms, J.ACM 31, 1984, 905\u2013918.","journal-title":"J.ACM"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"P. Vitanyi, Distributed Elections in an Archimedean Ring of Processors, Proc. 16. ACM Symp. on Theory of Computing 1984, 542\u2013547.","DOI":"10.1145\/800057.808725"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:38:37Z","timestamp":1586551117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0019817","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}