Parallel Prefix Computation
From MaRDI portal
Recommendations
- Depth-size trade-offs for parallel prefix computation
- scientific article; zbMATH DE number 1307000
- Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit
- A new class of depth-size optimal parallel prefix circuits
- Finding optimal parallel prefix circuits with fan-out 2 in constant time
Cited in
(only showing first 100 items - show all)- Size-time complexity of Boolean networks for prefix computations
- On the complexity of fanout-bounded parallel prefix circuits
- scientific article; zbMATH DE number 3852437 (Why is no real title available?)
- Parallel prefix computation on extended multi-mesh network.
- Distributed computing with the Cloud
- scientific article; zbMATH DE number 7561283 (Why is no real title available?)
- An efficient algorithm for multiple simultaneous broadcasts in the hypercube
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
- Testing a simple polygon for monotonicity optimally in parallel
- Parallel complexity of algebraic operations
- Removing randomness in parallel computation without a processor penalty
- An optimal parallel algorithm for digital curve segmentation
- On parallel integer sorting
- Computing Prüfer codes efficiently in parallel
- Bit serial addition trees and their applications
- An optimal speed-up parallel algorithm for triangulating simplicial point sets in space
- The \(p\)-Maxian problem on interval graphs
- A parallel bucket sort
- Optimal parallel time bounds for the maximum clique problem on intervals
- Layouts for improved hierarchical parallel computations
- Efficient parallel algorithms for graph problems
- Distributed Computing with the Cloud
- An optimal parallel algorithm for the minimum circle-cover problem
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- The average case complexity of the parallel prefix problem
- ARITHMETIC CODING IN PARALLEL
- Limited width parallel prefix circuits
- Constructing arrangements optimally in parallel
- Communication-efficient parallel algorithms for distributed random-access machines
- The flagged prefix adder and its applications in integer arithmetic
- A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- Parallel methods for visibility and shortest-path problems in simple polygons
- Processor-efficient implementation of a maximum flow algorithm
- Two optimal parallel algorithms on the commutation class of a word
- A faster parallel algorithm for k-connectivity
- A parallel algorithm for finding a blocking flow in an acyclic network
- Optimal circular arc representations: Properties, recognition, and construction
- A novel parallel prefix adder for optimized radix-2 FFT processor
- Solving random ordinary differential equations on GPU clusters using multiple levels of parallelism
- Efficient parallel circuits and algorithms for division
- FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
- Planar orientations with low out-degree and compaction of adjacency matrices
- Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
- A nearly optimal deterministic parallel Voronoi diagram algorithm
- On the complexity of parallelizing sequential circuits using the parallel-prefix method
- An improved algorithm for the p-center problem on interval graphs with unit lengths
- Techniques for parallel manipulation of sparse matrices
- Efficient parallel algorithms for linear recurrence computation
- A new complete language for DSPACE(log n)
- AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗
- PARALLEL METHOD FOR SOLVING SINGULARLY PERTURBED BOUNDARY VALUE PROBLEMS
- Distributed XML processing: theory and applications
- ON THE POWER OF SOME PRAM MODELS
- The delay of circuits whose inputs have specified arrival times
- Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size
- Parallel tree contraction and prefix computations on a large family of interconnection topologies
- Probabilistic parallel prefix computation
- On computing the determinant in small parallel time using a small number of processors
- Parallel construction and query of index data structures for pattern matching on square matrices
- Fast computation of divided differences and parallel Hermite interpolation
- A note on adaptive parallel sorting
- On a class of cell circuits
- Fast pseudorandom functions based on expander graphs
- Parallel recognition of series-parallel graphs
- scientific article; zbMATH DE number 140491 (Why is no real title available?)
- Fast computation of continued fractions
- An optimal parallel algorithm for planar cycle separators
- Sweep methods for parallel computational geometry
- Optimal parallel algorithms on circular-arc graphs
- A parallel method for fast and practical high-order Newton interpolation
- Generalized scans and tridiagonal systems
- scientific article; zbMATH DE number 4085015 (Why is no real title available?)
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
- Selecting distances in the plane
- Optimal algorithms for sensitivity analysis in associative multiplication problems
- Data structures and algorithms for approximate string matching
- Parallel approximation algorithms for bin packing
- Parallel Hermite interpolation: An algebraic approach
- An optimal parallel adaptive sorting algorithm
- Two parallel algorithms for finding all minimal maximum subsequences
- Parallelization of EM-algorithms for Markovian arrival processes
- Mathematics of Program Construction
- A parallel algorithm for minimum weighted colouring of triangulated graphs
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS
- Parallel construction of a suffix tree with applications
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
- Formal proof of prefix adders
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
- A parallel algorithm for evaluating general linear recurrence equations
- Efficient massively parallel implementation of some combinatorial algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Prefix graphs and their applications
- Symbolic computer algebra for multipliers revisited - demonstrating the significance of order and phase optimization
- Parallel discrete invariant embedding algorithm for singular pertubation problems
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Improved parallel depth-first search in undirected planar graphs
- Parallel solutions to geometric problems in the scan model of computation
- Finding level-ancestors in trees
This page was built for publication: Parallel Prefix Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3890136)
