Probabilistic parallel prefix computation

DOI10.1016/0898-1221(93)90089-EMaRDI QIDQ2367585zbMATH OpenFDO

Authors J. Reif

Publication date 2 September 1993

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(93)90089-E

zbMATH Keywords

error probabilityerror-free circuitsfan-in circuitsparallel evaluationprobabilistic prefix computation problem

Mathematics Subject Classification ID

Error probability in coding theory (94B70)

Recommendations

• Parallel Prefix Computation
• Depth-size trade-offs for parallel prefix computation
• scientific article; zbMATH DE number 1307000
• The average case complexity of the parallel prefix problem
• Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit

Cites work

• A lower bound for the length of addition chains
• scientific article; zbMATH DE number 3492136 (Why is no real title available?)
• scientific article; zbMATH DE number 3543939 (Why is no real title available?)
• scientific article; zbMATH DE number 3566175 (Why is no real title available?)
• scientific article; zbMATH DE number 3214539 (Why is no real title available?)
• scientific article; zbMATH DE number 3264081 (Why is no real title available?)
• On the Addition of Binary Numbers
• On the Time Required to Perform Addition
• Parallel Prefix Computation

Cited in

(14)

• The complexity of parallel prefix problems on small domains
• Quantum neural networks
• A time-optimal parallel algorithm for three-dimensional convex hulls
• Relationships between broadcast and shared memory in reliable anonymous distributed systems
• Recursion and parallel algorithms in geometric modeling problems
• Data independence of read, write, and control structures in PRAM computations
• Random error reduction scheme for combinational stochastic circuit
• scientific article; zbMATH DE number 3852437 (Why is no real title available?)
• Parallel algorithms on interval graphs
• The average case complexity of the parallel prefix problem
• Parallel output-sensitive algorithms for combinatorial and linear algebra problems
• A lower bound for the shortest path problem
• Unified parallel encoding and decoding algorithms for Dandelion-like codes
• A probabilistic dynamic logic

This page was built for publication: Probabilistic parallel prefix computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367585)