{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:11:47Z","timestamp":1742386307092},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439776"},{"type":"electronic","value":"9783540456438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45643-0_11","type":"book-chapter","created":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T00:58:33Z","timestamp":1190681913000},"page":"143-154","source":"Crossref","is-referenced-by-count":8,"title":["Getting More from Out-of-Core Columnsort"],"prefix":"10.1007","author":[{"given":"Geeta","family":"Chaudhry","sequence":"first","affiliation":[]},{"given":"Thomas H.","family":"Cormen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,12]]},"reference":[{"key":"11_CR1","unstructured":"Chaudhry, G., Cormen, T.H., Wisniewski, L.F.: Columnsort lives! An officient out-of-core sorting program. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures. (2001) 169\u2013178"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TC.1985.1676584","volume":"C-34","author":"T. Leighton","year":"1985","unstructured":"Leighton. T.: Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers C-34 (1985) 344\u2013354","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H., Culler, D.E., Hellerstein, J.M., Patterson, D.A.: High-performance sorting on networks of workstations. In: SIGMOD\u2019 97. (1997)","DOI":"10.1145\/253260.253322"},{"key":"11_CR4","unstructured":"Snir, M., Otto, S.W., Huss-Lederman, S., Walker, D.W., Dongarra, J.: MPI\u2014The Complete Reference, Volume 1, The MPI Core. The MIT Press (1998)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Gropp, W., Huss-Lederman, S., Lumsdaine, A., Lusk, E., Nitzberg, B., Saphir, W., Snir, M.: MPI The Complete Reference, Volume 2. The MPI Extensions. The MIT Press (1998)","DOI":"10.7551\/mitpress\/4789.001.0001"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., Shamir, A.: An optimal sorting algorithm for mesh connected computers. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing. (1986) 255\u2013263","DOI":"10.1145\/12130.12156"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45643-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T07:53:42Z","timestamp":1556870022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45643-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439776","9783540456438"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45643-0_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}