{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:46:03Z","timestamp":1764132363177},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040404","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"369-379","source":"Crossref","is-referenced-by-count":4,"title":["A tradeoff between information and communication in broadcast protocols"],"prefix":"10.1007","author":[{"given":"Baruch","family":"Awerbuch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronen","family":"Vainish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"37_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, \u201cComplexity of Network Synchronization\u201d, Jour. of ACM, Vol. 32, No. 4, 1985, pp. 804\u2013823.","journal-title":"Jour. of ACM"},{"key":"37_CR2","unstructured":"B. Awerbuch, O. Goldreich and R. Vainish, \u201cOn the Message Complexity of Broadcast: Basic Lower Bound\u201d, Technical memo, MIT\/LCS\/TM-325, April 1987."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"B. Bollobas, Extremal Graph Theory, Academic Press, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"37_CR4","unstructured":"J.E. Burns, \u201cA Formal Model for Message Passing Systems\u201d, TR-91, Indiana University, (1980)."},{"issue":"12","key":"37_CR5","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1145\/359657.359665","volume":"21","author":"Y.K. Dalal","year":"1978","unstructured":"Y.K. Dalal and R. Metcalfe, \u201cReserve Path Forwarding of Broadcast Packets\u201d, Comm. ACM, Vol. 21, No. 12, pp. 1040\u20131048, 1978.","journal-title":"Comm. ACM"},{"key":"37_CR6","unstructured":"S. Even, Graph Algorithms, Computer Science Press, 1979."},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"G.R. Frederickson and N.A. Lynch, \u201cThe Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring\u201d, Proc. 16th ACM Symp. on Theory of Computing, 1984, pp. 493\u2013503.","DOI":"10.1145\/800057.808719"},{"key":"37_CR8","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, \u201cA Distributed Algorithm for Minimum Weight Spanning Tree\u201d, ACM Trans. on Program. Lang. and Systems, Vol. 5, 1983, pp. 66\u201377.","journal-title":"ACM Trans. on Program. Lang. and Systems"},{"key":"37_CR9","unstructured":"R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey Theory, John Wiley & Sons, 1980."},{"key":"37_CR10","unstructured":"D. Peleg and A. Sch\u00e4ffer, Graph Spanners, Manuscript, Sept. 1987."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"R. Reischuk and M. Koshors \u201cLower bound for Synchronous Systems and the Advantage of Local Information\u201d Proc. 2nd International Workshop on Distributed Algorithms, Amsterdam, June 1987.","DOI":"10.1007\/BFb0019817"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040404.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:40:21Z","timestamp":1607550021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0040404","relation":{},"subject":[]}}