Probabilistic parallel prefix computation
From MaRDI portal
Publication:2367585
DOI10.1016/0898-1221(93)90089-EzbMATH Open0772.94019MaRDI QIDQ2367585FDOQ2367585
Authors: J. Reif 
Publication date: 2 September 1993
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Recommendations
error probabilityparallel evaluationfan-in circuitserror-free circuitsprobabilistic prefix computation problem
Cites Work
- Parallel Prefix Computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Addition of Binary Numbers
- Title not available (Why is that?)
- On the Time Required to Perform Addition
- A lower bound for the length of addition chains
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Parallel algorithms on interval graphs
- Random error reduction scheme for combinational stochastic circuit
- The average case complexity of the parallel prefix problem
- The complexity of parallel prefix problems on small domains
- A probabilistic dynamic logic
- A time-optimal parallel algorithm for three-dimensional convex hulls
- A lower bound for the shortest path problem
- Quantum neural networks
- Recursion and parallel algorithms in geometric modeling problems
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems
- Unified parallel encoding and decoding algorithms for Dandelion-like codes
- Data independence of read, write, and control structures in PRAM computations
- Relationships between broadcast and shared memory in reliable anonymous distributed systems
- Title not available (Why is that?)
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)
