{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:15:11Z","timestamp":1649135711249},"reference-count":44,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"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,10]]},"DOI":"10.1016\/s0304-3975(01)00312-7","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"401-423","source":"Crossref","is-referenced-by-count":1,"title":["Public data structures: counters as a special case"],"prefix":"10.1016","volume":"289","author":[{"given":"Hagit","family":"Brit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00312-7_BIB1","doi-asserted-by":"crossref","unstructured":"E. Aharonson, H. Attiya, Counting networks with arbitrary fan-out. Distributed Comput. 8 (1995) 163\u2013169. (Also in: Proc. 3rd Ann. ACM-SIAM Symp. on Discrete Algorithms, January 1992, pp. 104\u2013113.)","DOI":"10.1007\/BF02242734"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB2","doi-asserted-by":"crossref","unstructured":"W. Aiello, R. Venkatesan, M. Yung, Coins, weights and contention in balancing networks, Proc. 13th Ann. ACM Symp. on Principles of Distributed Computing, August 1994, pp. 193\u2013205.","DOI":"10.1145\/197917.198090"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB3","doi-asserted-by":"crossref","unstructured":"R. Alur, G. Taubenfeld, How to share an object: a fast timing-based solution, Proc. 5th IEEE Symp. on Parallel and Distributed Processing, December 1993.","DOI":"10.1109\/SPDP.1993.395496"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB4","doi-asserted-by":"crossref","unstructured":"R.J. Anderson, H. Woll, Wait-free parallel algorithms for the union-find problem, Proc. 23rd ACM Symp. on Theory of Computing, May 1991, pp. 370\u2013380.","DOI":"10.1145\/103418.103458"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB5","doi-asserted-by":"crossref","unstructured":"J. Aspnes, M. Herlihy, N. Shavit, Counting networks, J. ACM 41(5) (1994) 1020\u20131048. (Also in: Proc. 23rd ACM Symp. on Theory of Computing, May 1991, pp. 348\u2013358.)","DOI":"10.1145\/185675.185815"},{"issue":"1","key":"10.1016\/S0304-3975(01)00312-7_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00289137","article-title":"Concurrency operations on B-trees","volume":"1","author":"Bayer","year":"1997","journal-title":"Acta Inform."},{"issue":"8","key":"10.1016\/S0304-3975(01)00312-7_BIB7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/135226.135227","article-title":"Ultracomputers: a teraflop before its time","volume":"35","author":"Bell","year":"1992","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB8","doi-asserted-by":"crossref","unstructured":"A. Ben-Dor, A. Israeli, A. Shirazy, Dynamic counting, Proc. 3rd Israel Symp. on the Theory of Computing and Systems, January 1995, pp. 111\u2013120.","DOI":"10.1109\/ISTCS.1995.377040"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB9","unstructured":"H. Brit, Public data structure and public counters as a special case, Master's Thesis, the Technion, Haifa, Israel, 1994."},{"key":"10.1016\/S0304-3975(01)00312-7_BIB10","doi-asserted-by":"crossref","unstructured":"H. Brit, S. Moran, Wait-freedom vs. bounded wait-freedom in public data structures, Proc. 13th ACM Symp. on Principles of Distributed Computing, August 1994.","DOI":"10.1145\/197917.197950"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB11","doi-asserted-by":"crossref","unstructured":"C. Busch, N. Hardavellas, M. Mavronicolas, Contention in counting networks, Proc. 13th Ann. ACM Symp. on Principles of Distributed Computing, August 1994, p. 404.","DOI":"10.1145\/197917.198192"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB12","doi-asserted-by":"crossref","unstructured":"C. Busch, M. Mavronicolas, A combinatorial treatment of balancing networks, Proc. 13th ACM Symp. on Principles of Distributed Computing, August 1994.","DOI":"10.1145\/197917.198092"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB13","doi-asserted-by":"crossref","unstructured":"C. Busch, M. Mavronicolas, An efficient counting network, Proc. 1st Merged International Parallel processing Symp. and IEEE Symp. on Parallel and Distributed Processing, May 1998, pp. 380\u2013385.","DOI":"10.1109\/IPPS.1998.669944"},{"issue":"4","key":"10.1016\/S0304-3975(01)00312-7_BIB14","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/63334.63337","article-title":"Linda in context","volume":"32","author":"Carriero","year":"1989","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00289064","article-title":"Concurrency search and insert in 2\u20133 trees","volume":"14","author":"Ellis","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(01)00312-7_BIB16","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1109\/TC.1980.1675680","article-title":"Concurrent search and insertion in AVL trees","volume":"c-29","author":"Ellis","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"10.1016\/S0304-3975(01)00312-7_BIB17","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1109\/TC.1985.6312216","article-title":"Distributed data structures: a case study","volume":"c-34","author":"Ellis","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(01)00312-7_BIB18","unstructured":"E.W. Felten, A. LaMarca, R. Ladner, Building counting networks from larger balancers, Technical Report TR-93-04-09, Department of Computer Science and Engineering, University of Washington, April 1993."},{"key":"10.1016\/S0304-3975(01)00312-7_BIB19","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), Lecture Notes in Computer Sciences, vol. 725, Springer, Berlin, September 1993, pp. 234\u2013248.","DOI":"10.1007\/3-540-57271-6_39"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB20","doi-asserted-by":"crossref","unstructured":"M. Herlihy, A methodology for implementing highly concurrent data structures, Proc. 2nd ACM Symp. on Principles and Practice of Parallel Programming, 1990, pp. 197\u2013206.","DOI":"10.1145\/99163.99185"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB21","unstructured":"M. Herlihy, A methodology for implementing highly concurrent objects, Technical Report CRL 91\/10, Digital Equipment Corporation, October 1991."},{"issue":"1","key":"10.1016\/S0304-3975(01)00312-7_BIB22","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","article-title":"Wait-free synchronization","volume":"11","author":"Herlihy","year":"1991","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB23","doi-asserted-by":"crossref","unstructured":"M. Herlihy, B. Lim, N. Shavit, Low contention load balancing on large-scale multiprocessors, Proc. 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures, July 1992.","DOI":"10.1145\/140901.140924"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB24","doi-asserted-by":"crossref","unstructured":"M. Herlihy, N. Shavit, O. Waarts, Low contention linearizable counting, Proc. 32nd IEEE Symp. on Foundations of Computer Science, October 1991, pp. 526\u2013535.","DOI":"10.1109\/SFCS.1991.185415"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB25","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."},{"key":"10.1016\/S0304-3975(01)00312-7_BIB26","doi-asserted-by":"crossref","unstructured":"M. Herlihy, J. Wing, Axioms for concurrent objects, Proc. 14th ACM Symp. on Principles of Programming Languages 1987, pp. 13\u201326.","DOI":"10.1145\/41625.41627"},{"issue":"3","key":"10.1016\/S0304-3975(01)00312-7_BIB27","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","article-title":"Linearizability: a correctness condition for concurrent objects","volume":"12","author":"Herlihy","year":"1990","journal-title":"ACM Trans. on Programming Languages Systems"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB28","series-title":"Introduction to Automata Theory, Languages and Computations","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB29","doi-asserted-by":"crossref","unstructured":"M. Klugerman, C. Plaxton, Small-depth counting networks, Proc. 24rd ACM Symp. on Theory of Computing, 1992, pp. 417\u2013428.","DOI":"10.1145\/129712.129752"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB30","series-title":"The Art of Computer Programming, vol. 2: Seminumerical Algorithms","author":"Knuth","year":"1969"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB31","unstructured":"D. K\u00f6nig, Theorie der endlichen und unendlichen graphen, Liepzig, 1936, reprinted by Chelsea, 1950."},{"issue":"2","key":"10.1016\/S0304-3975(01)00312-7_BIB32","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/69624.357207","article-title":"Specifying concurrent program modules","volume":"5","author":"Lamport","year":"1983","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"4","key":"10.1016\/S0304-3975(01)00312-7_BIB33","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","article-title":"Efficient locking for concurrent operations on B-trees","volume":"6","author":"Lehman","year":"1981","journal-title":"ACM Trans. Database Systems"},{"issue":"4","key":"10.1016\/S0304-3975(01)00312-7_BIB34","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/75104.75105","article-title":"Memory coherence in shared virtual memory systems","volume":"7","author":"Li","year":"1989","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB35","doi-asserted-by":"crossref","unstructured":"N. Lynch, N. Shavit, A. Shvartsman, D. Touitou, Counting networks are practically linearizable, Proc. 15th Annual ACM Symp. on Principles of Distributed Computing, May 1996, pp. 280\u2013289.","DOI":"10.1145\/248052.248111"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB36","series-title":"Algebra","author":"Mac-Lane","year":"1979"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB37","doi-asserted-by":"crossref","unstructured":"M. Mavronicolas, M. Merritt, G. Taubenfeld, Sequentially consistent versus linearizable counting networks, Proc. 18th Ann. Symp. on Principles of Distributed Computing, May 1999, pp. 133\u2013142.","DOI":"10.1145\/301308.301342"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB38","doi-asserted-by":"crossref","unstructured":"M. Mavronicolas, M. Papatriantafilou, Ph. Tsigas, The impact of timing on linearizability in counting networks, Proc. 11th Internat. Parallel Processing Symp., April 1997, pp. 684\u2013688.","DOI":"10.1109\/IPPS.1997.580978"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB39","doi-asserted-by":"crossref","unstructured":"S. Moran, G. Taubenfeld, A lower bound on wait-free counting, J. Algorithms 24 (1997) 1\u201319. (Also in: Proc. 12th ACM Symp. on Principles of Distributed Computing, August 1993, pp. 251\u2013260.)","DOI":"10.1006\/jagm.1996.0837"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB40","doi-asserted-by":"crossref","unstructured":"S. Moran, G. Taubenfeld, I. Yadin, Concurrent counting, J. Comput. System Sci. 53(1) (1996) 61\u201378. (Also in: Proc. 11th ACM Symp. on Principles of Distributed Computing, August 1992, pp. 59\u201370.)","DOI":"10.1006\/jcss.1996.0049"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB41","doi-asserted-by":"crossref","unstructured":"D. Peleg, Distributed data structures: a complexity-oriented structure, in: I. van Leeuwen, N. Santoro (Eds.), Fourth Internat. Workshop on Distributed Algorithms, Lecture Notes in Computer Science, vol. 486, Springer, Berlin, 1990, pp. 71\u201389.","DOI":"10.1007\/3-540-54099-7_6"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB42","doi-asserted-by":"crossref","unstructured":"S.A. Plotikin, Sticky bits and universality of consensus, Proc. 8th ACM Symp. on Principles of Distributed Computing, August 1989, pp. 159\u2013175.","DOI":"10.1145\/72981.72992"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB43","doi-asserted-by":"crossref","unstructured":"Y. Sagiv, Concurrent operations on B-trees with overtaking, ACM Principles of Database Systems, January 1985, pp. 28\u2013374.","DOI":"10.1145\/325405.325409"},{"key":"10.1016\/S0304-3975(01)00312-7_BIB44","doi-asserted-by":"crossref","unstructured":"A.S. Tanenbaum, M.F. Kaashoek, H.E. Balvrije, Parallel programming using shared objects, IEEE Computer, August 1992, pp. 10\u201319.","DOI":"10.1109\/2.153276"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003127?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003127?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T15:39:38Z","timestamp":1622216378000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003127"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00312-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}