Efficient computation of the iteration of functions
type: Item
instance of: scholarly article
title: Efficient computation of the iteration of functions
zbMATH Open document ID: 1162.68017
author: Tsung-Hsi Tsai
published in: Theoretical Computer Science
publication date: 2009-03-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5529528
zbMATH Keywords: fast forward property
zbMATH Keywords: Horton-Strahler number
zbMATH Keywords: register functions
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.019
OpenAlex ID: W2097305748
cites work: Q3154680
cites work: The register function for t -ary trees
cites work: Q3973158
cites work: Register Allocation for Unary–Binary Trees
cites work: The number of registers required for evaluating arithmetic expressions
cites work: The average number of registers needed to evaluate a binary tree optimally
cites work: On the Order of Random Channel Networks
cites work: On Horton's Law for Random Channel Networks
cites work: Constructing pseudo-random permutations with a prescribed structure
cites work: Q3768922
cites work: Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation
cites work: Decompositions of graphs of functions and fast iterations of lookup tables
DOI: 10.1016/J.TCS.2008.12.019
description: scientific article; zbMATH DE number 5529528