Pages that link to "Item:Q4729356"

The following pages link to Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms (Q4729356):

Displaying 36 items.

• An optimal parallel algorithm for sorting multisets (Q293338) (← links)
• Parallel interval order recognition and construction of interval representations (Q673637) (← links)
• Improved parallel construction of wavelet trees and rank/select structures (Q776833) (← links)
• On parallel integer sorting (Q805234) (← links)
• Deterministic parallel list ranking (Q808699) (← links)
• Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention (Q912634) (← links)
• ERCW PRAMs and optical communication (Q1128717) (← links)
• Improved deterministic parallel integer sorting (Q1175944) (← links)
• Optimal parallel algorithms for forest and term matching (Q1186605) (← links)
• Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
• A randomized parallel sorting algorithm with an experimental study (Q1268779) (← links)
• A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers (Q1317489) (← links)
• Parallel integer sorting using small operations (Q1346223) (← links)
• The parallel complexity of integer prefix summation (Q1350241) (← links)
• Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
• Improved fast integer sorting in linear space (Q1854461) (← links)
• A unified \(O(\log N)\) and optimal sorting vector algorithm (Q1907067) (← links)
• Fast integer merging on the EREW PRAM (Q2365176) (← links)
• Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226) (← links)
• Probabilistic integer sorting (Q2390249) (← links)
• A randomized sorting algorithm on the BSP model (Q2931927) (← links)
• Tight Bounds on the Complexity of Parallel Sorting (Q3219774) (← links)
• Probabilistic Parallel Algorithms for Sorting and Selection (Q3700837) (← links)
• (Q3780450) (← links)
• Sorting in Average Time $o(\log \,n)$ (Q3827548) (← links)
• Optimal Randomized Algorithms for Local Sorting and Set-Maxima (Q4032937) (← links)
• Ultrafast Expected Time Parallel Algorithms (Q4377119) (← links)
• Delayed path coupling and generating random permutations (Q4521548) (← links)
• RANDOMIZED SORTING ON THE POPS NETWORK (Q4675883) (← links)
• SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS (Q4820152) (← links)
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167) (← links)
• Parallel Weighted Random Sampling (Q5075804) (← links)
• Fast integer merging on the EREW PRAM (Q5204327) (← links)
• Conservative algorithms for parallel and sequential integer sorting (Q6085719) (← links)
• More Efficient Parallel Integer Sorting (Q6114876) (← links)