The following pages link to Parallel Prefix Computation (Q3890136):
Displaying 50 items.
- 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)
- Line-segment intersection reporting in parallel (Q1193518) (← links)
- A parallel algorithm for minimum weighted colouring of triangulated graphs (Q1193908) (← links)
- Circuits over monoids: A fault model, and a trade-off between testability and circuit delay (Q1195687) (← links)
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
- A note on the reconstruction of a binary tree from its traversals (Q1198039) (← links)
- Optimal parallel time bounds for the maximum clique problem on intervals (Q1198058) (← links)
- Parallel recognition of series-parallel graphs (Q1201288) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Non-associative parallel prefix computation (Q1201872) (← links)
- Parallel prefix computation with few processors (Q1205906) (← links)
- Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435) (← links)
- Matching parentheses in parallel (Q1208458) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Efficient parallel algorithms for graph problems (Q1262781) (← links)
- A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
- Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
- Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model (Q1274330) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- Removing randomness in parallel computation without a processor penalty (Q1309384) (← links)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- A fast algorithm for scalar Nevanlinna-Pick interpolation (Q1326428) (← links)
- Finding level-ancestors in trees (Q1329158) (← links)
- A chained-matrices approach for parallel computation of continued fractions and its applications (Q1332396) (← links)
- Functional inversion and communication complexity (Q1335026) (← links)
- A theory of strict P-completeness (Q1337145) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Almost fully-parallel parentheses matching (Q1345960) (← links)
- Efficient massively parallel implementation of some combinatorial algorithms (Q1365935) (← links)
- Computing downwards accumulations on trees quickly (Q1369231) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- An optimal parallel algorithm for digital curve segmentation (Q1391535) (← links)
- Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Massively time-parallel, approximate simulation of loss queueing systems (Q1805495) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors (Q1822894) (← links)
