The following pages link to (Q4027617):
Displaying 17 items.
- Algorithms for combinatorial structures: well-founded systems and Newton iterations (Q444909) (← links)
- True trees are dense (Q742834) (← links)
- A note on the Horton-Strahler number for random trees (Q1338782) (← links)
- A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
- Random self-similar trees and a hierarchical branching process (Q2000157) (← links)
- Random self-similar trees: a mathematical theory of Horton laws (Q2305573) (← links)
- On the stack-size of general tries (Q2771494) (← links)
- On the Horton-Strahler number for random tries (Q3126013) (← links)
- Pick a Tree – Any Tree (Q3466029) (← links)
- (Q3581933) (← links)
- SOME TREELIKE OBJECTS (Q3764179) (← links)
- Universal Limit Laws for Depths in Random Trees (Q4210155) (← links)
- (Q4356134) (← links)
- An open ended tree (Q4452600) (← links)
- Tokunaga self-similarity arises naturally from time invariance (Q4565963) (← links)
- (Q4949856) (← links)
- Trees and gaps from a construction scheme (Q5298209) (← links)