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)- Fast sequential and parallel vertex relabelings of \({K_{m,m}}\)
- Conservative algorithms for parallel and sequential integer sorting
- Almost fully-parallel parentheses matching
- Matrix exponentials and parallel prefix computation in a quantum control problem
- A parallel algorithm for channel routing
- OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES
- A theory of strict P-completeness
- Finding a minimal cover for binary images: An optimal parallel algorithm
- Inverting a Vandermonde matrix in minimum parallel time
- Radix sort on the hypercube
- Matrix inversion in RNC\(^ 1\)
- Algebraic structure of some stochastic discrete event systems, with applications
- Multi-entry DFA with reduced initial states to speedup parallel recognition
- Parallel ear decomposition search (EDS) and st-numbering in graphs
- Partial sums on the ultra-wide word RAM
- Linear-size Boolean circuits for multiselection
- Faster optimal parallel prefix sums and list ranking
- A chained-matrices approach for parallel computation of continued fractions and its applications
- Functional inversion and communication complexity
- Simulation of one-way cellular automata by Boolean circuits
- Finding the convex hull of a sorted point set in parallel
- Massively time-parallel, approximate simulation of loss queueing systems
- Parallel restructuring and evaluation of expressions
- Sorting roughly sorted sequences in parallel
- Lambda calculus with algebraic simplification for reduction parallelisation: extended study
- Subtree isomorphism is in random NC
- Parallel rectilinear shortest paths with rectangular obstacles
- Minimal parallel prefix circuits
- A generalized parallel prefix sums algorithm for arbitrary size arrays
- Computations over finite monoids and their test complexity
- Optimal parallel algorithms for point-set and polygon problems
- Parallel models of computation: An introductory survey
- Formal proof of integer adders using all-prefix-sums operation
- Line-segment intersection reporting in parallel
- Blaze: fast SNARKs from interleaved RAA codes
- Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
- Circuits over monoids: A fault model, and a trade-off between testability and circuit delay
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
- A note on the reconstruction of a binary tree from its traversals
- Non-associative parallel prefix computation
- Optimal computation of prefix sums on a binary tree of processors
- Ancilla-free quantum adder with sublinear depth
- Quick Adaptive Ternary Segmentation: An Efficient Decoding Procedure For Hidden Markov Models
- Functional Pearls
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems
- Complexity theory of parallel time and hardware
- On Parallel Implementations of Deterministic Finite Automata
- Depth-size trade-offs for parallel prefix computation
- A fast algorithm for scalar Nevanlinna-Pick interpolation
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
- GBEES-GPU: an efficient parallel GPU algorithm for high-dimensional nonlinear uncertainty propagation
- Parallel prefix computation with few processors
- Constructing the Voronoi diagram of a set of line segments in parallel
- Matching parentheses in parallel
- Unbounded fan-in circuits and associative functions
- Much ado about two (pearl), a pearl on parallel prefix computation
- Fast prefix adders for non-uniform input arrival times
- Functional and dynamic programming in the design of parallel prefix networks
- Cyclotomic identity testing and applications
- Efficient parallel recognition of some circular arc graphs. I
- Computing downwards accumulations on trees quickly
- The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
- Efficient string matching on packed texts
- Delay optimization of linear depth Boolean circuits with prescribed input arrival times
- Transversal partitioning in balanced hypergraphs
- Oblivious algorithms for multicores and networks of processors
- Independent sets versus perfect matchings
- Optimal parallel algorithms for path problems on planar graphs
- Mapping a functional notation for parallel programs onto hypercubes
- Parallel time integration using batched BLAS (Basic Linear Algebra Subprograms) routines
- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
- 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
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)
