{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T14:27:00Z","timestamp":1770215220748,"version":"3.49.0"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1993,3]]},"abstract":"<jats:p> We consider a message-passing system of n processors, each of which initially holds one piece of data. The goal is to compute an associative and commutative census function f on the n distributed pieces of data and to make the result known to all processors. To perform the computation, processors communicate with each other by sending and receiving messages in specified communication rounds. We describe an optimal algorithm for this problem that requires the least number of communication rounds and that minimizes the time spent by any processor in sending and receiving messages. <\/jats:p>","DOI":"10.1142\/s0129626493000046","type":"journal-article","created":{"date-parts":[[2004,11,22]],"date-time":"2004-11-22T22:29:30Z","timestamp":1101162570000},"page":"19-23","source":"Crossref","is-referenced-by-count":30,"title":["AN OPTIMAL ALGORITHM FOR COMPUTING CENSUS FUNCTIONS IN MESSAGE-PASSING SYSTEMS"],"prefix":"10.1142","volume":"03","author":[{"given":"AMOTZ","family":"BAR-NOY","sequence":"first","affiliation":[{"name":"IBM Research Division, T.J. Watson Research Center,  Yorktown Heights, NY 10598, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHLOMO","family":"KIPNIS","sequence":"additional","affiliation":[{"name":"IBM Research Division, T.J. Watson Research Center,  Yorktown Heights, NY 10598, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BARUCH","family":"SCHIEBER","sequence":"additional","affiliation":[{"name":"IBM Research Division, T.J. Watson Research Center,  Yorktown Heights, NY 10598, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626493000046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:24:32Z","timestamp":1565094272000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626493000046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1993,3]]}},"alternative-id":["10.1142\/S0129626493000046"],"URL":"https:\/\/doi.org\/10.1142\/s0129626493000046","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}