{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T14:21:02Z","timestamp":1672928462850},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2009,9,10]],"date-time":"2009-09-10T00:00:00Z","timestamp":1252540800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s00446-009-0087-3","type":"journal-article","created":{"date-parts":[[2009,9,9]],"date-time":"2009-09-09T07:24:39Z","timestamp":1252481079000},"page":"381-411","source":"Crossref","is-referenced-by-count":2,"title":["The impact of randomization in smoothing networks"],"prefix":"10.1007","volume":"22","author":[{"given":"Marios","family":"Mavronicolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,10]]},"reference":[{"issue":"4","key":"87_CR1","doi-asserted-by":"crossref","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. Distrib. Comput. 8(4), 163\u2013169 (1995)","journal-title":"Distrib. Comput."},{"key":"87_CR2","doi-asserted-by":"crossref","unstructured":"Aiello, W., Venkatesan, R., Yung, M.: Coins, weights and contention in balancing networks. In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 193\u2013205 (1994)","DOI":"10.1145\/197917.198090"},{"issue":"1","key":"87_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"Ajtai M., Koml\u00f3s J., Szemer\u00e9di E.: Sorting in c lg n Parallel Steps. Combinatorica 3(1), 1\u201319 (1983)","journal-title":"Combinatorica"},{"key":"87_CR4","volume-title":"The Probabilistic Method, Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"N. Alon","year":"2000","unstructured":"Alon N., Spencer J.: The Probabilistic Method, Wiley-Interscience Series in Discrete Mathematics and Optimization, 2nd edn. Wiley, NY (2000)","edition":"2"},{"issue":"5","key":"87_CR5","doi-asserted-by":"crossref","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J. Aspnes","year":"1994","unstructured":"Aspnes J., Herlihy M., Shavit N.: Counting networks. J. ACM 41(5), 1020\u20131048 (1994)","journal-title":"J. ACM"},{"key":"87_CR6","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the AFIPS Joint Computer Conference, pp. 334\u2013338 (1968)"},{"key":"87_CR7","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D.P. Bertsekas","year":"1997","unstructured":"Bertsekas D.P., Tsitsiklis J.N.: Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Nashua (1997)"},{"key":"87_CR8","doi-asserted-by":"crossref","unstructured":"Busch, C., Mavronicolas, M.: An efficient counting network. In: Proceedings of the 1st Merged International Parallel Processing Symposium and IEEE Symposium on Parallel and Distributed Processing, pp. 380\u2013384 (1998)","DOI":"10.1109\/IPPS.1998.669944"},{"issue":"4","key":"87_CR9","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1145\/76359.76362","volume":"36","author":"M. Dowd","year":"1989","unstructured":"Dowd M., Perl Y., Rudoplh L., Saks M.: The periodic balanced sorting network. J. ACM 36(4), 738\u2013757 (1989)","journal-title":"J. ACM"},{"issue":"6","key":"87_CR10","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1145\/268999.269000","volume":"44","author":"C. Dwork","year":"1997","unstructured":"Dwork C., Herlihy M., Waarts O.: Contention in shared memory algorithms. J. ACM 44(6), 779\u2013805 (1997)","journal-title":"J. ACM"},{"key":"87_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-2837-5","volume-title":"A Modern Approach to Probability Theory, Probability and Its Applications","author":"B. Fristedt","year":"1997","unstructured":"Fristedt B., Gray L.: A Modern Approach to Probability Theory, Probability and Its Applications. Birkh\u00e4user, Basel (1997)"},{"key":"87_CR12","volume-title":"The Art of Multiprocessor Programming","author":"M. Herlihy","year":"2008","unstructured":"Herlihy M., Shavit N.: The Art of Multiprocessor Programming. Morgan Kaufmann\/Elsevier, San Francisco\/Amsterdam (2008)"},{"issue":"5","key":"87_CR13","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1016\/j.jpdc.2005.06.009","volume":"66","author":"M. Herlihy","year":"2006","unstructured":"Herlihy M., Tirthapura S.: Randomized smoothing networks. J. Parallel Distrib. Comput. 66(5), 626\u2013632 (2006)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5","key":"87_CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s00446-005-0130-y","volume":"18","author":"M. Herlihy","year":"2006","unstructured":"Herlihy M., Tirthapura S.: Self-stabilizing smoothing and counting networks. Distrib. Comput. 18(5), 345\u2013357 (2006)","journal-title":"Distrib. Comput."},{"key":"87_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"53","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 53, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"87_CR16","doi-asserted-by":"crossref","unstructured":"Kapidakis, S., Mavronicolas, M.: Distributed, low contention task allocation. In: Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing, pp. 358\u2013365 (1996)","DOI":"10.1109\/SPDP.1996.570355"},{"key":"87_CR17","unstructured":"Klugerman, M.: Small-Depth Counting Networks and Related Topics, Ph.D. Thesis, Department of Mathematics, Massachusetts Institute of Technology (1994)"},{"key":"87_CR18","doi-asserted-by":"crossref","unstructured":"Klugerman, M., Plaxton, C.G.: Small-Depth Counting Networks. Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 417\u2013428 (1992)","DOI":"10.1145\/129712.129752"},{"key":"87_CR19","volume-title":"The Art of Computer Programming, vol. 3\/Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 3\/Sorting and Searching, 2nd edn. Addison-Wesley, Reading (1998)","edition":"2"},{"issue":"3","key":"87_CR20","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0304-3975(86)90084-8","volume":"48","author":"C.P. Kruskal","year":"1986","unstructured":"Kruskal C.P., Snir M.: A unified theory of interconnection network structure. Theor. Comput. Sci. 48(3), 75\u201394 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"87_CR21","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Sauerwald, T.: A randomized, O(lg w)-depth 2-smoothing network. In: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 178\u2013187 (2009)","DOI":"10.1145\/1583991.1584043"},{"issue":"5","key":"87_CR22","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F. Preparata","year":"1981","unstructured":"Preparata F., Vuillemin J.: The cube-connected-cycles: a versatile network for parallel computation. Commun. ACM 24(5), 300\u2013309 (1981)","journal-title":"Commun. ACM"},{"key":"87_CR23","doi-asserted-by":"crossref","unstructured":"Riedel, M.D., Bruck, J.: Tolerating Faults in Counting Networks, Technical Report ETR-22, Paradise, California Institute of Technology (1999)","DOI":"10.1007\/978-1-4615-4549-1_12"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0087-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-009-0087-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0087-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:43Z","timestamp":1559122003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-009-0087-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,10]]},"references-count":23,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["87"],"URL":"https:\/\/doi.org\/10.1007\/s00446-009-0087-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,10]]}}}