A unified approach to the analysis of Horton-Strahler parameters of binary tree structures
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
The register function for t-ary trees
ACM Transactions on Algorithms (TALG)
Note: Efficient computation of the iteration of functions
Theoretical Computer Science
Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
| Hi-index | 0.01 |