Fast prefix adders for non-uniform input arrival times (Q513308): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-015-0067-x / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65Y04 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6691986 / rank
 
Normal rank
Property / zbMATH Keywords
 
circuit
Property / zbMATH Keywords: circuit / rank
 
Normal rank
Property / zbMATH Keywords
 
delay
Property / zbMATH Keywords: delay / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel prefix problem
Property / zbMATH Keywords: parallel prefix problem / rank
 
Normal rank
Property / zbMATH Keywords
 
addition
Property / zbMATH Keywords: addition / rank
 
Normal rank
Property / zbMATH Keywords
 
prefix adder
Property / zbMATH Keywords: prefix adder / rank
 
Normal rank
Property / zbMATH Keywords
 
non-uniform input arrival times
Property / zbMATH Keywords: non-uniform input arrival times / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167757808 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1411.2917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster optimal parallel prefix sums and list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The delay of circuits whose inputs have specified arrival times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delay optimization of linear depth Boolean circuits with prescribed input arrival times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cost of optimal alphabetic code trees with unequal letter costs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-015-0067-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:00, 9 December 2024

scientific article
Language Label Description Also known as
English
Fast prefix adders for non-uniform input arrival times
scientific article

    Statements

    Fast prefix adders for non-uniform input arrival times (English)
    0 references
    0 references
    0 references
    0 references
    6 March 2017
    0 references
    circuit
    0 references
    delay
    0 references
    parallel prefix problem
    0 references
    addition
    0 references
    prefix adder
    0 references
    non-uniform input arrival times
    0 references

    Identifiers