Pages that link to "Item:Q3038630"
From MaRDI portal
The following pages link to Searching, Merging, and Sorting in Parallel Computation (Q3038630):
Displayed 31 items.
- Integer merging on EREW PRAM (Q644851) (← links)
- Heaps with bits (Q671419) (← links)
- An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon (Q750155) (← links)
- Parallel algorithms for merging and sorting (Q751797) (← 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)
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case (Q922525) (← links)
- Parallel merging with restriction (Q1009355) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- Parallel priority queues (Q1183429) (← links)
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs (Q1183585) (← links)
- Line-segment intersection reporting in parallel (Q1193518) (← links)
- Sorting in linear time? (Q1273863) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- Fast integer merging on the EREW PRAM (Q2365176) (← links)
- Fast sequential and parallel algorithms for finding extremal sets (Q2710788) (← links)
- A model of sequential computation with Pipelined access to memory (Q3142000) (← links)
- Space-efficient parallel merging (Q3142264) (← links)
- Fast integer merging on the EREW PRAM (Q5204327) (← links)