{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:10:09Z","timestamp":1648717809938},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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":[[1997,7]]},"DOI":"10.1016\/s0020-0190(97)00096-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"85-90","source":"Crossref","is-referenced-by-count":3,"title":["Impossibility results for weak threshold networks"],"prefix":"10.1016","volume":"63","author":[{"given":"Costas","family":"Busch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00096-3_BIB1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02242734","article-title":"Counting networks with arbitrary fan-out","volume":"8","author":"Aharonson","year":"1995","journal-title":"Distributed Comput."},{"key":"10.1016\/S0020-0190(97)00096-3_BIB2","doi-asserted-by":"crossref","first-page":"1020","DOI":"10.1145\/185675.185815","article-title":"Counting networks","volume":"41","author":"Aspnes","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB3","series-title":"Proc. IEEE Conf. on Supercomputing","first-page":"180","article-title":"Fast barrier synchronization hardware","author":"Beckmann","year":"1991"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB4","series-title":"Proc. 3rd Israel Symp. on the Theory of Computing and Systems","first-page":"98","article-title":"Public data structures: Counters as a special case","author":"Brit","year":"1995"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB5","series-title":"Proc. 13th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"404","article-title":"Contention in counting networks","author":"Busch","year":"1994"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB6","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1145\/234752.234754","article-title":"A combinatorial treatment of balancing networks","volume":"43","author":"Busch","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB7","article-title":"Building counting networks from larger balancers","author":"Felten","year":"1993"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01407897","article-title":"A scalable implementation of barrier synchronization using an adaptive tree","volume":"18","author":"Gupta","year":"1989","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB9","series-title":"Proc. 7th Internat. Workshop on Distributed Algorithms (WDAG-93)","first-page":"234","article-title":"Notes on sorting and counting networks","volume":"Vol. 725","author":"Hardavellas","year":"1993"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01379320","article-title":"Two algorithms for barrier synchronization","volume":"17","author":"Hensgen","year":"1988","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/210223.210225","article-title":"Scalable concurrent counting","volume":"13","author":"Herlihy","year":"1995","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB12","series-title":"The Art of Computer Programming, Vol. 3, Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB13","series-title":"Proc. 12th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"251","article-title":"A lower bound on wait-free counting","author":"Moran","year":"1993"},{"key":"10.1016\/S0020-0190(97)00096-3_BIB14","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/235543.235546","article-title":"Diffracting trees","volume":"14","author":"Shavit","year":"1996","journal-title":"ACM Trans. on Computer Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000963?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000963?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:26:07Z","timestamp":1556058367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0020019097000963"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00096-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}