Probabilistic Parallel Algorithms for Sorting and Selection
From MaRDI portal
Publication:3700837
DOI10.1137/0214030zbMath0578.68040OpenAlexW2033191517MaRDI QIDQ3700837
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214030
parallel computationdecision treesprobabilistic computationparallel random access machinesdegree of parallelism
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (18)
Heap construction in the parallel comparison tree model ⋮ A time-randomness tradeoff for selection in parallel ⋮ Sorting strings and constructing digital search trees in parallel ⋮ Fast deterministic selection on mesh-connected processor arrays ⋮ A randomized sorting algorithm on the BSP model ⋮ The queue-read queue-write asynchronous PRAM model ⋮ Fast and optimal simulations between CRCW PRAMs ⋮ Unnamed Item ⋮ Beyond the worst-case bisection bound: Fast sorting and ranking on meshes ⋮ Architecture independent parallel selection with applications to parallel priority queues ⋮ Faster deterministic sorting through better sampling. ⋮ SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS ⋮ Randomized multipacket routing and sorting on meshes ⋮ Efficient parallel algorithms for computing all pair shortest paths in directed graphs ⋮ Randomized range-maxima in nearly-constant parallel time ⋮ PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH ⋮ On Floyd and Rivest's SELECT algorithm ⋮ On parallel integer sorting
This page was built for publication: Probabilistic Parallel Algorithms for Sorting and Selection
