{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:40:27Z","timestamp":1787388027620,"version":"build-2736575974"},"reference-count":5,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,5]]},"abstract":"<jats:p>Probabilistic parallel algorithms are described to sort n keys and to select the k-smallest element among them. For each problem we construct a probabilistic parallel decision tree. The tree for selection finishes with high probability in constant time and the sorting tree in time $O(\\log n)$. The same time bound for sorting can also be achieved by a probabilistic parallel machine consisting of n RAMs, each with small private memory, and a common memory of size $O(n)$. These algorithms meet the information theoretic lower bounds.<\/jats:p>","DOI":"10.1137\/0214030","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"396-409","source":"Crossref","is-referenced-by-count":77,"title":["Probabilistic Parallel Algorithms for Sorting and Selection"],"prefix":"10.1137","volume":"14","author":[{"given":"R\u00fcdiger","family":"Reischuk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","volume-title":"The design and analysis of computer algorithms","author":"Aho A.","year":"1975"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/360680.360691"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0210034"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675167"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/0204030"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:54Z","timestamp":1787337774000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["10.1137\/0214030"],"URL":"https:\/\/doi.org\/10.1137\/0214030","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}