Pages that link to "Item:Q3700837"
From MaRDI portal
The following pages link to Probabilistic Parallel Algorithms for Sorting and Selection (Q3700837):
Displaying 31 items.
- Sorting numbers using limited systolic coprocessors (Q579941) (← links)
- The average-case parallel complexity of sorting (Q582080) (← links)
- Randomized multipacket routing and sorting on meshes (Q675295) (← links)
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
- Probabilistic analysis of a grouping algorithm (Q749213) (← links)
- On parallel integer sorting (Q805234) (← links)
- Finding an approximate median with high probability in constant parallel time (Q911292) (← links)
- Parallel selection (Q913517) (← links)
- Sorting in rounds (Q1117700) (← links)
- Hybridsort revisited and parallelized (Q1123628) (← links)
- The queue-read queue-write asynchronous PRAM model (Q1128706) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
- On probabilistic networks for selection, merging, and sorting (Q1384688) (← links)
- Architecture independent parallel selection with applications to parallel priority queues (Q1399984) (← links)
- Faster deterministic sorting through better sampling. (Q1401197) (← links)
- An improved, randomized algorithm for parallel selection with an experimental study (Q1886374) (← links)
- Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
- Probabilistic integer sorting (Q2390249) (← links)
- On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
- A randomized sorting algorithm on the BSP model (Q2931927) (← links)
- (Q3349963) (← links)
- SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS (Q4337484) (← links)
- Ultrafast Expected Time Parallel Algorithms (Q4377119) (← links)
- Heap construction in the parallel comparison tree model (Q5056136) (← links)
- A time-randomness tradeoff for selection in parallel (Q5060137) (← links)
- Fast and optimal simulations between CRCW PRAMs (Q5096768) (← links)
- PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH (Q5248975) (← links)
- Parallel algorithms for select and partition with noisy comparisons (Q5361885) (← links)
- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes (Q6102292) (← links)
