Depth-size trade-offs for parallel prefix computation
From MaRDI portal
Publication:3745780
DOI10.1016/0196-6774(86)90003-9zbMath0606.94020OpenAlexW1979306010MaRDI QIDQ3745780
Publication date: 1986
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(86)90003-9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
A fast algorithm for scalar Nevanlinna-Pick interpolation ⋮ OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES ⋮ \(K\)-dimensional optimal parallel algorithm for the solution of a general class of recurrence equations ⋮ Computations over finite monoids and their test complexity ⋮ The average case complexity of the parallel prefix problem ⋮ Parallel prefix computation with few processors ⋮ Limited width parallel prefix circuits ⋮ Fast computation of continued fractions ⋮ Parallel prefix computation on extended multi-mesh network. ⋮ Size-depth trade-offs for monotone arithmetic circuits
This page was built for publication: Depth-size trade-offs for parallel prefix computation
