{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:39:36Z","timestamp":1725489576926},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656913"},{"type":"electronic","value":"9783540491163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_37","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:56:14Z","timestamp":1187268974000},"page":"393-403","source":"Crossref","is-referenced-by-count":3,"title":["Supporting Increment and Decrement Operations in Balancing Networks"],"prefix":"10.1007","author":[{"given":"William","family":"Aiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas","family":"Busch","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"}]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Touitou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"issue":"4","key":"37_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. Counting networks with arbitrary fan-out. Distributed Computing, 8(4):163\u2013169, 1995.","journal-title":"Distributed Computing"},{"key":"37_CR2","unstructured":"W. Aiello, M. Herlihy, N. Shavit, and D. Touitou. Inc\/dec counting networks. Manuscript, Dec. 1995."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"W. Aiello, R. Venkatesan, and M. Yung. Coins, weights and contention in balancing networks. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC\u201994), pages 193\u2013205, Los Angeles, Aug. 1994.","DOI":"10.1145\/197917.198090"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"J. Aspnes, M. Herlihy, and N. Shavit. Counting networks. Journal of the ACM, 41(5):1020\u20131048, Sept. 1994.","DOI":"10.1145\/185675.185815"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"C. Busch, N. Hardavellas, and M. Mavronicolas. Contention in counting networks (abstract). In Proceedings of the 13th annual ACM Symposium on Principles of Distributed Computing (PODC\u201994), page 404, Los Angeles, Aug. 1994.","DOI":"10.1145\/197917.198192"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"C. Busch and M. Mavronicolas. The strength of counting networks (abstract). In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC\u201996), page 311, Philadelphia, May 1996.","DOI":"10.1145\/248052.248115"},{"issue":"2","key":"37_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0020-0190(97)00096-3","volume":"63","author":"C. Busch","year":"1997","unstructured":"C. Busch and M. Mavronicolas. Impossibility results for weak threshold networks. Information Processing Letters, 63(2):85\u201390, July 1997.","journal-title":"Information Processing Letters"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"C. Busch and M. Mavronicolas. An efficient counting network. In Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS\/SPDP\u201998), pages 380\u2013385, Mar. 1998.","DOI":"10.1109\/IPPS.1998.669944"},{"key":"37_CR9","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"1992","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press and McGraw-Hill Book Company, Cambridge, MA, 1992."},{"key":"37_CR10","unstructured":"E. W. Felten, A. LaMarca, and R. Ladner. Building counting networks from larger balancers. Technical Report TR 93-04-09, University of Washington, Apr. 1993."},{"key":"37_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-57271-6_39","volume-title":"Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG\u201993)","author":"N. Hardavellas","year":"1993","unstructured":"N. Hardavellas, D. Karakos, and M. Mavronicolas. Notes on sorting and counting networks. In Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG\u201993), volume 725 of Lecture Notes in Computer Science, pages 234\u2013248, Lausanne, Switzerland, Sept. 1993. Springer-Verlag."},{"issue":"4","key":"37_CR12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/210223.210225","volume":"13","author":"M. Herlihy","year":"1995","unstructured":"M. Herlihy, B.-H. Lim, and N. Shavit. Scalable concurrent counting. ACM Transactions on Computer Systems, 13(4):343\u2013364, Nov. 1995.","journal-title":"ACM Transactions on Computer Systems"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"S. Kapidakis and M. Mavronicolas. Distributed, low contention task allocation. In Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP\u201996), pages 358\u2013365, Washington, Oct. 1996.","DOI":"10.1109\/SPDP.1996.570355"},{"key":"37_CR14","unstructured":"M. Klugerman. Small-Depth Counting Networks and Related Topics. PhD thesis, Department of Mathematics, Massachusetts Institute of Technology, Sept. 1994."},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"M. Klugerman and C. G. Plaxton. Small-depth counting networks. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC\u201992), pages 417\u2013428, Victoria, B.C., Canada, May 1992.","DOI":"10.1145\/129712.129752"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"N. Lynch, N. Shavit, A. Shvartsman, and D. Touitou. Counting networks are practically linearizable. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC\u201996), pages 280\u2013289, New York, May 1996.","DOI":"10.1145\/248052.248111"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"M. Mavronicolas, M. Papatriantafilou, and P. Tsigas. The impact of timing on linearizability in counting networks. In Proceedings of the 11th International Parallel Processing Symposium (IPPS\u201997), pages 684\u2013688, Los Alamitos, Apr. 1997.","DOI":"10.1109\/IPPS.1997.580978"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"N. Shavit and D. Touitou. Elimination trees and the construction of pools and stacks. Theory of Computing Systems, 30(6):545\u2013570, Nov.\/Dec. 1997.","DOI":"10.1007\/s002240000072"},{"issue":"4","key":"37_CR19","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/235543.235546","volume":"14","author":"N. Shavit","year":"1996","unstructured":"N. Shavit and A. Zemach. Diffracting trees. ACM Transactions on Computer Ssytems, 14(4):385\u2013428, Nov. 1996.","journal-title":"ACM Transactions on Computer Ssytems"}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:42:50Z","timestamp":1556772170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}