Parallel tree-contraction and Fibonacci numbers

DOI10.1016/0020-0190(96)00118-4MaRDI QIDQ671622zbMATH OpenOpenAlexFDO

Authors Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00118-4

zbMATH Keywords

Expression evaluationParallel computationsTree-contraction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A simple parallel tree contraction algorithm
• Parallel tree contraction and prefix computations on a large family of interconnection topologies
• The use of Fibonacci numbers for design of some parallel algorithms
• Parallel Tree Contraction Part 2: Further Applications

Cites work

• scientific article; zbMATH DE number 4172382 (Why is no real title available?)
• scientific article; zbMATH DE number 3958731 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• A combinatorial property of the Fibonacci words
• On efficient parallel computations for some dynamic programming problems
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition

Cited in

(2)

• Embedding height balanced trees and Fibonacci trees in hypercubes
• Parallel recognition and ranking of context-free languages

This page was built for publication: Parallel tree-contraction and Fibonacci numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671622)