On the public citation graph

The average number of registers needed to evaluate a binary tree optimally

0 signed · 63 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-50026-8openalex-snapshot
Arithmetical Functions
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50007-6openalex-snapshot
THE AVERAGE HEIGHT OF PLANTED PLANE TREES
inferredcites →https://doi.org/10.1145/321607.321620openalex-snapshot
The Generation of Optimal Code for Arithmetic Expressions
inferredcites →https://doi.org/10.1145/363534.363549openalex-snapshot
On compiling algorithms for arithmetic expressions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.10052openalex-snapshot
A unified approach to the analysis of Horton‐Strahler parameters of binary tree structures
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_28openalex-snapshot
On the average stack size of regularly distributed binary trees
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_72openalex-snapshot
On the analysis of tree-matching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_27openalex-snapshot
Recursion depth analysis for special tree traversal algorithms
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_38openalex-snapshot
Trees everywhere
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_28openalex-snapshot
Monotonically labelled ordered trees and multidimensional binary trees
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_110openalex-snapshot
Solution of a problem of yekutieli and mandelbrot
inferred← citeshttps://doi.org/10.1007/978-3-0348-7915-6_21openalex-snapshot
New Strahler Numbers for Rooted Plane Trees
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_22openalex-snapshot
Digits and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_1openalex-snapshot
A Brief History of Strahler Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-51005-2_22openalex-snapshot
On the Shape of Trees: Tools to Describe Ramified Patterns
inferred← citeshttps://doi.org/10.1007/bf01044733openalex-snapshot
Combinatorial tools for the analysis of ramified patterns
inferred← citeshttps://doi.org/10.1007/bf01190510openalex-snapshot
The joint distribution of the three types of nodes in uniform binary trees
inferred← citeshttps://doi.org/10.1007/bf02242000openalex-snapshot
The average height of r-typly rooted planted plane trees
inferred← citeshttps://doi.org/10.1007/bfb0028829openalex-snapshot
Enumerative combinatorics and algebraic languages
inferred← citeshttps://doi.org/10.1007/bfb0101650openalex-snapshot
Die Bestimmung Gewisser Parameter Bei Binären Bäumen Mit Hilfe Analytischer Methoden
inferred← citeshttps://doi.org/10.1007/s10712-021-09682-0openalex-snapshot
Random Self-Similar Trees: Emergence of Scaling Laws
inferred← citeshttps://doi.org/10.1007/s12237-021-00898-2openalex-snapshot
Investigation of Spatial and Temporal Salinity Distribution in a River Dominated Delta through Idealized Numerical Modelling
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90048-3openalex-snapshot
A one-to-one correspondence between two classes of ordered trees
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00135-9openalex-snapshot
A note on the Horton-Strahler number for random trees
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00114-ropenalex-snapshot
A note on the Horton-Strahler number for random trees
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90004-6openalex-snapshot
The average height of binary trees and other simple trees
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90028-uopenalex-snapshot
Matrice de ramification des arbres binaires
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90009-5openalex-snapshot
On the recursion depth of special tree traversal algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/j.ic.2015.11.008openalex-snapshot
Convergence of Newton's Method over Commutative Semirings
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.04.012openalex-snapshot
The scientific works of Rainer Kemp (1949–2004)
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.019openalex-snapshot
Efficient computation of the iteration of functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.024openalex-snapshot
An analytic approach to the asymptotic variance of trie statistics and related structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.015openalex-snapshot
Reductions of binary trees and lattice paths induced by the register function
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00265-5openalex-snapshot
A Strahler bijection between Dyck paths and planar trees
inferred← citeshttps://doi.org/10.1016/s0012-365x(81)80013-1openalex-snapshot
On the average depth of a prefix of the Dycklanguage Dl
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90320-4openalex-snapshot
Generating functions for derivation trees
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80056-4openalex-snapshot
Patterns and pattern-matching in trees: An analysis
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73059-7openalex-snapshot
Some Recent Results on the Register Function of a Binary Tree
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00269-1openalex-snapshot
On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees
inferred← citeshttps://doi.org/10.1051/ita/1983170302491openalex-snapshot
The reduction of binary trees by means of an input-restricted deque
inferred← citeshttps://doi.org/10.1051/ita/1984180403551openalex-snapshot
Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétique
inferred← citeshttps://doi.org/10.1051/ita/1993270605411openalex-snapshot
On the average number of registers needed to evaluate a special class of backtrack trees
inferred← citeshttps://doi.org/10.1051/ita/1996300504431openalex-snapshot
On the Horton-Strahler number for random tries
inferred← citeshttps://doi.org/10.1063/1.5048965openalex-snapshot
Entropy rates for Horton self-similar trees
inferred← citeshttps://doi.org/10.1088/0305-4470/27/2/013openalex-snapshot
Self-similarity of the branching structure in very large DLA clusters and other branching fractals
inferred← citeshttps://doi.org/10.1088/0305-4470/27/2/014openalex-snapshot
Horton-Strahler ordering of random binary trees
inferred← citeshttps://doi.org/10.1137/0215046openalex-snapshot
Register Allocation for Unary–Binary Trees
inferred← citeshttps://doi.org/10.1137/0601051openalex-snapshot
Acknowledgment of Priority: On the Order of Random Channel Networks
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/1159892.1159894openalex-snapshot
The register function for t -ary trees
inferred← citeshttps://doi.org/10.1145/2402.322388openalex-snapshot
Instruction Sets for Evaluating Arithmetic Expressions
inferred← citeshttps://doi.org/10.1145/74333.74336openalex-snapshot
Combinatorial analysis of ramified patterns and computer imagery of trees
inferred← citeshttps://doi.org/10.1145/74334.74336openalex-snapshot
Combinatorial analysis of ramified patterns and computer imagery of trees
inferred← citeshttps://doi.org/10.1214/16-aihp748openalex-snapshot
Horton self-similarity of Kingman’s coalescent tree
inferred← citeshttps://doi.org/10.1214/19-ps331openalex-snapshot
Random self-similar trees: A mathematical theory of Horton laws
inferred← citeshttps://doi.org/10.1214/21-ejp678openalex-snapshot
The Horton–Strahler number of conditioned Galton–Watson trees
inferred← citeshttps://doi.org/10.1214/25-aap2204openalex-snapshot
The Horton–Strahler number of Galton–Watson trees with possibly infinite variance
inferred← citeshttps://doi.org/10.46298/dmtcs.3560openalex-snapshot
The register function for lattice paths
inferred← citeshttps://doi.org/10.48550/arxiv.1602.06200openalex-snapshot
The Register Function and Reductions of Binary Trees and Lattice Paths
inferred← citeshttps://doi.org/10.48550/arxiv.2103.15791openalex-snapshot
Philippe Flajolet's early work in combinatorics
inferred← citeshttps://doi.org/10.54550/eca2022v2s1h1openalex-snapshot
Philippe Flajolet's early work in combinatorics
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.