{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T20:26:37Z","timestamp":1693859197027},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6682,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1016\/0166-218x(94)e0148-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:52:12Z","timestamp":1027605132000},"page":"213-222","source":"Crossref","is-referenced-by-count":10,"title":["Optimal computation of census functions in the postal model"],"prefix":"10.1016","volume":"58","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Kipnis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)E0148-6_BIB1","article-title":"Message-time tradeoff for combining data in message-passing systems","author":"Aggarwal","year":"1992","journal-title":"IBM Research Report RC-18349"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB2_1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and S. Kipnis, Designing broadcasting algorithms in the postal model for message-passing systems, Math. Systems Theory, to appear","DOI":"10.1145\/140901.140903"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB2_2","series-title":"Proceedings of the 4th ACM Annual Symposium on Parallel Algorithms and Architectures","first-page":"13","author":"Bar-Noy","year":"1992"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB3","series-title":"Proceedings of the 7th IEEE International Parallel Processing Symposium","first-page":"463","article-title":"Multiple message broadcasting in the postal model","author":"Bar-Noy","year":"1993"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB4_1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and S. Kipnis, Broadcasting multiple messages in simultaneous send\/receive systems, Discrete Appl. Math., to appear","DOI":"10.1109\/SPDP.1993.395513"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB4_2","author":"Bar-Noy","year":"1992","journal-title":"IBM Research Report RC-18352"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB5_1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, S. Kipnis and B. Schieber, An optimal algorithm for computing census functions in message-passing systems, Parallel Process. Lett., to appear","DOI":"10.1142\/S0129626493000046"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB5_2","author":"Bar-Noy","year":"1992","journal-title":"IBM Research Report, RC-18527"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB6","series-title":"Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing","first-page":"424","article-title":"Multiple message broadcasting with generalized Fibonacci trees","author":"Bruck","year":"1992"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB7","article-title":"An optimal algorithm for concatenating data in message-passing systems","author":"Bruck","year":"1993","journal-title":"IBM Research Report RJ-9191"},{"issue":"2","key":"10.1016\/0166-218X(94)E0148-6_BIB8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/dac.4520010208","article-title":"PARIS: an approach to integrated high-speed private networks","volume":"1","author":"Cidon","year":"1988","journal-title":"Internat. J. Digital Analog Cabled Systems"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB9","series-title":"Proceedings of the 7th ACM Annual Symposium on Principles of Distributed Computing","first-page":"75","article-title":"New models and algorithms for future networks","author":"Cidon","year":"1988"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB10","article-title":"The AURORA gigabit testbed","author":"Clark","year":"1991","journal-title":"Comput. Networks ISDN"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB11","series-title":"Proceedings of the 4th SIGPLAN Symposium on Principles and Practices of Parallel Programming","article-title":"LogP: towards a realistic model of parallel computation","author":"Culler","year":"1993"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB12","first-page":"1147","article-title":"The J-Machine: a fine-grain concurrent computer","volume":"89","author":"Dally","year":"1989"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB13","series-title":"Solving Problems on Concurrent Processors, Volume I: General Techniques and Regular Problems","author":"Fox","year":"1988"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB14","series-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham","year":"1988"},{"issue":"4","key":"10.1016\/0166-218X(94)E0148-6_BIB15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB16","series-title":"Proceeding of the 5th ACM Annual Symposium on Parallel Algorithms and Architectures","article-title":"Optimal broadcast and summation in the LogP model","author":"Karp","year":"1993"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","article-title":"New gossips and telephones","volume":"3","author":"Kn\u00f6del","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)E0148-6_BIB18","series-title":"Proceedings of the 4th ACM Annual Symposium on Parallel Algorithms and Architectures","first-page":"272","article-title":"The network architecture of the Connection Machine CM-5","author":"Leiserson","year":"1992"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB19","first-page":"179","article-title":"Repr\u00e9sentation des nombers naturels par une somme de nombres de Fibonacci ou de nombers de Lucas","volume":"41","author":"Zekendorf","year":"1972","journal-title":"Bull. Soc. Roy. Sci. Li\u00e9ge"},{"key":"10.1016\/0166-218X(94)E0148-6_BIB20","series-title":"Proceedings of the Eighth International Parallel Processing Symposium","first-page":"268","article-title":"Architecture and implementation of Vulcan","author":"Stunkel","year":"1994"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94E01486?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94E01486?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T00:24:02Z","timestamp":1556497442000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94E01486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["0166218X94E01486"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)e0148-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}