Pages that link to "Item:Q1082818"
From MaRDI portal
The following pages link to Routing, merging, and sorting on parallel models of computation (Q1082818):
Displaying 46 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic (Q478379) (← links)
- Sorting numbers using limited systolic coprocessors (Q579941) (← links)
- Optimal parallel algorithms for computing convex hulls and for sorting (Q594601) (← links)
- Integer merging on EREW PRAM (Q644851) (← links)
- Parallel parsing of tree adjoining grammars on the connection machine (Q685085) (← links)
- Parallel searching of multidimensional cubes (Q685702) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- Towards a scalable and robust DHT (Q733718) (← links)
- Parallel algorithms for merging and sorting (Q751797) (← links)
- Bounds on evacuation time for deflection routing (Q757016) (← links)
- How to emulate shared memory (Q808683) (← links)
- Parallel comparison algorithms for approximation problems (Q808727) (← links)
- An optimal time bound for oblivious routing (Q908701) (← links)
- Sorting roughly sorted sequences in parallel (Q909454) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- Parallel merging with restriction (Q1009355) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- Prallel algorithms for analyzing activity networks (Q1090459) (← 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)
- A parallel bucket sort (Q1108803) (← links)
- A linear-processor algorithm for depth-first search in planar graphs (Q1110342) (← links)
- Optimal parallel selection has complexity O(log log N) (Q1118404) (← links)
- Communication aspects of networks based on geometric incidence relations (Q1119610) (← links)
- Oblivious routing with limited buffer capacity (Q1176105) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
- More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
- Methods for message routing in parallel machines (Q1330418) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Parallel construction of binary trees with near optimal weighted path length (Q1907235) (← links)
- Fast integer merging on the EREW PRAM (Q2365176) (← links)
- Space-efficient parallel merging (Q3142264) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- Tight bounds for oblivious routing in the hypercube (Q3357537) (← links)
- Finding the k shortest paths in parallel (Q5048947) (← links)
- (Q5075823) (← links)
- Computing with Spikes: The Advantage of Fine-Grained Timing (Q5157248) (← links)
- (Q5874505) (← links)
- Periodic merging networks (Q6487453) (← links)
