Parallel tree contraction and prefix computations on a large family of interconnection topologies

DOI10.1007/BF01177744zbMath0824.68041OpenAlexW4236847498MaRDI QIDQ1892710

W. J. Hsu, C. V. Page

Publication date: 21 June 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01177744

zbMATH Keywords

generalized Fibonacci cube

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

A class of almost-optimal size-independent parallel prefix circuits ⋮ Recursive fault-tolerance of Fibonacci cube in hypercubes ⋮ Determining which Fibonacci (\(p,r\))-cubes can be \(Z\)-transformation graphs

Cites Work

• Parallel Prefix Computation
• Ultracomputers
• A simple parallel tree contraction algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel tree contraction and prefix computations on a large family of interconnection topologies