𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fully parallel algorithm for residue to binary conversion

✍ Scribed by Ferruccio Barsi; M.Cristina Pinotti

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
557 KB
Volume
50
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Algorithm and Parallel Impl
An Efficient Algorithm and Parallel Implementations for Binary and Residue Number Systems
✍ C.N. Zhang; B. Shirazi; D.Y.Y. Yun πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 331 KB

Arithmetic units based on a Residue Number System (RNS) are fast and simple, and therefore attractive for use in digital signal processing and symbolic computation applications. However, RNS suffers from overheads of converting numbers to and from residue system. We present a new simple and uniform

A Technique to Speed Up Parallel Fully D
A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST
✍ P. Ferragina πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 826 KB

We provide a new EREW PRAM algorithm to maintain the minimum spanning tree (MST) of an undirected weighted graph. Our approach combines the sparsification data structure with a novel parallel technique which efficiently treats single edge deletions. The proposed parallel algorithm requires \(O(\log