{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:17Z","timestamp":1725455597716},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022456","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"309-318","source":"Crossref","is-referenced-by-count":2,"title":["Message delaying synchronizers"],"prefix":"10.1007","author":[{"given":"Lior","family":"Shabtay","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Segall","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"No.4","key":"23_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":"23_CR2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/net.3230150404","volume":"15","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, Reducing Complexities of the Distributed Max-Flow and Breadth-First-Search Algorithms by Means of Network Synchronization, NETWORKS, Vol. 15 (1985) 425\u2013437.","journal-title":"NETWORKS"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"A. Fekete, N. Lynch and L. Shrira, A Modular Proof of Correctness for a Network Synchronizer, 2nd International Workshop on DISTRIBUTED ALGORITHMS, Amsterdam, July 1987.","DOI":"10.1007\/BFb0019807"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"K.B. Lakshmanan and K. Thulasiraman, On The Use Of Synchronizers For Asynchronous Communication Networks, 2nd International Workshop on DISTRIBUTED ALGORITHMS, Amsterdam, July 1987.","DOI":"10.1007\/BFb0019808"},{"issue":"No.4","key":"23_CR5","doi-asserted-by":"crossref","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 of COMPUT. Vol 18, No. 4, pp. 740\u2013747, August 1989.","journal-title":"SIAM Journal of COMPUT"},{"issue":"No.2","key":"23_CR6","doi-asserted-by":"crossref","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, Pages 144\u2013147.","journal-title":"IEEE Transactions on communications"},{"key":"23_CR7","volume-title":"Technical Report CS90-19","author":"B. Awerbuch","year":"1990","unstructured":"B. Awerbuch and D. Peleg, Network Synchronization with Polilogarithmic Overhead, Technical Report CS90-19, August 1990, The Weizmann Institute of Science, Department of Applied Mathematics and Computer Science, Israel."},{"key":"23_CR8","unstructured":"S. Even and S. Rajsbaum, Lack of Global Clock Does Not Slow Down the Computation in Distributed Networks, Technical Report, October 1988, Computer Science Department, Technion \u2014 Israel Institute of Technology."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and M. Sisper, Dynamic Networks are as fast as Static Networks, Proc. 29-th IEEE symp. on Foundations of Computer Science 1988, pages 206\u2013220.","DOI":"10.1109\/SFCS.1988.21938"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"K.B. Lakshmanan and K. Thulasiraman and M.A. Comeau, An Efficient Distributed Protocol for Finding Sortest Paths in Networks with Negative Weights, IEEE Transactions on Software Engineering, Vol. 15, No. 5, MAY 1989.","DOI":"10.1109\/32.24713"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"B. Schieber and S. Moran, Slowing Sequential Algorithms for Obtaining fast Distributed and Parallel Algorithm: Maximum Matchings, Proc. 5-th ACM Symp. on Pronciples of Distributed Computing, pages 282\u2013292, ACM August 1986.","DOI":"10.1145\/10590.10615"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"A. Segall, Distributed Network Protocols, IEEE Transactions on Information Theory, vol. IT-29, no. 1, January 1983.","DOI":"10.1109\/TIT.1983.1056620"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022456.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:33Z","timestamp":1607550513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022456"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0022456","relation":{},"subject":[]}}