From post

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.

 

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

Sampling regular graphs and a peer-to-peer network., , и . SODA, стр. 980-988. SIAM, (2005)Discordant Voting Processes on Finite Graphs., , , и . ICALP, том 55 из LIPIcs, стр. 145:1-145:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Fast Plurality Consensus in Regular Expanders., , , и . DISC, том 91 из LIPIcs, стр. 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Cover Time of a Biased Random Walk on a Random Cubic Graph., , и . AofA, том 110 из LIPIcs, стр. 16:1-16:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence., и . Comb. Probab. Comput., 13 (3): 319-337 (2004)Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity., , и . Comb. Probab. Comput., 11 (3): 249-261 (2002)On the Length of a Random Minimum Spanning Tree., , , , и . Comb. Probab. Comput., 25 (1): 89-107 (2016)On the Trickness of Sparse Random Graphs.. Comb. Probab. Comput., (1992)Component structure induced by a random walk on a random graph, и . CoRR, (2010)Dispersion processes., , , , и . CoRR, (2017)