The following pages link to Parallel Prefix Computation (Q3890136):
Displayed 50 items.
- Fast computation of divided differences and parallel Hermite interpolation (Q581992) (← links)
- A note on adaptive parallel sorting (Q582114) (← links)
- Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
- Independent sets versus perfect matchings (Q673116) (← links)
- Mapping a functional notation for parallel programs onto hypercubes (Q674270) (← links)
- An efficient algorithm for multiple simultaneous broadcasts in the hypercube (Q685525) (← links)
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- Fast computation of continued fractions (Q750523) (← links)
- On computing the determinant in small parallel time using a small number of processors (Q794429) (← links)
- On parallel integer sorting (Q805234) (← links)
- Delay optimization of linear depth Boolean circuits with prescribed input arrival times (Q866541) (← links)
- An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
- Sorting roughly sorted sequences in parallel (Q909454) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- A parallel method for fast and practical high-order Newton interpolation (Q920539) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- Simulation of one-way cellular automata by Boolean circuits (Q1041245) (← links)
- Unbounded fan-in circuits and associative functions (Q1083202) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
- Optimal computation of prefix sums on a binary tree of processors (Q1099947) (← links)
- An optimal speed-up parallel algorithm for triangulating simplicial point sets in space (Q1100900) (← links)
- Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- Finding the convex hull of a sorted point set in parallel (Q1108791) (← links)
- A parallel bucket sort (Q1108803) (← links)
- Efficient parallel circuits and algorithms for division (Q1114393) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696) (← links)
- Techniques for parallel manipulation of sparse matrices (Q1119337) (← links)
- An optimal parallel algorithm for the minimum circle-cover problem (Q1123605) (← links)
- A new complete language for DSPACE(log n) (Q1123607) (← links)
- Parallel approximation algorithms for bin packing (Q1123807) (← links)
- Parallel Hermite interpolation: An algebraic approach (Q1124261) (← links)
- Optimal algorithms for sensitivity analysis in associative multiplication problems (Q1149785) (← links)
- Efficient parallel algorithms for linear recurrence computation (Q1165573) (← links)
- Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) (← links)
- Radix sort on the hypercube (Q1178199) (← links)
- Processor-efficient implementation of a maximum flow algorithm (Q1178222) (← links)
- Inverting a Vandermonde matrix in minimum parallel time (Q1178241) (← links)
- Computations over finite monoids and their test complexity (Q1178692) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Matrix inversion in RNC\(^ 1\) (Q1179457) (← links)
- Algebraic structure of some stochastic discrete event systems, with applications (Q1180360) (← links)
- An optimal parallel adaptive sorting algorithm (Q1182099) (← links)
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs (Q1183585) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)