Parallel tree-contraction and Fibonacci numbers

DOI10.1016/0020-0190(96)00118-4zbMath0900.68239OpenAlexW2081982413MaRDI QIDQ671622

Wojciech Plandowski, Tomasz Szymacha, Wojciech Rytter

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)

Related Items (2)

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

Cites Work

• On efficient parallel computations for some dynamic programming problems
• A combinatorial property of the Fibonacci words
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
• Unnamed Item
• Unnamed Item
• Unnamed Item

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