Parallel tree contraction and prefix computations on a large family of interconnection topologies (Q1892710): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultracomputers / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01177744 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4236847498 / rank
 
Normal rank

Latest revision as of 10:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Parallel tree contraction and prefix computations on a large family of interconnection topologies
scientific article

    Statements

    Parallel tree contraction and prefix computations on a large family of interconnection topologies (English)
    0 references
    0 references
    0 references
    0 references
    21 June 1995
    0 references
    0 references
    generalized Fibonacci cube
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references