{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:14:49Z","timestamp":1725488089500},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426059"},{"type":"electronic","value":"9783540454144"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45414-4_23","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T19:12:40Z","timestamp":1184958760000},"page":"330-341","source":"Crossref","is-referenced-by-count":1,"title":["Adding Networks"],"prefix":"10.1007","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02242734","volume":"8","author":"E. Aharonson","year":"1995","unstructured":"Aharonson, E., Attiya, H.: Counting networks with arbitrary fan-out. Distributed Computing, 8 (1995) 163\u2013169.","journal-title":"Distributed Computing"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Aiello, W., Busch, C., Herlihy, M., Mavronicolas, M., Shavit, N., Touitou, D.: Supporting Increment and Decrement Operations in Balancing Networks. Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, pp. 393\u2013403, Trier, Germany, March 1999.","DOI":"10.1007\/3-540-49116-3_37"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J. Aspnes","year":"1994","unstructured":"Aspnes, J., Herlihy, M., Shavit, N.: Counting Networks. Journal of the ACM, 41 (1994) 1020\u20131048.","journal-title":"Journal of the ACM"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Busch, C., Mavronicolas, M.: An Efficient Counting Network. Proceedings of the 1st Merged International Parallel Processing Symposium and IEEE Symposium on Parallel and Distributed Processing, pp. 380\u2013385, Orlando, Florida, May 1998.","DOI":"10.1109\/IPPS.1998.669944"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Goodman, J., Vernon, M., Woest, P.: Efficient synchronization primitives for largescale cache-coherent multiprocessors. Proceedings of the 3rd International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 64\u201375, Boston, Massachusetts, April 1989.","DOI":"10.1145\/70082.68188"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s004460050019","volume":"9","author":"M. Herlihy","year":"1996","unstructured":"Herlihy, M., Shavit, N., Waarts, O.: Linearizable Counting Networks. Distributed Computing, 9 (1996) 193\u2013203.","journal-title":"Distributed Computing"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Klugerman, M., Plaxton, C.: Small-Depth Counting Networks. Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 417\u2013428, May 1992.","DOI":"10.1145\/129712.129752"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Kruskal, C., Rudolph, L., Snir, M.: Efficient Synchronization on Multiprocessors with Shared Memory. Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pp. 218\u2013228, Calgary, Canada, August 1986.","DOI":"10.1145\/10590.10609"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Merritt, M., Taubenfeld, G.: Sequentially Consistent versus Linearizable Counting Networks. Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pp. 133\u2013142, May 1999.","DOI":"10.1145\/301308.301342"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1996.0837","volume":"24","author":"S. Moran","year":"1997","unstructured":"Moran, S., Taubenfeld, G.: A Lower Bound on Wait-Free Counting. Journal of Algorithms, 24 (1997) 1\u201319.","journal-title":"Journal of Algorithms"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s002240000072","volume":"30","author":"N. Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Elimination trees and the Construction of Pools and Stacks. Theory of Computing Systems, 30 (1997) 645\u2013670.","journal-title":"Theory of Computing Systems"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1006\/jpdc.1998.1431","volume":"49","author":"R. Wattenhofer","year":"1998","unstructured":"Wattenhofer, R., Widmayer, P.: An Inherent Bottleneck in Distributed Counting. Journal of Parallel and Distributed Computing, 49 (1998) 135\u2013145.","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45414-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T11:02:12Z","timestamp":1556708532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45414-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426059","9783540454144"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45414-4_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}