{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:52:49Z","timestamp":1648857169541},"reference-count":22,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0020-0190(96)00127-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:09:59Z","timestamp":1027613399000},"page":"317-323","source":"Crossref","is-referenced-by-count":1,"title":["On the communication complexity of polling"],"prefix":"10.1016","volume":"59","author":[{"given":"Adele A.","family":"Rescigno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00127-5_BIB1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/S0097539790192672","article-title":"Parallel information dissemination by packets","volume":"23","author":"Bagchi","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00127-5_BIB2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/net.3230220402","article-title":"Sequential information dissemination by packets","volume":"22","author":"Bagchi","year":"1992","journal-title":"Networks"},{"key":"10.1016\/0020-0190(96)00127-5_BIB3_1","series-title":"Proc. 22nd Internat. Coll. on Automata, Languages and Programming","first-page":"135","article-title":"Fast gossiping by short messages","volume":"944","author":"Bermond","year":"1995"},{"key":"10.1016\/0020-0190(96)00127-5_BIB3_2","unstructured":"extended version in: SIAM J. Comput., to appear."},{"issue":"2","key":"10.1016\/0020-0190(96)00127-5_BIB4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/356842.356846","article-title":"Concurrency control in distributed database systems","volume":"13","author":"Bernstein","year":"1981","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0020-0190(96)00127-5_BIB5","article-title":"Architectures and monitoring techniques for active databases: An evaluation","author":"Chakravarthy","year":"1992"},{"issue":"1","key":"10.1016\/0020-0190(96)00127-5_BIB6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1142\/S012962649300006X","article-title":"Scheduling a scattering-gathering sequence on hypercubes","volume":"3","author":"Charles","year":"1993","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/0020-0190(96)00127-5_BIB7","series-title":"Proc. 2nd West Coast Conf. on Computing in Graph Theory","first-page":"7","article-title":"Polling in tree networks","author":"Cheston","year":"1983"},{"key":"10.1016\/0020-0190(96)00127-5_BIB8","author":"Chorafas","year":"1989"},{"key":"10.1016\/0020-0190(96)00127-5_BIB9","series-title":"Proc. 3rd ACM Symp. on Principles of Distributed Computing","first-page":"143","article-title":"Pattern of communications consensus protocols","author":"Dwork","year":"1984"},{"issue":"6","key":"10.1016\/0020-0190(96)00127-5_BIB10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraignaud","year":"1994","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"10.1016\/0020-0190(96)00127-5_BIB11","first-page":"41","article-title":"Gossiping in mesh-bus computers by packets with bounded length","volume":"36","author":"Fujita","year":"1993","journal-title":"IPS Japan SIGAL"},{"key":"10.1016\/0020-0190(96)00127-5_BIB12","series-title":"Proc. 5th IEEE Symp. on Parallel and Distributed Processing","first-page":"564","article-title":"Communication complexity of fault-tolerant information dissemination","author":"Gargano","year":"1993"},{"key":"10.1016\/0020-0190(96)00127-5_BIB13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of broadcasting and gossiping in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0020-0190(96)00127-5_BIB14","doi-asserted-by":"crossref","unstructured":"J. Hromkovic, R. Klasing, B. Monien and R. Piene, Dissemination of information in interconnection networks (broadcasting and gossiping), in: F. Hsu and D.-Z. Du, eds., Combinatorial Network Theory (Science Press and AMS), to appear.","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"10.1016\/0020-0190(96)00127-5_BIB15","unstructured":"A. Itai, Unpublished result, 1986."},{"key":"10.1016\/0020-0190(96)00127-5_BIB16_1","series-title":"Proc. 6th IEEE Symp. on Parallel and Distributed Processing","first-page":"224","article-title":"Optimal polling in communication networks","author":"Rescigno","year":"1994"},{"key":"10.1016\/0020-0190(96)00127-5_BIB16_2","unstructured":"extended version in: IEEE Trans. Parallel Distributed Systems, to appear."},{"key":"10.1016\/0020-0190(96)00127-5_BIB17","series-title":"Distributed Data Bases","first-page":"103","article-title":"Homogeneous distributed data base systems","author":"Stonebraker","year":"1980"},{"key":"10.1016\/0020-0190(96)00127-5_BIB18","unstructured":"A.S. Tanenbaum, Computer Networks (Prentice Hall, Englewood Cliffs, NJ, 19810."},{"key":"10.1016\/0020-0190(96)00127-5_BIB19","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/0743-7315(92)90031-H","article-title":"Efficient implementation of barrier synchronisation in wormhole-routed hypercube multicomputers","volume":"16","author":"Xu","year":"1992","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0020-0190(96)00127-5_BIB20","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0220027","article-title":"The communication complexity of atomic commitment and of gossiping","volume":"20","author":"Wolfson","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001275?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001275?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T10:26:44Z","timestamp":1556274404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0020019096001275"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00127-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}