{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:25Z","timestamp":1725455905550},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023459","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:06:33Z","timestamp":1132365993000},"page":"189-200","source":"Crossref","is-referenced-by-count":0,"title":["Gossiping and broadcasting versus computing functions in networks"],"prefix":"10.1007","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1142\/S012962649400017X","volume":"1","author":"P. Beame","year":"1994","unstructured":"P. Beame, M. Kuty\u0142owski, and M. Kik, Information Broadcasting by exclusive-read PRAMs, Parallel Processing Letters 1 & 2 (1994) 159\u2013169.","journal-title":"Parallel Processing Letters"},{"key":"16_CR2","volume-title":"Diplomarbeit","author":"G. Belting","year":"1994","unstructured":"G. Belting, Untere Schranken f\u00fcr die Berechnung von Booleschen Funktionen in vollst\u00e4ndigen Prozessornetzwerken im Telefon-und Telegraf-Modus, Diplomarbeit, Universit\u00e4t-Gesamthochschule-Paderborn, Paderborn, 1994."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. Cook","year":"1986","unstructured":"S. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 15 (1986) 87\u201397.","journal-title":"SIAM J. Comput."},{"key":"16_CR4","unstructured":"M. Dietzfelbinger, Gossiping and broadcasting versus computing functions in networks, ECCC (http:\/\/www.eccc.uni-trier.de\/eccc\/), Report TR96-052, 1996."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, M. Kuty\u0142owski, and R. Reischuk, Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes, in: Proc. 2nd Annual ACM Symp. on Parallel Algorithms and Architectures, 1990, pp. 125\u2013135.","DOI":"10.1145\/97444.97678"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1016\/S0022-0000(05)80003-0","volume":"48","author":"M. Dietzfelbinger","year":"1994","unstructured":"M. Dietzfelbinger, M. Kuty\u0142owski, and R. Reischuk, Exact lower bounds for computing Boolean functions on CREW PRAMs, J. Comput. Syst. Sci. 48 (1994) 1231\u2013254.","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide, Simple, efficient shared memory simulations, in: Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, 1993, pp. 110\u2013118.","DOI":"10.1145\/165231.165246"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"S. Even and B. Monien, On the number of rounds necessary to disseminate information, in: Proc. ACM Symp. on Parallel Algorithms and Architectures, 1989, pp. 318\u2013327.","DOI":"10.1145\/72935.72969"},{"key":"16_CR9","first-page":"843","volume-title":"Synthesis of Parallel Computation","author":"F. Fich","year":"1994","unstructured":"F. Fich, The complexity of computation on the parallel random access machine, in J. H. Reif (ed.), Synthesis of Parallel Computation, Morgan Kaufmann, San Mateo, 1994, pp. 843\u2013899."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Applied Math. 53 (1994) 79\u2013134.","journal-title":"Discrete Applied Math."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"L. A. Goldberg, M. Jerrum, T. Leighton, and S. Rao, A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer, in: Proc. 5th Annual ACM Symp. on Parallel Algorithms and Architectures, 1993, pp. 300\u2013309.","DOI":"10.1145\/165231.166108"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"L. A. Goldberg, Y. Matias, and S. Rao, An optical simulation of shared memory, in: Proc. 6th Annual ACM Symp. on Parallel Algorithms and Architectures, 1994, pp. 257\u2013267.","DOI":"10.1145\/181014.181406"},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. M. Hedetniemi","year":"1986","unstructured":"S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1986) 319\u2013349.","journal-title":"Networks"},{"key":"16_CR14","volume-title":"Diplomarbeit","author":"I. H\u00f6ltring","year":"1994","unstructured":"I. H\u00f6ltring, Broadcast und Gossip in parallelen Netzwerken, Diplomarbeit, Universit\u00e4t-Gesamthochschule-Paderborn, Paderborn, 1994."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BF01908630","volume":"10","author":"J. Hromkovi\u010d","year":"1993","unstructured":"J. Hromkovi\u010d, C.-D. Jeschke, and B. Monien, Optimal algorithms for dissemination of information in some interconnection networks, Algorithmica 10 (1993) 24\u201340.","journal-title":"Algorithmica"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-1-4757-2491-2_5","volume-title":"Combinatorial Network Theory","author":"J. Hromkovi\u010d","year":"1996","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, and R. Peine, Dissemination of information in interconnection networks (broadcasting & gossiping), in: D.-Z. Du and D. F. Hsu (eds.), Combinatorial Network Theory, Kluwer Academic Publishers, Amsterdam, 1996, pp. 125\u2013212."},{"key":"16_CR17","series-title":"Algorithms and Complexity","first-page":"869","volume-title":"Handbook of Theoretical Computer Science, Vol. A","author":"R. M. Karp","year":"1990","unstructured":"R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity, Elsevier, Amsterdam, 1990, pp. 869\u2013941."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0221010","volume":"21","author":"D. W. Krumme","year":"1992","unstructured":"D. W. Krumme, G. Cybenko, and K. N. Venkatamaran, Gossiping in minimal time, SIAM J. Comput. 21 (1992) 111\u2013139.","journal-title":"SIAM J. Comput."},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/978-3-642-46908-4_52","volume-title":"Topics in Combinatorics and Graph Theory","author":"R. Labahn","year":"1990","unstructured":"R. Labahn and I. Warnke, Quick gossiping by multi-telegraphs, in: R. Bodendiek and R. Henn (eds.), Topics in Combinatorics and Graph Theory, Physica-Verlag, Heidelberg, 1990, pp. 451\u2013458."},{"key":"16_CR20","first-page":"267","volume-title":"Lecture Notes in Computer Science 900","author":"F. Meyer auf der Heide","year":"1995","unstructured":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, Exploiting storage redundancy to speed up randomized shared memory simulations, in: E. W. Mayr and C. Puech (eds.), Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), Lecture Notes in Computer Science 900, Springer, Berlin, 1995, pp. 267\u2013278."},{"key":"16_CR21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230180205","volume":"18","author":"D. Richards","year":"1988","unstructured":"D. Richards and A. L. Liestman, Generalizations of broadcasting and gossiping, Networks 18 (1988) 125\u2013138.","journal-title":"Networks"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(93)90180-V","volume":"42","author":"V. S. Sunderam","year":"1991","unstructured":"V. S. Sunderam and P. Winkler, Fast information sharing in a complete network, Discrete Applied Math. 42 (1991) 75\u201386.","journal-title":"Discrete Applied Math."},{"key":"16_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0020419","volume-title":"Introduction to Distributed Algorithms","author":"G. Tel","year":"1994","unstructured":"G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, Cambridge, 1994."},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/0214024","volume":"14","author":"U. Vishkin","year":"1985","unstructured":"U. Vishkin and A. Wigderson, Trade-offs between depth and width in parallel computation, SIAM J. Comput. 14 (1985) 303\u2013314.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T08:18:29Z","timestamp":1554538709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0023459","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}