From post

Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees.

, и . AofA, том 225 из LIPIcs, стр. 3:1-3:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

 

Другие публикации лиц с тем же именем

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