Author of the publication

Random Walks with Look-Ahead in Scale-Free Random Graphs.

, and . SIAM J. Discret. Math., 24 (3): 1162-1176 (2010)

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

The Cover Time of a Biased Random Walk on a Random Cubic Graph., , and . AofA, volume 110 of LIPIcs, page 16:1-16:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Discordant Voting Processes on Finite Graphs., , , and . ICALP, volume 55 of LIPIcs, page 145:1-145:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Fast Plurality Consensus in Regular Expanders., , , and . DISC, volume 91 of LIPIcs, page 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Sampling regular graphs and a peer-to-peer network., , and . SODA, page 980-988. SIAM, (2005)A Note on the Connectivity of 2-Regular Digraphs.. Random Struct. Algorithms, 4 (4): 469-472 (1993)On the 2-Cyclic Property in 2-Regular Digraphs.. Random Struct. Algorithms, 6 (4): 439-448 (1995)The union of two random permutations does not have a directed Hamilton cycle.. Random Struct. Algorithms, 18 (1): 95-98 (2001)Hamilton cycles in random graphs and directed graphs., and . Random Struct. Algorithms, 16 (4): 369-401 (2000)On the cover time of dense graphs., , and . CoRR, (2018)Stationary distribution and cover time of random walks on random digraphs, and . CoRR, (2011)