{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:05Z","timestamp":1725455705687},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020436","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"223-237","source":"Crossref","is-referenced-by-count":6,"title":["Low complexity network synchronization"],"prefix":"10.1007","author":[{"given":"Lior","family":"Shabtay","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Segall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"issue":"No.4","key":"17_CR1","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 Association for Computing Machinery, Vol. 32, No. 4, October 1985, pp. 804\u2013823.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Optimal Distributed Algorithms of Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems, STOC 1987, pp. 230\u2013240.","DOI":"10.1145\/28395.28421"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, B. Berger, L. Cowen and D. Peleg, Fast Network Decomposition, PODC 1992.","DOI":"10.1145\/135419.135456"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"I. Althofer, G. Das, D. Dobkin and D. Joseph, Generating sparse spanners for weighted graphs, 2nd Scandinavian Workshop on Algorithm Theory 1990, 26\u201337.","DOI":"10.1007\/3-540-52846-6_75"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and D. Peleg, Network Synchronization with Polylogarithmic Overhead, 31st Symposium on Foundations of Computer Science 1990, pp. 514\u2013522.","DOI":"10.1109\/FSCS.1990.89572"},{"key":"17_CR6","unstructured":"B. Awerbuch and D. Peleg, Sparse Partitions, 31st FOCS, 1990."},{"key":"17_CR7","unstructured":"B. Awerbuch and D. Peleg, Efficient Distributed Construction of Sparse Covers, CS90-17, The Weizmann Institute, July 1990."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, B. Patt-Shamir, D. Peleg and M. Saks, Adapting to Asynchronous Dynamic Networks, Proc. 24th ACM STOC, 1992, pages 557\u2013570.","DOI":"10.1145\/129712.129767"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and A. Schaffer, Graph Spanners, J. of Graph Theory 13, 1989, 99\u2013116.","journal-title":"J. of Graph Theory"},{"issue":"No.2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/26.47845","volume":"38","author":"C.T. Chou","year":"1990","unstructured":"C.T. Chou, I. Cidon, I.S. Gopal and S. Zaks, Synchronizing Asynchronous Bounded Delay Networks, IEEE Transactions on communications, Vol. 38, No. 2, February 1990, 144\u2013147.","journal-title":"IEEE Transactions on communications"},{"key":"17_CR11","doi-asserted-by":"publisher","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, ACM Transactions on Programming Languages and Systems 5, 1983, 66\u201377.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"17_CR12","unstructured":"N. Linial and M. Saks, Decomposing Graphs into Regions of Small Diameter, ACM\/SIAM symp. on Discrete Algorithms, 1991 pages 320\u2013330."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"K.B. Lakshmanan and K. Thulasiraman, On The Use Of Synchronizers For Asynchronous Communication Networks, 2nd WDAG, Amsterdam, July 1987.","DOI":"10.1007\/BFb0019808"},{"key":"17_CR14","unstructured":"D. Peleg, Sparse Graph Partitions, CS89-01, The Weizmann Institute, Feb. 1989."},{"issue":"No.4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and J.D. Ullman, An Optimal Synchronizer for the Hypercube, SIAM Journal on computing, Vol 18, No. 4, pp. 740\u2013747, August 1989.","journal-title":"SIAM Journal on computing"},{"key":"17_CR16","unstructured":"L. Shabtay and A. Segall, Active and Passive Synchronizers, TR-706, December 1991, Computer Science Department, Technion IIT, submitted to NETWORKS."},{"key":"17_CR17","unstructured":"L. Shabtay and A. Segall, Message Delaying Synchronizers, 5th WDAG, Delphi, October 1991."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"L. Shabtay and A. Segall, A Synchronizer with Low Memory Overhead, 14th International Conference on Distributed Computing Systems, Poznan pp. 250\u2013257.","DOI":"10.1109\/ICDCS.1994.302420"},{"key":"17_CR19","unstructured":"L. Shabtay and A. Segall, On the Memory Overhead of Synchronizers, LPCR Report #9313, May 1993, Computer Science Department, Technion IIT."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:46:05Z","timestamp":1586551565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0020436","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}