Author of the publication

The k-Cut Model in Conditioned Galton-Watson Trees.

, , and . AofA, volume 159 of LIPIcs, page 5:1-5:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

k -cuts on a Path., , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 112-123. Springer, (2019)Random Records and Cuttings in Binary Search Trees.. Comb. Probab. Comput., 19 (3): 391-424 (2010)Permutations in Binary Trees and Split Trees., , , and . AofA, volume 110 of LIPIcs, page 9:1-9:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees., and . AofA, volume 225 of LIPIcs, page 3:1-3:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Cutting resilient networks - complete binary trees., and . CoRR, (2018)Broadcasting-induced colorings of preferential attachment trees., , and . Random Struct. Algorithms, 63 (2): 364-405 (September 2023)Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey.. DGMM, volume 12708 of Lecture Notes in Computer Science, page 20-57. Springer, (2021)Degree distributions of generalized hooking networks., and . ANALCO, page 103-110. SIAM, (2019)Inversions in Split Trees and Conditional Galton-Watson Trees., , , , and . AofA, volume 110 of LIPIcs, page 15:1-15:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Cutting Resilient Networks - Complete Binary Trees., and . Electron. J. Comb., 26 (4): 4 (2019)