Author of the publication

Average-case complexity of shortest-paths problems in the vertex-potential model.

, , , and . Random Struct. Algorithms, 16 (1): 33-46 (2000)

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)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)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)Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity., , and . Comb. Probab. Comput., 11 (3): 249-261 (2002)The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence., and . Comb. Probab. Comput., 13 (3): 319-337 (2004)On the Length of a Random Minimum Spanning Tree., , , , and . Comb. Probab. Comput., 25 (1): 89-107 (2016)On the Trickness of Sparse Random Graphs.. Comb. Probab. Comput., (1992)Random Deletion in a Scale-Free Random Graph Process., , and . Internet Math., 1 (4): 463-483 (2003)Hamilton Cycles in Random Graphs with a Fixed Degree Sequence., , and . SIAM J. Discret. Math., 24 (2): 558-569 (2010)A Note on the Connectivity of 2-Regular Digraphs.. Random Struct. Algorithms, 4 (4): 469-472 (1993)