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)- Simulation of one-way cellular automata by Boolean circuits
- Unbounded fan-in circuits and associative functions
- Parallel ear decomposition search (EDS) and st-numbering in graphs
- Bit serial addition trees and their applications
- Optimal computation of prefix sums on a binary tree of processors
- An optimal speed-up parallel algorithm for triangulating simplicial point sets in space
- Communication-efficient parallel algorithms for distributed random-access machines
- Data structures and algorithms for approximate string matching
- Parallel construction of a suffix tree with applications
- Finding the convex hull of a sorted point set in parallel
- A parallel bucket sort
- Efficient parallel circuits and algorithms for division
- Complexity theory of parallel time and hardware
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Techniques for parallel manipulation of sparse matrices
- An optimal parallel algorithm for the minimum circle-cover problem
- A new complete language for DSPACE(log n)
- Parallel approximation algorithms for bin packing
- Parallel Hermite interpolation: An algebraic approach
- Optimal algorithms for sensitivity analysis in associative multiplication problems
- Efficient parallel algorithms for linear recurrence computation
- Finding a minimal cover for binary images: An optimal parallel algorithm
- Radix sort on the hypercube
- Processor-efficient implementation of a maximum flow algorithm
- Inverting a Vandermonde matrix in minimum parallel time
- Computations over finite monoids and their test complexity
- Planar orientations with low out-degree and compaction of adjacency matrices
- Matrix inversion in RNC\(^ 1\)
- Algebraic structure of some stochastic discrete event systems, with applications
- An optimal parallel adaptive sorting algorithm
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
- Parallel restructuring and evaluation of expressions
- Optimal parallel algorithms for point-set and polygon problems
- Parallel rectilinear shortest paths with rectangular obstacles
- Line-segment intersection reporting in parallel
- A parallel algorithm for minimum weighted colouring of triangulated graphs
- 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
- Optimal parallel time bounds for the maximum clique problem on intervals
- Parallel recognition of series-parallel graphs
- Parallel methods for visibility and shortest-path problems in simple polygons
- Non-associative parallel prefix computation
- Parallel prefix computation with few processors
- Constructing the Voronoi diagram of a set of line segments in parallel
- Matching parentheses in parallel
- Efficient parallel recognition of some circular arc graphs. I
- Efficient parallel algorithms for graph problems
- A parallel algorithm for finding a blocking flow in an acyclic network
- Optimal parallel algorithms on circular-arc graphs
- Optimal circular arc representations: Properties, recognition, and construction
- Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
- Parallel construction and query of index data structures for pattern matching on square matrices
- Removing randomness in parallel computation without a processor penalty
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Parallel solutions to geometric problems in the scan model of computation
- A fast algorithm for scalar Nevanlinna-Pick interpolation
- Finding level-ancestors in trees
- A chained-matrices approach for parallel computation of continued fractions and its applications
- Functional inversion and communication complexity
- A theory of strict P-completeness
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Almost fully-parallel parentheses matching
- Efficient massively parallel implementation of some combinatorial algorithms
- Computing downwards accumulations on trees quickly
- Transversal partitioning in balanced hypergraphs
- An optimal parallel algorithm for digital curve segmentation
- Computing Prüfer codes efficiently in parallel
- Constructing arrangements optimally in parallel
- Massively time-parallel, approximate simulation of loss queueing systems
- A nearly optimal deterministic parallel Voronoi diagram algorithm
- A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors
- Faster optimal parallel prefix sums and list ranking
- The flagged prefix adder and its applications in integer arithmetic
- Parallel prefix computation on extended multi-mesh network.
- Two optimal parallel algorithms on the commutation class of a word
- Parallel tree contraction and prefix computations on a large family of interconnection topologies
- An optimal parallel algorithm for planar cycle separators
- Sweep methods for parallel computational geometry
- A parallel algorithm for evaluating general linear recurrence equations
- A novel parallel prefix adder for optimized radix-2 FFT processor
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
- Selecting distances in the plane
- Probabilistic parallel prefix computation
- The delay of circuits whose inputs have specified arrival times
- Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture
- Two parallel algorithms for finding all minimal maximum subsequences
- Minimal parallel prefix circuits
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
- A faster parallel algorithm for k-connectivity
- Functional and dynamic programming in the design of parallel prefix networks
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS
- Fast pseudorandom functions based on expander graphs
- Much ado about two (pearl), a pearl on parallel prefix computation
- scientific article; zbMATH DE number 3852437 (Why is no real title available?)
- Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size
- FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
- Formal proof of integer adders using all-prefix-sums operation
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)
