The following pages link to Parallel Prefix Computation (Q3890136):
Displaying 50 items.
- Faster optimal parallel prefix sums and list ranking (Q1825647) (← links)
- The flagged prefix adder and its applications in integer arithmetic (Q1851177) (← links)
- Parallel prefix computation on extended multi-mesh network. (Q1853159) (← links)
- Two optimal parallel algorithms on the commutation class of a word (Q1882917) (← links)
- Parallel tree contraction and prefix computations on a large family of interconnection topologies (Q1892710) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- A parallel algorithm for evaluating general linear recurrence equations (Q1922617) (← links)
- A novel parallel prefix adder for optimized radix-2 FFT processor (Q2044538) (← links)
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths (Q2074348) (← links)
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs (Q2365177) (← links)
- Selecting distances in the plane (Q2366232) (← links)
- Probabilistic parallel prefix computation (Q2367585) (← links)
- The delay of circuits whose inputs have specified arrival times (Q2370422) (← links)
- Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture (Q2403751) (← links)
- Two parallel algorithms for finding all minimal maximum subsequences (Q2424687) (← links)
- Minimal parallel prefix circuits (Q2513242) (← links)
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
- Functional and dynamic programming in the design of parallel prefix networks (Q3021416) (← links)
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY (Q3520362) (← links)
- On Parallel Implementations of Deterministic Finite Automata (Q3637342) (← links)
- Parallel complexity of algebraic operations (Q4005330) (← links)
- The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms (Q4210175) (← links)
- ON THE POWER OF SOME PRAM MODELS (Q4242705) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Parallel discrete invariant embedding algorithm for singular pertubation problems (Q4375417) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- The average case complexity of the parallel prefix problem (Q4632459) (← links)
- OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES (Q4819965) (← links)
- AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗ (Q4820057) (← links)
- PARALLEL METHOD FOR SOLVING SINGULARLY PERTURBED BOUNDARY VALUE PROBLEMS (Q4820125) (← links)
- Parallelization of EM-Algorithms for Markovian Arrival Processes (Q5014507) (← links)
- Lambda calculus with algebraic simplification for reduction parallelisation: Extended study (Q5016210) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- (Q5090923) (← links)
- Fast Sequential and Parallel Vertex Relabelings of <i>K<sub>m,m</sub></i> (Q5250275) (← links)
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix (Q5288225) (← links)
- Functional Pearls (Q5687910) (← links)
- ARITHMETIC CODING IN PARALLEL (Q5714668) (← links)
- Solving Random Ordinary Differential Equations on GPU Clusters using Multiple Levels of Parallelism (Q5739951) (← links)
- Partial sums on the ultra-wide word RAM (Q5918471) (← links)
- Generalized scans and tridiagonal systems (Q5941080) (← links)
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems (Q5943098) (← links)
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees (Q5958114) (← links)
- Conservative algorithms for parallel and sequential integer sorting (Q6085719) (← links)
- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search (Q6102330) (← links)
- Parallel time integration using batched BLAS (Basic Linear Algebra Subprograms) routines (Q6104995) (← links)
- Distributed computing with the Cloud (Q6126134) (← links)