{"paper":{"title":"Parallel multiple selection by regular sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Krzysztof Nowicki","submitted_at":"2016-11-17T03:23:38Z","abstract_excerpt":"In this paper we present a deterministic parallel algorithm solving the multiple selection problem in congested clique model. In this problem for given set of elements S and a set of ranks $K = \\{k_1 , k_2 , ..., k_r \\}$ we are asking for the $k_i$-th smallest element of $S$ for $1 \\leq i \\leq r$. The presented algorithm is deterministic, time optimal , and needs $O(\\log^*_{r+1} (n))$ communication rounds, where $n$ is the size of the input set, and $r$ is the size of the rank set. This algorithm may be of theoretical interest, as for $r = 1$ (classic selection problem) it gives an improvement"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05549","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}