Efficient computation of the iteration of functions

DOI10.1016/j.tcs.2008.12.019zbMath1162.68017OpenAlexW2097305748MaRDI QIDQ1006085

Tsung-Hsi Tsai

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.019

zbMATH Keywords

Horton-Strahler numberfast forward propertyregister functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Uncertainty propagation in multibody human model dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions of graphs of functions and fast iterations of lookup tables
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• Constructing pseudo-random permutations with a prescribed structure
• The register function for t -ary trees
• Register Allocation for Unary–Binary Trees
• On Horton's Law for Random Channel Networks
• On the Order of Random Channel Networks
• Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation

This page was built for publication: Efficient computation of the iteration of functions