Linear Algorithms That Are Efficiently Parallelized to Time O(logn)

Authors:
Ted Herman
Affiliations:
-
Venue:
Linear Algorithms That Are Efficiently Parallelized to Time O(logn)
Year:
1985

Citing 0
Cited 5

Fast Parallel Algorithms for Binary Multiplication and their Implementation on Systolic Architectures

IEEE Transactions on Computers
A new parallel multiplication algorithm and its VLSI implementation

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
New Efficient Structure for a Modular Multiplier for RNS

IEEE Transactions on Computers
Fast Parallel Algorithm for Ternary Multiplication Using Multivalued I/sup 2/L Technology

IEEE Transactions on Computers
VLSI Implementation of Modulo Multiplication Using Carry Free Addition

VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract