Pages that link to "Item:Q4069777"

The following pages link to Parallelism in Comparison Problems (Q4069777):

Displaying 50 items.

• Comparison-based interactive collaborative filtering (Q266268) (← links)
• Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
• Efficient dynamic range minimum query (Q507385) (← links)
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
• The average-case parallel complexity of sorting (Q582080) (← links)
• Parametric search made practical (Q598230) (← links)
• Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
• Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
• Approximate parametric searching (Q685496) (← links)
• Parallel searching of multidimensional cubes (Q685702) (← links)
• Parallel algorithms for merging and sorting (Q751797) (← links)
• A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
• Parallel comparison merging of many-ordered lists (Q807015) (← links)
• Parallel comparison algorithms for approximation problems (Q808727) (← links)
• A complexity theory of efficient parallel algorithms (Q913512) (← links)
• Parallel selection (Q913517) (← links)
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
• A parallel median algorithm (Q1062763) (← links)
• An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint (Q1069860) (← links)
• Lower bounds on parallel algorithms for finding the first maximal independent set (Q1072703) (← links)
• Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
• A parallel algorithm for bisection width in trees (Q1103410) (← links)
• Parallel construction of a suffix tree with applications (Q1104104) (← links)
• An O(log n) time parallel algorithm for triangulating a set of points in the plane (Q1107999) (← links)
• An optimally efficient selection algorithm (Q1108805) (← links)
• Parallel computational geometry (Q1115600) (← links)
• L-infinity interdistance selection by parametric search (Q1115620) (← links)
• Optimal parallel selection has complexity O(log log N) (Q1118404) (← links)
• The average performance of a parallel stable mariage algorithm (Q1123623) (← links)
• Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
• Three-regular path pairable graphs (Q1187948) (← links)
• Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
• A faster parallel algorithm for a matrix searching problem (Q1206437) (← links)
• Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
• Optimal parallel construction of heaps (Q1313734) (← links)
• Extremal polygon containment problems (Q1330463) (← links)
• Almost fully-parallel parentheses matching (Q1345960) (← links)
• Exploiting storage redundancy to speed up randomized shared memory simulations (Q1365933) (← links)
• Constant time parallel sorting: An empirical view. (Q1401981) (← links)
• A parallel computing framework for big data (Q1712556) (← links)
• A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
• A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
• Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
• A unified \(O(\log N)\) and optimal sorting vector algorithm (Q1907067) (← links)
• Sweep methods for parallel computational geometry (Q1907233) (← links)
• Parallel construction of binary trees with near optimal weighted path length (Q1907235) (← links)
• Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
• On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
• Selecting distances in the plane (Q2366232) (← links)
• Approximating Huffman codes in parallel (Q2466011) (← links)