{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:20:42Z","timestamp":1737436842117,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679561"},{"type":"electronic","value":"9783540445203"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44520-x_79","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:51:43Z","timestamp":1188359503000},"page":"575-582","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Combinatorial Characterization of Properties Preserved by Antitokens"],"prefix":"10.1007","author":[{"given":"Costas","family":"Busch","sequence":"first","affiliation":[]},{"given":"Neophytos","family":"Demetriou","sequence":"additional","affiliation":[]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,18]]},"reference":[{"key":"79_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02242734","volume":"8","author":"E. Aharonson","year":"1995","unstructured":"E. Aharonson and H. Attiya, \u201cCounting Networks with Arbitrary Fan-Out,\u201d Distributed Computing, Vol. 8, pp. 163\u2013169, 1995.","journal-title":"Distributed Computing"},{"key":"79_CR2","series-title":"Lect Notes Comput Sci","first-page":"377","volume-title":"Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science","author":"W. Aiello","year":"1999","unstructured":"W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit, and D. Touitou, \u201cSupporting Increment and Decrement Operations in Balancing Networks,\u201d Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, G. Meinel and S. Tison eds., pp. 377\u2013386, Vol. 1563, Lecture Notes in Computer Science, Springer-Verlag, Trier, Germany, March 1999. Also, to appear in the Chicago Journal of Theoretical Computer Science."},{"key":"79_CR3","doi-asserted-by":"crossref","unstructured":"W. Aiello, R. Venkatesan and M. Yung, \u201cCoins, Weights and Contention in Balancing Networks,\u201d Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 193\u2013205, Los Angeles, California, August 1994.","DOI":"10.1145\/197917.198090"},{"issue":"5","key":"79_CR4","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J. Aspnes","year":"1994","unstructured":"J. Aspnes, M. Herlihy and N. Shavit, \u201cCounting Networks,\u201d Journal of the ACM, Vol. 41, No. 5, pp. 1020\u20131048, September 1994.","journal-title":"Journal of the ACM"},{"key":"79_CR5","unstructured":"C. Busch, N. Demetriou, M. Herlihy and M. Mavronicolas, \u201cThreshold Counters with Increments and Decrements,\u201d Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity, pp. 47\u201361, Lacanau, France, July 1999."},{"issue":"5","key":"79_CR6","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1145\/234752.234754","volume":"43","author":"C. Busch","year":"1996","unstructured":"C. Busch and M. Mavronicolas, \u201cA Combinatorial Treatment of Balancing Networks,\u201d Journal of the ACM, Vol. 43, No. 5, pp. 794\u2013839, September 1996.","journal-title":"Journal of the ACM"},{"key":"79_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0020-0190(97)00096-3","volume":"63","author":"C. Busch","year":"1997","unstructured":"C. Busch and M. Mavronicolas, \u201cImpossibility Results for Weak Threshold Networks,\u201d Information Processing letters, Vol. 63, No. 2, pp. 85\u201390, July 1997.","journal-title":"Information Processing letters"},{"key":"79_CR8","doi-asserted-by":"crossref","unstructured":"E. W. Dijkstra, \u201cCooperating Sequential Processes,\u201d Programming Languages, pp. 43\u2013112, Academic Press, 1968.","DOI":"10.1007\/978-1-4757-3472-0_2"},{"key":"79_CR9","unstructured":"D. Grunwald and S. Vajracharya, \u201cEfficient Barriers for Distributed Shared Memory Computers,\u201d Proceedings of the 8th International Parallel Processing Symposium, IEEE Computer Society Press, April 1994."},{"key":"79_CR10","volume-title":"Operating System Principles","author":"P. B. Hansen","year":"1973","unstructured":"P. B. Hansen, Operating System Principles, Prentice Hall, Englewood Cliffs, NJ, 1973."},{"issue":"4","key":"79_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1145\/210223.210225","volume":"13","author":"M. Herlihy","year":"1995","unstructured":"M. Herlihy, B.-C. Lim and N. Shavit, \u201cConcurrent Counting,\u201d ACM Transactions on Computer Systems, Vol. 13, No. 4, pp. 343\u2013364, 1995.","journal-title":"ACM Transactions on Computer Systems"},{"key":"79_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s004460050019","volume":"9","author":"M. Herlihy","year":"1996","unstructured":"M. Herlihy, N. Shavit and O. Waarts, \u201cLinearizable Counting Networks,\u201d Distributed Computing, Vol. 9, pp. 193\u2013203, 1996.","journal-title":"Distributed Computing"},{"key":"79_CR13","volume-title":"Operating Systems Techniques","author":"C. A. R. Hoare","year":"1972","unstructured":"C. A. R. Hoare and R. N. Periott, Operating Systems Techniques, Academic Press, London, 1972."},{"key":"79_CR14","doi-asserted-by":"crossref","unstructured":"S. Kapidakis and M. Mavronicolas, \u201cDistributed, Low Contention Task Allocation,\u201d Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing, pp. 358\u2013365, New Orleans, Louisiana, October 1996.","DOI":"10.1109\/SPDP.1996.570355"},{"key":"79_CR15","unstructured":"D. E. Knuth, \u201cThe Art of Computer Programming III: Sorting and Searching,\u201d Vol. 3, Addison-Wesley, 1973."},{"issue":"6","key":"79_CR16","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s002240000072","volume":"30","author":"N. Shavit","year":"1997","unstructured":"N. Shavit and D. Touitou, \u201cElimination Trees and the Construction of Pools and Stacks,\u201d Theory of Computing Systems, Vol. 30, No. 6, pp. 545\u2013570, November\/ December 1997.","journal-title":"Theory of Computing Systems"},{"issue":"12","key":"79_CR17","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1002\/spe.4380231203","volume":"23","author":"S. Zhou","year":"1993","unstructured":"S. Zhou, X. Zheng, J. Wang and P. Delisle, \u201cUtopia: A Load Sharing Facility for Large, Heterogeneous Distributed Computer Systems,\u201d Software-Practice and Experience, Vol. 23, No. 12, pp. 1305\u20131336, December 1993.","journal-title":"Software-Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2000 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44520-X_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:35:56Z","timestamp":1737398156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44520-X_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679561","9783540445203"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44520-x_79","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 August 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}