{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T07:10:23Z","timestamp":1737097823410,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411437"},{"type":"electronic","value":"9783540400264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40026-5_24","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T23:59:07Z","timestamp":1181692747000},"page":"360-373","source":"Crossref","is-referenced-by-count":1,"title":["Short Headers Suffice for Communication in a DAG with Link Failures"],"prefix":"10.1007","author":[{"given":"Faith E.","family":"Fich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Jakoby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Micah Adler and Faith E. Fich, The Complexity of End-to-End Communication in Memoryless Networks, 18th Annual ACM Symposium on Principles of Distributed Computing, May 1999, pages 239\u2013248.","DOI":"10.1145\/301308.301364"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Micah Adler, Faith E. Fich, Leslie Ann Goldberg, and Mike Paterson Tight Size Bounds for Packet Headers in Narrow Meshes, to appear in the Proceedings of the 27th International Colloquium on Automata, Languages and Programming, 2000.","DOI":"10.1007\/3-540-45022-X_63"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1145\/195613.195651","volume":"41","author":"Y. Afek","year":"1994","unstructured":"Y. Afek, H. Attiya, A. Fekete, M. Fischer, N. Lynch, Y. Mansour, D. Wang, and L. Zuck, Reliable Communication Over Unreliable Channels, Journal of the ACM, vol. 41, no. 6, 1994, pages 1267\u20131297.","journal-title":"Journal of the ACM"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1006\/jagm.1996.0819","volume":"22","author":"Y. Afek","year":"1997","unstructured":"Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Ros\u00e8n, and N Shavit, Slide-The Key to Polynomial End-to-End Communication, Journal of Algorithms, vol. 22, no. 1, 1997, pages 158\u2013186.","journal-title":"Journal of Algorithms"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Y. Afek and E. Gafni, End-to End Communication in Unreliable Networks, Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, 1988, pages 131\u2013148.","DOI":"10.1145\/62546.62570"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Y. Afek and E. Gafni, Bootstrap Network Resynchronization, Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, 1991, pages 295\u2013307.","DOI":"10.1145\/112600.112625"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1002\/net.3230160405","volume":"16","author":"B. Awerbuch","year":"1986","unstructured":"B. Awerbuch and S. Even, Reliable Broadcast Protocols in Unreliable Networks, Networks, vol. 16, 1986, pages 381\u2013396.","journal-title":"Networks"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Mansour, and N. Shavit, Polynomial End to End Communication, Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pages 358\u2013363.","DOI":"10.1109\/SFCS.1989.63503"},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"365","DOI":"10.3233\/JHS-1996-5404","volume":"5","author":"B. Awerbuch","year":"1996","unstructured":"B. Awerbuch, B. Patt-Shamir, and G. Varghese, Self-stabilizing End-to-End Communication, Journal of High Speed Networks, vol. 5, no. 4, 1996, pages 365\u2013381.","journal-title":"Journal of High Speed Networks"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/362946.362970","volume":"12","author":"K. Bartlett","year":"1969","unstructured":"K. Bartlett, R. Scantlebury, and P. Wilkinson, A Note on Reliable, Full-Duplex Transmission over Half-Duplex Links, Communications of the ACM, vol. 12, 1969, pages 260\u2013261.","journal-title":"Communications of the ACM"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/12.559799","volume":"46","author":"S. Dolev","year":"1997","unstructured":"S. Dolev and J. Welch, Crash Resilient Communication in Dynamic Networks, IEEE Transactions of Computers, vol. 46, 1997, pages 14\u201326.","journal-title":"IEEE Transactions of Computers"},{"key":"24_CR12","first-page":"299","volume":"47","author":"R. Dutton","year":"1985","unstructured":"R. Dutton and R. Brigham, Strong, weak and other colorings of uniform hyper-graphs, Proceedings of the Sixteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 47, 1985, pages 299\u2013314.","journal-title":"Proceedings of the Sixteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium"},{"key":"24_CR13","unstructured":"F. Fich, End-to-end Communication, Proceedings of OPODIS \u201998, Amiens, France, 1998, pages 37\u201343."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, and A. Rosen, Log-Space Polynomial End-to-End Communication, Proceedings of the 28th ACM Symposium on the Theory of Computing, 1995, pages 559\u2013568.","DOI":"10.1145\/225058.225273"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jcss.1997.1549","volume":"56","author":"R. Ladner","year":"1998","unstructured":"R. Ladner, A. LaMarca, and E. Tempero, Counting Protocols for Reliable End-to-End Transmission, Journal of Computer and Systems Sciences, vol. 56, no. 1, 1998, pages 96\u2013111.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"J. Postel, Internet Protocol, Network Working Group Request for Comments 791, September 1981.","DOI":"10.17487\/rfc0791"},{"key":"24_CR17","first-page":"99","volume":"1","author":"M. Stenning","year":"1976","unstructured":"M. Stenning, A Data Transfer Protocol, Computer Net., vol. 1, 1976, pages 99\u2013110.","journal-title":"A Data Transfer Protocol"},{"issue":"5","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1145\/210118.210133","volume":"42","author":"E. Tempero","year":"1995","unstructured":"E. Tempero and R. Ladner, Recoverable Sequence Transmission Protocols, Journal of the ACM, vol. 42, no. 5, 1995, pages 1059\u20131090.","journal-title":"Journal of the ACM"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TIT.1983.1056696","volume":"29","author":"U. Vishkin","year":"1983","unstructured":"U. Vishkin, A Distributed Orientation Algorithm, EEE Trans, on Information Theory, vol. 29, 1983, pages 624\u2013629.","journal-title":"EEE Trans, on Information Theory"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"D. Wang and L. Zuck, Tight Bounds for the Sequence Transmission Problem, 8th Annual ACM Symposium on Principles of Distributed Computing, 1989, pages 73\u201383.","DOI":"10.1145\/72981.72986"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40026-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:42:09Z","timestamp":1737096129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40026-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411437","9783540400264"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-40026-5_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}