{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T15:40:12Z","timestamp":1733240412949,"version":"3.30.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0304-3975(01)00113-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:05:14Z","timestamp":1027591514000},"page":"811-826","source":"Crossref","is-referenced-by-count":0,"title":["Threshold counters with increments and decrements"],"prefix":"10.1016","volume":"270","author":[{"given":"Costas","family":"Busch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neophytos","family":"Demetriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00113-X_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 Computing"},{"key":"10.1016\/S0304-3975(01)00113-X_BIB2","doi-asserted-by":"crossref","unstructured":"W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit, D. Touitou, Supporting increment and decrement operations in balancing networks, in: G. Meinel, S. Tison (Eds.), Proc. 16th Internat. Symp. on Theoretical Aspects of Computer Science, Trier, Germany, Lecture Notes in Computer Science, vol. 1563, Springer, Berlin, March 1999, pp. 377\u2013386. (Full version accepted in Chicago J. Theoret. Comput. Sci.).","DOI":"10.1007\/3-540-49116-3_37"},{"issue":"5","key":"10.1016\/S0304-3975(01)00113-X_BIB3","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\/S0304-3975(01)00113-X_BIB4","first-page":"114","article-title":"A combinatorial characterization of properties preserved by antitokens","volume":"71","author":"Busch","year":"2000","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(01)00113-X_BIB5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0020-0190(97)00096-3","article-title":"Impossibility results for weak threshold networks","volume":"63","author":"Busch","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00113-X_BIB6","unstructured":"E.W. Felten, A. LaMarca, R. Ladner, Building counting networks from larger balancers, Technical Report 93-04-09, Department of Computer Science and Engineering, University of Washington, April 1993."},{"key":"10.1016\/S0304-3975(01)00113-X_BIB7","doi-asserted-by":"crossref","unstructured":"D. Grunwald, S. Vajracharya, Efficient barriers for distributed shared memory computers, Proc. 8th Internat. Parallel Processing Symposium, IEEE Computer Society Press, Rockville, MD, April 1994.","DOI":"10.1109\/IPPS.1994.288242"},{"issue":"3","key":"10.1016\/S0304-3975(01)00113-X_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\/S0304-3975(01)00113-X_BIB9","doi-asserted-by":"crossref","unstructured":"N. Hardavellas, D. Karakos, M. Mavronicolas, Notes on Sorting and Counting Networks, in: A. Schiper (Ed.), Proc. 7th Internat. Workshop on Distributed Algorithms (WDAG-93), Lausanne, Switzerland, Lecture Notes in Computer Science, vol. 725, Springer, Berlin, September 1993, pp. 234\u2013248.","DOI":"10.1007\/3-540-57271-6_39"},{"key":"10.1016\/S0304-3975(01)00113-X_BIB10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s004460050019","article-title":"Linearizable counting networks","volume":"9","author":"Herlihy","year":"1996","journal-title":"Distributed Comput."},{"issue":"6","key":"10.1016\/S0304-3975(01)00113-X_BIB11","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s002240000072","article-title":"Elimination trees and the construction of pools and stacks","volume":"30","author":"Shavit","year":"1997","journal-title":"Theory Comput. Systems"},{"year":"1995","series-title":"Practical Parallel Programming","author":"Wilson","key":"10.1016\/S0304-3975(01)00113-X_BIB12"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100113X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100113X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T15:00:24Z","timestamp":1733238024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750100113X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S030439750100113X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00113-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}