{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:04Z","timestamp":1725664024953},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_1","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:05Z","timestamp":1330253765000},"page":"1-10","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sparser: A paradigm for running distributed algorithms"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moty","family":"Ricklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 358\u2013370, October 1987.","DOI":"10.1109\/SFCS.1987.7"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Y. Afek, B. Awerbuch, S. Plotkin, and M. Saks. Local management of a global resource in a communication network. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 347\u2013357, October 1987.","DOI":"10.1109\/SFCS.1987.38"},{"key":"1_CR3","unstructured":"Y. Afek and M. Ricklin. Sparser: A paradigm for running distributed algorithms. Extended abstract submitted to FOCS-90, April 1990."},{"issue":"4","key":"1_CR4","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804\u2013823, October 1985.","journal-title":"Journal of the ACM"},{"issue":"3","key":"1_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","volume":"20","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch. A new distributed depth-first-search algorithm. Information Processing Letters, 20(3):147\u2013150, April 1985.","journal-title":"Information Processing Letters"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and R. Gallager. Distributed bfs algorithms. In Proc. of the 26th IEEE Annual Symp. on Foundation of Computer Science, October 1985.","DOI":"10.1109\/SFCS.1985.20"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Goldberg, M. Luby, and S. Plotkin. Network decomposition and locality in distributed computation. In Proc. of the 30th IEEE Annual Symp. on Foundation of Computer Science, pages 364\u2013369, October 1989.","DOI":"10.1109\/SFCS.1989.63504"},{"key":"1_CR8","unstructured":"B. Awerbuch and D. Peleg. Efficient distributed construction of sparse covers. Technical report, Weizman Institute of Science, Dep. of Computer Science, July 1990."},{"key":"1_CR9","unstructured":"B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. of the 31st IEEE Annual Symp. on Foundation of Computer Science, October 1990."},{"key":"1_CR10","unstructured":"B. Awerbuch and D. Peleg. Sparse partitions. In Proc. of the 31st IEEE Annual Symp. on Foundation of Computer Science, October 1990."},{"key":"1_CR11","unstructured":"D. P. Bertsekas and R. G. Gallager. Data Networks. Prantice Hall, 1987."},{"issue":"1","key":"1_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. M. Chandy","year":"1985","unstructured":"K. M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans. on Computer Systems, 3(1):63\u201375, January 1985.","journal-title":"ACM Trans. on Computer Systems"},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11\u20131","author":"W. Dijkstra","year":"1980","unstructured":"W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11\u20131:1\u20134, August 1980.","journal-title":"Information Processing Letters"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"A. Ephremides. The routing problem in Computer Networks. Springer Verlag, 1986.","DOI":"10.1007\/978-1-4612-4904-7_13"},{"key":"1_CR15","unstructured":"R. G. Gallager. A shortest path routing algorithm with automatic resynch. Unpublished note, March 1976."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"R. G. Gallager. Distributed minimum hop algorithms. Technical Report LIDS-P-1175, M.I.T. Lab for Information and Decision Systems, January 1982.","DOI":"10.21236\/ADA117808"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. G. Gallager","year":"1983","unstructured":"R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum weight spanning trees. A CM Trans. Program. Lang. Syst., 5:66\u201377, January 1983.","journal-title":"A CM Trans. Program. Lang. Syst."},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1109\/TCOM.1982.1095632","volume":"COM-30","author":"J. Jaffe","year":"1982","unstructured":"J. Jaffe and F. Moss. A responsive distributed routing protocol. IEEE Trans. on Communication, COM-30(7, part II):1758\u20131762, July 1982.","journal-title":"IEEE Trans. on Communication"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"J. M. McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for the arpanet. IEEE Trans. on Communication, COM-28(5), May 1980.","DOI":"10.1109\/TCOM.1980.1094721"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01585517","volume":"7","author":"U. Pape","year":"1974","unstructured":"U. Pape. Implementation and efficiency of moor-algorithms for the shortest route problem. Mathematical Programming, 7:212\u2013222, 1974.","journal-title":"Mathematical Programming"},{"key":"1_CR21","volume-title":"Technical Report CS89-01","author":"D. Peleg","year":"1989","unstructured":"D. Peleg. Sparse graph partitions. Technical Report CS89-01, Dep. of Applied Math. The Weizmann Institute, Rehovot, Israel, February 1989."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"A. Segall. Distributed network protocols. IEEE Trans. on Information Theory, IT-29(1), January 1983.","DOI":"10.1109\/TIT.1983.1056620"},{"key":"1_CR23","unstructured":"J. M. Spinelli. Broadcasting topology and routing information in computer networks. Master's thesis, MIT, March 1986."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:42:03Z","timestamp":1558269723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}