Combinatorics of increasing trees under increasing labellings: Asymptotics, bijections and algorithms. (Combinatoire des arbres sous étiquetages croissants: Asymptotiques, bijections et algorithmes) - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Mehdi Naima. Combinatorics of increasing trees under increasing labellings: Asymptotics, bijections and algorithms. (Combinatoire des arbres sous étiquetages croissants: Asymptotiques, bijections et algorithmes). PhD thesis, University Sorbonne Paris Nord, France, 2020. [doi]

This author has not been identified. Look up 'Mehdi Naima' in Google

runs on WebDSL