{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:09:52Z","timestamp":1725455392723},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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\/bfb0019791","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T00:25:50Z","timestamp":1131841550000},"page":"13-29","source":"Crossref","is-referenced-by-count":1,"title":["Directed network protocols"],"prefix":"10.1007","author":[{"given":"Gerard","family":"Tel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B., Complexity of network synchronization, J. ACM 32 (Oct 1985), 804\u2013823.","journal-title":"J. ACM"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E.W. Dijkstra","year":"1980","unstructured":"Dijkstra, E.W., and C.S. Scholten, Termination detection for diffusing computations, Inf. Proc. Let. 11 (August 1980), 1\u20134.","journal-title":"Inf. Proc. Let."},{"key":"2_CR3","series-title":"Techn. Rep.","volume-title":"Symmetric distributed termination","author":"O. Erikson","year":"1985","unstructured":"Erikson, O., and S. Skyum, Symmetric distributed termination, Techn. Rep. DAIMI PB189, Univ. of Aarhus, Aarhus, 1985."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1109\/TCOM.1979.1094473","volume":"COM-27","author":"S.G. Finn","year":"1979","unstructured":"Finn, S.G., Resynch procedures and a fail-safe network protocol, IEEE Trans. Communications COM-27 (June 1979), 840\u2013845.","journal-title":"IEEE Trans. Communications"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/357084.357087","volume":"2","author":"N. Francez","year":"1980","unstructured":"Francez, N., Distributed termination, ACM ToPLaS 2 (1980), 42\u201355.","journal-title":"ACM ToPLaS"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Gafni, E., and Y. Afek, Election and traversal in unidirectional networks, Proc. 4th symp. on Principles of Distr. Comp., Vancouver, Canada, 1984.","DOI":"10.1145\/800222.806746"},{"key":"2_CR7","unstructured":"Gafni, E., M.C. Loui, P. Tiwari, D.B. West, S. Zaks, Lower bounds on common knowledge in distributed systems, Techn. Rep R-1017, Coordinated Science Laboratory, University of Illinois, September 1984."},{"key":"2_CR8","unstructured":"Gafni, E., Perspectives on distributed network protocols: a case for building blocks, MILCOM86."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/3916.3988","volume":"7","author":"D.R. Jefferson","year":"1985","unstructured":"Jefferson, D.R., Virtual time, ACM ToPLaS 7 (1985), 404\u2013423.","journal-title":"ACM ToPLaS"},{"key":"2_CR10","volume-title":"Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs","author":"S. Kutten","year":"1987","unstructured":"Kutten, S., Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs, Technion, Haifa, 1987."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"IT-29","author":"A. Segall","year":"1983","unstructured":"Segall, A., Distributed network protocols, IEEE Trans. Inf. Theory IT-29 (1983), 23\u201325.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TSE.1987.232564","volume":"SE-13","author":"S.K. Sarin","year":"1987","unstructured":"Sarin, S.K., and N.A. Lynch, Discarding obsolete information in a replicated database system, IEEE Trans. Soft. Eng. SE-13 (Jan. 1987), 39\u201347.","journal-title":"IEEE Trans. Soft. Eng."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Szymanski, B., Y. Shy, and N. Prywes, Terminating iterative solutions of simultaneous equations in distributed message passing systems, Proc. 4th symp. on Principles of Distr. Comp., Vancouver, Canada, 1984.","DOI":"10.1145\/323596.323623"},{"key":"2_CR14","series-title":"Techn. Rep.","volume-title":"Distributed infimum approximation","author":"G. Tel","year":"1986","unstructured":"Tel, G., Distributed infimum approximation, Techn. Rep. RUU-CS-86-12, Univ. of Utrecht, Utrecht, 1986."},{"key":"2_CR15","unstructured":"Tel, G., and R.B. Tan, The Equivalence of Some Network Problems, notes July 1987."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T16:39:07Z","timestamp":1586536747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0019791","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}