Bijection between progressive and rushed Dyck paths (both counted by A287709) and between rushed paths and one-sided trees.
Theoret- ical Computer Science 281(1-2), pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Algebraic characterization of runtime pgfs for GCP programs via kernel polynomial roots yields dominant singularities and exact asymptotics for single-state cases.
citing papers explorer
-
Progressive and Rushed Dyck Paths
Bijection between progressive and rushed Dyck paths (both counted by A287709) and between rushed paths and one-sided trees.
-
On the algebraic analysis of runtime distribution of probabilistic programs
Algebraic characterization of runtime pgfs for GCP programs via kernel polynomial roots yields dominant singularities and exact asymptotics for single-state cases.