Probabilistic parallel prefix computation

DOI10.1016/0898-1221(93)90089-EzbMath0772.94019MaRDI QIDQ2367585

John H. Reif

Publication date: 2 September 1993

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

zbMATH Keywords

error probabilityparallel evaluationfan-in circuitserror-free circuitsprobabilistic prefix computation problem

Mathematics Subject Classification ID

Error probability in coding theory (94B70)

Related Items (11)

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 ⋮ Parallel algorithms on interval graphs ⋮ The average case complexity of the parallel prefix problem ⋮ Data independence of read, write, and control structures in PRAM computations ⋮ Unified parallel encoding and decoding algorithms for Dandelion-like codes ⋮ Parallel output-sensitive algorithms for combinatorial and linear algebra problems ⋮ A lower bound for the shortest path problem ⋮ A probabilistic dynamic logic ⋮ Quantum neural networks

Cites Work

• A lower bound for the length of addition chains
• Parallel Prefix Computation
• On the Time Required to Perform Addition
• On the Addition of Binary Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic parallel prefix computation