On the public citation graph
Register Allocation for Unary–Binary Trees
0 signed · 58 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-0348-4108-5openalex-snapshot
Handbuch der Laplace-Transformation
inferredcites →https://doi.org/10.1007/978-3-0348-6984-3openalex-snapshot
Handbuch der Laplace-Transformation
inferredcites →https://doi.org/10.1007/bf00289094openalex-snapshot
The average number of registers needed to evaluate a binary tree optimally
inferredcites →https://doi.org/10.1007/bf01601817openalex-snapshot
Sur les séries de Taylor n'ayant que des singularités algébrico-logarithmiques sur leur cercle de convergence
inferredcites →https://doi.org/10.1016/0001-8708(82)90005-6openalex-snapshot
Periodic oscillations of coefficients of power series that satisfy functional equations
inferredcites →https://doi.org/10.1016/0016-0032(75)90189-1openalex-snapshot
The use of integral transforms
inferredcites →https://doi.org/10.1016/0022-0000(82)90004-6openalex-snapshot
The average height of binary trees and other simple trees
inferredcites →https://doi.org/10.1016/0304-3975(79)90009-4openalex-snapshot
The number of registers required for evaluating arithmetic expressions
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.1051/ita/1983170302491openalex-snapshot
The reduction of binary trees by means of an input-restricted deque
inferredcites →https://doi.org/10.1137/0209014openalex-snapshot
A Note on Gray Code and Odd-Even Merge
inferredcites →https://doi.org/10.1137/0601005openalex-snapshot
On the Order of Random Channel Networks
inferredcites →https://doi.org/10.1145/321607.321620openalex-snapshot
The Generation of Optimal Code for Arithmetic Expressions
inferredcites →https://doi.org/10.1145/368892.368907openalex-snapshot
On programming of arithmetic operations
inferredcites →https://doi.org/10.1215/s0012-7094-60-02710-1openalex-snapshot
A generalization of a functional equation related to the theory of partitions
inferredcites →https://doi.org/10.4153/cjm-1978-085-0openalex-snapshot
On the Altitude of Nodes in Random Trees
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.1002/rsa.3240030309openalex-snapshot
Generalized Digital Trees and Their Difference—Differential Equations
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_76openalex-snapshot
The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
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-319-04921-2_1openalex-snapshot
A Brief History of Strahler Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-55357-3_14openalex-snapshot
On the Monoid Generated by a Lucas Sequence
inferred← citeshttps://doi.org/10.1007/978-3-7091-6803-5_2openalex-snapshot
Skeletal Images as Visual Cues in Graph Visualization
inferred← citeshttps://doi.org/10.1007/bf01939359openalex-snapshot
Brownian motion and algorithm complexity
inferred← citeshttps://doi.org/10.1007/bfb0022670openalex-snapshot
Random walks, gaussian processes and list structures
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/pl00009230openalex-snapshot
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics
inferred← citeshttps://doi.org/10.1007/s00010-015-0380-0openalex-snapshot
The height of multiple edge plane trees
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90028-4openalex-snapshot
Random walks, Gaussian processes and list structures
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
inferred← citeshttps://doi.org/10.1016/j.aam.2008.06.003openalex-snapshot
Combinatorial design of pseudoknot RNA
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.2017.09.015openalex-snapshot
Reductions of binary trees and lattice paths induced by the register function
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.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferred← citeshttps://doi.org/10.1137/0404050openalex-snapshot
A Large Deviation Rate and Central Limit Theorem for Horton Ratios
inferred← citeshttps://doi.org/10.1145/1159892.1159894openalex-snapshot
The register function for t -ary trees
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/aoap/1043862421openalex-snapshot
Some width function asymptotics for weighted trees
inferred← citeshttps://doi.org/10.1214/lnms/1215460495openalex-snapshot
Spatial statistics of random networks and a problem in river basin hydrology
inferred← citeshttps://doi.org/10.2307/3318630openalex-snapshot
A Self-Similar Invariance of Critical Binary Galton-Watson Trees
inferred← citeshttps://doi.org/10.2312/vissym19991020openalex-snapshot
Skeletal Images as Visual Cues in Graph Visualization
inferred← citeshttps://doi.org/10.31390/josa.3.4.01openalex-snapshot
The Degree Gini Index of Several Classes of Random Trees and Their Poissonized Counterparts�Evidence for Duality
inferred← citeshttps://doi.org/10.3233/fi-2012-701openalex-snapshot
Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height
inferred← citeshttps://doi.org/10.46298/dmtcs.3520openalex-snapshot
Minimal and maximal plateau lengths in Motzkin paths
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.1903.00086openalex-snapshot
The degree Gini index of several classes of random trees and their poissonized counterparts---an evidence for a duality theory
inferred← citeshttps://doi.org/10.48550/arxiv.2106.14782openalex-snapshot
Weighted unary-binary trees, Hex-trees, marked ordered trees, and related structures
inferred← citeshttps://doi.org/10.48550/arxiv.2111.14797openalex-snapshot
A walk in my lattice path garden
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.