{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:09:42Z","timestamp":1725455382992},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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\/bfb0019808","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:25:50Z","timestamp":1131859550000},"page":"257-277","source":"Crossref","is-referenced-by-count":5,"title":["On the use of synchronizers for asynchronous communication networks"],"prefix":"10.1007","author":[{"given":"K. B.","family":"Lakshmanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Thulasiraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"19_CR1","series-title":"Technical Report","volume-title":"Fault-Tolerant Algorithms for Election in Complete Networks","author":"H.H. Abu-Amara","year":"1987","unstructured":"H.H. Abu-Amara, \u201cFault-Tolerant Algorithms for Election in Complete Networks\u201d, Technical Report, Coordinated Science Laboratory, University of Illinois, USA, Feb. 1987."},{"issue":"4","key":"19_CR2","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, \u201cComplexity of Network Synchronization\u201d, J. Assoc. Comput. Mach., Vol. 32, No. 4, Oct. 1985, pp. 804\u2013823.","journal-title":"J. Assoc. Comput. Mach."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/net.3230150404","volume":"15","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, \u201cReducing Complexities of the Distributed Max-Flow and Breadth-First-Search Algorithms by Means of Network Synchronization\u201d, Networks, Vol. 15, 1985, pp. 425\u2013437.","journal-title":"Networks"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TIT.1987.1057314","volume":"IT-33","author":"B. Awerbuch","year":"1987","unstructured":"B. Awerbuch and R.G. Gallager, \u201cA New Distributed Algorithm to Find Breadth-First-Search Trees\u201d, IEEE Trans. Info. Theory, Vol. IT-33, No. 3, May 1987, pp. 315\u2013322.","journal-title":"IEEE Trans. Info. Theory"},{"issue":"11","key":"19_CR5","first-page":"833","volume":"25","author":"K.M. Chandy","year":"1982","unstructured":"K.M. Chandy and J. Misra, \u201cDistributed Computation on Graphs: Shortest Path Algorithms\u201d, Comm. Assoc. Comput. Mach., Vol. 25, No. 11, Nov. 1982, pp. 833\u2013837.","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"19_CR6","series-title":"Also Technical Report","volume-title":"Decentralized Algorithms in Distributed Systems","author":"E.J.H. Chang","year":"1979","unstructured":"E.J.H. Chang, Decentralized Algorithms in Distributed Systems, Ph.D. Dissertation, (Also Technical Report CSRG-103), University of Toronto, Canada, 1979."},{"issue":"4","key":"19_CR7","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TSE.1982.235573","volume":"SE-8","author":"E.J.H. Chang","year":"1982","unstructured":"E.J.H. Chang, \u201cEcho Algorithms: Depth Parallel Operations on General Graphs\u201d, IEEE Trans. Software Engg., Vol. SE-8, No. 4, July 1982, pp. 391\u2013401.","journal-title":"IEEE Trans. Software Engg."},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0024003","volume-title":"Proc. STACS 85","author":"G.N. Frederickson","year":"1985","unstructured":"G.N. Frederickson, \u201cA Single-Source Shortest Path Algorithm for Planar Distributed Network\u201d, in Proc. STACS 85, Lecture Notes in Computer Science, Vol. 182, Springer-Verlag, Berlin, 1985, pp. 143\u2013150."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"E. Gafni, \u201cPerspective on Distributed Network Protocols: A Case for Building Blocks\u201d, in Proc. IEEE Military Communications Conference, Monterey, Oct. 1986.","DOI":"10.1109\/MILCOM.1986.4805648"},{"key":"19_CR10","series-title":"Technical Report","doi-asserted-by":"crossref","DOI":"10.21236\/ADA117808","volume-title":"Distributed Minimum Hop Protocols","author":"R.G. Gallager","year":"1982","unstructured":"R.G. Gallager, \u201cDistributed Minimum Hop Protocols\u201d, Technical Report LIDS-P-1175, Massachusetts Institute of Technology, USA, Jan. 1982."},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1145\/579.585","volume":"6","author":"E. Korach","year":"1984","unstructured":"E. Korach, D. Rotem and N. Santoro, \u201cDistributed Algorithms for Finding Centers and Medians in Networks\u201d, ACM Trans. Prog. Lang. Systems, Vol. 6, No. 3, July 1984, pp. 380\u2013401.","journal-title":"ACM Trans. Prog. Lang. Systems"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0020-0190(87)90228-6","volume":"25","author":"K.B. Lakshmanan","year":"1987","unstructured":"K.B. Lakshmanan, N. Meenakshi and K. Thulasiraman, \u201cA Time-Optimal, Message-Efficient Distributed Algorithm for Depth-First-Search\u201d, Info. Proc. Letters, Vol. 25, No. 2, May 1987, pp. 103\u2013109.","journal-title":"Info. Proc. Letters"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"IT-29","author":"A. Segall","year":"1983","unstructured":"A. Segall, \u201cDistributed Network Protocols\u201d, IEEE Trans. Info. Theory, Vol. IT-29, No. 1, Jan. 1983, pp. 23\u201335.","journal-title":"IEEE Trans. Info. Theory"},{"key":"19_CR14","series-title":"Technical Report","volume-title":"Guessing Games and Distributed Computations in Synchronous Networks","author":"J.E. Leeuwen Van","year":"1986","unstructured":"J.E. Van Leeuwen, N. Santoro, J. Urrutia and S. Zaks, \u201cGuessing Games and Distributed Computations in Synchronous Networks\u201d, Technical Report SCS-TR-96, School of Computer Science, Carleton University, Canada, June 1986."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T10:10:50Z","timestamp":1549275050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0019808","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}