| On the Rank of a Random Binary Matrix | 0 | 0.34 | 2019 |
| Triangle-creation processes on cubic graphs. | 0 | 0.34 | 2019 |
| On the rank of a random binary matrix. | 0 | 0.34 | 2019 |
| New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs | 0 | 0.34 | 2019 |
| Dispersion processes. | 0 | 0.34 | 2018 |
| The cover time of a biased random walk on Gn, p. | 1 | 0.40 | 2018 |
| The cover time of a biased random walk on a random cubic graph. | 0 | 0.34 | 2018 |
| An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data. | 0 | 0.34 | 2018 |
| On the Cover Time of Dense Graphs | 0 | 0.34 | 2018 |
| Multi-Agent Flag Coordination Games. | 0 | 0.34 | 2017 |
| Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time. | 0 | 0.34 | 2017 |
| On the Length of a Random Minimum Spanning Tree. | 4 | 0.49 | 2016 |
| Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. | 2 | 0.47 | 2016 |
| DISCORDANT VOTING PROCESSES ON FINITE GRAPHS | 1 | 0.35 | 2016 |
| Long Paths In Random Apollonian Networks | 1 | 0.43 | 2015 |
| Speeding Up Cover Time of Sparse Graphs Using Local Knowledge. | 1 | 0.41 | 2015 |
| The Power of Two Choices in Distributed Voting. | 20 | 1.21 | 2014 |
| The height of random k-trees and related branching processes | 3 | 0.54 | 2014 |
| Estimating network parameters using random walks | 8 | 0.74 | 2014 |
| Random walks in recommender systems: exact computation and simulations | 20 | 0.67 | 2014 |
| A fast algorithm to find all high degree vertices in graphs with a power law degree sequence | 5 | 0.49 | 2014 |
| Some typical properties of the spatial preferred attachment model | 13 | 0.77 | 2014 |
| Cover time of a random graph with a degree sequence II: Allowing vertices of degree two | 0 | 0.34 | 2014 |
| Component structure of the vacant set induced by a random walk on a random graph | 2 | 0.48 | 2013 |
| Coalescing Random Walks and Voting on Connected Graphs. | 14 | 0.84 | 2013 |
| The cover times of random walks on random uniform hypergraphs | 0 | 0.34 | 2013 |
| Fast Low-Cost Estimation Of Network Properties Using Random Walks | 2 | 0.38 | 2013 |
| Cover time of a random graph with given degree sequence. | 6 | 0.72 | 2012 |
| Chains-into-bins processes | 0 | 0.34 | 2012 |
| Stationary distribution and cover time of random walks on random digraphs | 7 | 0.56 | 2011 |
| Random walks, interacting particles, dynamic networks: randomness can be helpful | 6 | 0.49 | 2011 |
| The cover time of random geometric graphs | 18 | 0.90 | 2011 |
| The cover times of random walks on hypergraphs | 113 | 3.67 | 2011 |
| Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies | 4 | 0.50 | 2011 |
| Viral processes by random walks on random regular graphs | 1 | 0.35 | 2011 |
| Scale-free graphs of increasing degree | 5 | 0.55 | 2011 |
| Scale Free Properties Of Random K-Trees | 4 | 0.47 | 2010 |
| Locating and repairing faults in a network with mobile agents | 18 | 0.67 | 2010 |
| The cover time of cartesian product graphs | 3 | 0.45 | 2010 |
| Component structure induced by a random walk on a random graph | 0 | 0.34 | 2010 |
| Hamilton Cycles in Random Graphs with a Fixed Degree Sequence | 2 | 0.39 | 2010 |
| Random Walks with Look-Ahead in Scale-Free Random Graphs | 2 | 0.38 | 2010 |
| An efficient sparse regularity concept | 11 | 0.54 | 2010 |
| Energy efficient randomised communication in unknown AdHoc networks | 16 | 0.82 | 2009 |
| Martingales on trees and the empire chromatic number of random trees | 5 | 0.74 | 2009 |
| Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401–439 | 1 | 0.38 | 2009 |
| An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm | 0 | 0.34 | 2009 |
| Multiple Random Walks and Interacting Particle Systems | 7 | 0.68 | 2009 |
| Multiple Random Walks in Random Regular Graphs | 45 | 1.78 | 2009 |
| Random Walks on Random Graphs | 3 | 0.70 | 2008 |
