Efficient computation of the iteration of functions

DOI10.1016/J.TCS.2008.12.019MaRDI QIDQ1006085zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Decompositions of graphs of functions and fast iterations of lookup tables
• Automata, Languages and Programming
• Iteration and iterative roots of fractional polynomial function
• Iteration functions re-visited
• Efficient exact computation of iterated maps

Cites work

• scientific article; zbMATH DE number 2127732 (Why is no real title available?)
• scientific article; zbMATH DE number 4027493 (Why is no real title available?)
• scientific article; zbMATH DE number 16479 (Why is no real title available?)
• Constructing pseudo-random permutations with a prescribed structure
• Decompositions of graphs of functions and fast iterations of lookup tables
• 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
• Register Allocation for Unary–Binary Trees
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• The register function for t -ary trees

Cited in

(4)

• Efficiency of one class of iterative processes
• Uncertainty propagation in multibody human model dynamics
• Efficient evaluation of oversampled functions
• Automata, Languages and Programming

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

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