Parallel tree-contraction and Fibonacci numbers

DOI10.1016/0020-0190(96)00118-4zbMATH Open0900.68239OpenAlexW2081982413MaRDI QIDQ671622FDOQ671622

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

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

zbMATH Keywords

Expression evaluationParallel computationsTree-contraction

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A combinatorial property of the Fibonacci words
• Title not available (Why is that?)
• On efficient parallel computations for some dynamic programming problems
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
• Title not available (Why is that?)

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)