Limited width parallel prefix circuits (Q547485)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Limited width parallel prefix circuits	scientific article

Statements

scholarly article

0 references

Limited width parallel prefix circuits (English)

0 references

David A. Carlson

0 references

0 references

The Journal of Supercomputing

0 references

publication date

2 July 2011

0 references

MaRDI profile type

MaRDI publication profile

0 references

On measures of information and their characterizations

0 references

Size-time complexity of Boolean networks for prefix computations

0 references

A Regular Layout for Parallel Adders

0 references

Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays

0 references

Time and Parallel Processor Bounds for Linear Recurrence Systems

0 references

An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines

0 references

Efficient parallel algorithms for linear recurrence computation

0 references

A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

0 references

Parallel Prefix Computation

0 references

Optimal algorithms for parallel polynomial evaluation

0 references

0 references

Depth-size trade-offs for parallel prefix computation

0 references

full work available at URL

https://doi.org/10.1007/bf00127876

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/BF00127876

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:547485

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q547485&oldid=37366160"