Bit serial addition trees and their applications
type: Item
instance of: scholarly article
title: Bit serial addition trees and their applications
zbMATH Open document ID: 0638.68009
DOI: 10.1007/BF02242186
author: Selim G. Akl
author: Henk Meijer
published in: Computing
publication date: 1988-01-01T00:00:00Z
review text: Parallel algorithms are examined for a number of fundamental computational problems. All algorithms have as a basic operation the addition of k-bit integers. For each problem we present a solution in the form of a logical circuit for which the product of the computation time and number of gates used is smaller than that of the best previously known algorithm.
Mathematics Subject Classification ID: 68N99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4041237
zbMATH Keywords: Parallel algorithms
zbMATH Keywords: logical circuit
MaRDI profile type: Publication
cites work: Q3805925
cites work: Q3890085
cites work: Efficient selection on a binary tree
cites work: Q3816955
cites work: Q3326832
full work available at URL: https://doi.org/10.1007/bf02242186
OpenAlex ID: W11522892
description: scientific article; zbMATH DE number 4041237