{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:12Z","timestamp":1742596812850,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572718"},{"type":"electronic","value":"9783540480297"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57271-6_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:35:02Z","timestamp":1330259702000},"page":"234-248","source":"Crossref","is-referenced-by-count":7,"title":["Notes on sorting and counting networks (extended abstract)"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Hardavellas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damianos","family":"Karakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"17_CR1","unstructured":"E. Aharonson and H. Attiya, \u201cCounting Networks with Arbitrary Fan-Out,\u201d in Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pp. 104\u2013113, January 1992."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Komlos and E. Szemeredi, \u201cHalvers and Expanders,\u201d in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pp. 686\u2013692, October 1992.","DOI":"10.1109\/SFCS.1992.267782"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"J. Aspnes, M. Herlihy and N. Shavit, \u201cCounting Networks and Multi-Processor Coordination,\u201d in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348\u2013358, May 1991. Expanded version: \u201cCounting Networks,\u201d Technical Memo MIT\/LCS\/TM-451, Laboratory of Computer Science, MIT, June 1991.","DOI":"10.1145\/103418.103421"},{"key":"17_CR4","first-page":"338","volume":"32","author":"K. E. Batcher","year":"1968","unstructured":"K. E. Batcher, \u201cSorting Networks and their Applications,\u201d in Proceedings of AFIPS Joint Computer Conference, 32, pp. 338\u2013334, 1968.","journal-title":"Proceedings of AFIPS Joint Computer Conference"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"R. Becker, D. Nassimi and Y. Perl, \u201cThe New Class of g-Chain Periodic Sorters,\u201d in Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, July 1993.","DOI":"10.1145\/165231.157378"},{"key":"17_CR6","unstructured":"T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms, Mc-Graw Hill and MIT Press, 1990."},{"issue":"No.4","key":"17_CR7","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1145\/76359.76362","volume":"36","author":"M. Dowd","year":"1989","unstructured":"M. Dowd, Y. Perl, L. Rudolph and M. Saks, \u201cThe Periodic Balanced Sorting Network,\u201d Journal of the ACM, Vol. 36, No. 4, pp. 738\u2013757, October 1989.","journal-title":"Journal of the ACM"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Herlihy and O. Waarts, \u201cContention in Shared Memory Algorithms,\u201d in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, May 1993.","DOI":"10.1145\/167088.167145"},{"key":"17_CR9","unstructured":"A. Gerbessiotis, \u201cSorting and Counting Networks,\u201d unpublished manuscript, Harvard University, October 1992."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"M. Herlihy, B.-C. Lim and N. Shavit, \u201cLow Contention Load Balancing on Large-Scale Multiprocessors,\u201d in Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, July 1992.","DOI":"10.1145\/140901.140924"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"M. Herlihy, N. Shavit and O. Waarts, \u201cLow Contention Linearizablc Counting Networks,\u201d in Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, pp. 526\u2013535, October 1991.","DOI":"10.1109\/SFCS.1991.185415"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"M. Klugerman and C. Plaxton, \u201cSmall-Depth Counting Networks,\u201d in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 417\u2013428, May 1992.","DOI":"10.1145\/129712.129752"},{"key":"17_CR13","unstructured":"D. Knuth, Sorting and Searching, Volume 3 of The Art of Computer Programming, Addison-Wesley, 1973."},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01937485","volume":"24","author":"S. S. Tseng","year":"1984","unstructured":"S. S. Tseng and R. C. Lee, \u201cA new Parallel Sorting Algorithm Based upon Min-Mid-Max Operations,\u201d BIT, Vol. 24, pp. 187\u2013195, 1984.","journal-title":"BIT"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57271-6_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:04:51Z","timestamp":1742594691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57271-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572718","9783540480297"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57271-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}