Author of the publication

Derandomizing random walks in undirected graphs using locally fair exploration strategies.

, , , and . Distributed Comput., 24 (2): 91-99 (2011)

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

A $O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity. CoRR, (2012)On Bounded Load Routings for Modeling k-Regular Connection Topologies., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 614-623. Springer, (2005)Packing 1, Delta -factors in graphs of small degree., , and . J. Comb. Optim., 14 (1): 63-86 (2007)Does adding more agents make a difference? A case study of cover time for the rotor-router., and . J. Comput. Syst. Sci., (2019)A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves., and . PPAM, volume 3911 of Lecture Notes in Computer Science, page 75-82. Springer, (2005)Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds., , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 701-712. Springer, (2011)A note on the strength and minimum color sum of bipartite graphs.. Discret. Appl. Math., 157 (11): 2552-2554 (2009)Energy Optimisation in Resilient Self-Stabilizing Processes., and . PARELEC, page 105-110. IEEE Computer Society, (2006)On the Power of Louvain in the Stochastic Block Model., , , and . NeurIPS, (2020)Cost Minimisation in Unbounded Multi-interface Networks., and . PPAM, volume 4967 of Lecture Notes in Computer Science, page 1039-1047. Springer, (2007)