Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
Walks confined in a quadrant are not always D-finite
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Counting lattice paths taking steps in infinitely many directions under special access restrictions
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Proper generating trees and their internal path length
Discrete Applied Mathematics
Ultrametrics, Banach's fixed point theorem and the Riordan group
Discrete Applied Mathematics
The relevant prefixes of coloured Motzkin walks: An average case analysis
Theoretical Computer Science
| Hi-index | 0.05 |