{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:44:32Z","timestamp":1648885472340},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":5160,"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":[[1999,6]]},"DOI":"10.1016\/s0304-3975(98)00237-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"67-91","source":"Crossref","is-referenced-by-count":3,"title":["Timing conditions for linearizability in uniform counting networks"],"prefix":"10.1016","volume":"220","author":[{"given":"Nancy","family":"Lynch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Touitou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00237-0_BIB1","series-title":"22nd Internat. Symp. on Computer Architecture","first-page":"2","article-title":"The MIT Alewife Machine: architecture and Performance","author":"Agarwal","year":"1995"},{"issue":"4","key":"10.1016\/S0304-3975(98)00237-0_BIB2_1","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":"Distrib. Comput."},{"key":"10.1016\/S0304-3975(98)00237-0_BIB2_2","author":"Aharonson","year":"1991"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB3","series-title":"Proc. 13th Annu. ACM Symp. on Principles of Distributed Computing","first-page":"193","article-title":"Coins, weights and contention in balancing Networks","author":"Aiello","year":"1994"},{"issue":"5","key":"10.1016\/S0304-3975(98)00237-0_BIB4_1","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(98)00237-0_BIB4_2","series-title":"Proc. 23rd ACM Annu. Symp. on Theory of Computing","first-page":"348","author":"Aspnes","year":"1991"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB4_3","author":"Aspnes","year":"1991","journal-title":"MIT Technical Report MIT\/LCS\/TM-451"},{"issue":"1","key":"10.1016\/S0304-3975(98)00237-0_BIB5","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1145\/174644.174649","article-title":"Bounds on the time to reach agreement in the presence of timing uncertainty","volume":"41","author":"Attiya","year":"1994","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/S0304-3975(98)00237-0_BIB6","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1145\/179812.179902","article-title":"Are wait-free Algorithms Fast?","volume":"41","author":"Attiya","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB7","series-title":"Proc. AFIPS Spring Joint Computer Conf.","first-page":"307","article-title":"Sorting networks and their applications","author":"Batcher","year":"1968"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB8","article-title":"Proteus: a high-performance parallelarchitecture simulator","author":"Brewer","year":"1991"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB9","series-title":"Proc. 13th Annu. ACM Symp. on Principles of Distributed Computing","first-page":"206","article-title":"A Combinatorial Treatment of Balancing Networks","author":"Busch","year":"1994"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB10","article-title":"New bounds on depth and contention for counting networks","author":"Busch","year":"1995"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB11","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB12","article-title":"Building counting networks from larger balancers","author":"Felten","year":"1993"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB13","series-title":"Proc. 3rd Internat. Conf. on Architectural Support for Programming Languages and Operating Systems","first-page":"64","article-title":"Efficient synchronization primitives for large-scale cachecoherent multiprocessors","author":"Goodman","year":"1989"},{"issue":"4","key":"10.1016\/S0304-3975(98)00237-0_BIB14_1","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\/S0304-3975(98)00237-0_BIB14_2","series-title":"Proc. 3rd Annu. ASM Symp. on Parallel Algorithms and Architectures (SPAA)","first-page":"219","author":"Herlihy","year":"1992"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB15_1","series-title":"Proc. 32nd Annu. Symp. on Foundations of Computer Science (FOCS)","first-page":"526","article-title":"Low contention linearizable counting","author":"Herlihy","year":"1991"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB15_2","author":"Herlihy","year":"1991","journal-title":"IEEE. Detailed version with empirical results appeared as MIT Technical Memo MIT\/LCS\/TM-459"},{"issue":"3","key":"10.1016\/S0304-3975(98)00237-0_BIB16","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. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB17","article-title":"Small-depth counting networks","author":"Klugerman","year":"1994"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB18","series-title":"Proc. 24th ACM Symp. on Theory of Computing (STOC)","first-page":"417","article-title":"Small-depth counting networks","author":"Klugerman","year":"1992"},{"issue":"9","key":"10.1016\/S0304-3975(98)00237-0_BIB19","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1979.1675439","article-title":"How to make a multiprocessor computer that correctly executes multiprocess programs","volume":"C-28","author":"Lamport","year":"1979","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB20","series-title":"11th Internat. Parallel Processing Symp.","article-title":"The Impact of timing on linearizability in counting networks","author":"Mavronicolas","year":"1997"},{"issue":"1","key":"10.1016\/S0304-3975(98)00237-0_BIB21_1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/103727.103729","article-title":"Algorithms for scalable synchronization on shared-memory multiprocessors","volume":"9","author":"Mellor-Crummey","year":"1991","journal-title":"ACM Trans. Comput Systems"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB21_2","author":"Mellor-Crummey","year":"1990"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB21_3","author":"Mellor-Crummey","year":"1990"},{"issue":"4","key":"10.1016\/S0304-3975(98)00237-0_BIB22","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/322154.322158","article-title":"The serializability of concurrent database updates","volume":"26","author":"Papadimitriou","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB23_1","series-title":"SPAA'95: 7th Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"54","article-title":"Elimination trees and the construction of pools and stacks","author":"Shavit","year":"1995"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB23_2","author":"Shavit","year":"1995","journal-title":"Tel-Aviv University Technical Report"},{"issue":"4","key":"10.1016\/S0304-3975(98)00237-0_BIB24","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. Comput. Systems"},{"key":"10.1016\/S0304-3975(98)00237-0_BIB25","series-title":"Proc. 16th ACM Symp. on Theory of Computing","first-page":"542","article-title":"Distributed elections in an archimedean ring of processors","author":"Vitanyi","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002370?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002370?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:51:21Z","timestamp":1555390281000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397598002370"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00237-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}