No. Title Author Year
1 The Support of Open Versus Closed Random Walks Sauerwald, Thomas et al. 2023
2 Tight Bounds for Repeated Balls-Into-Bins Los, Dimitrios et al. 2023
3 Balanced Allocations with Incomplete Information: The Power of Two Queries Los, Dimitrios et al. 2022
4 Multiple Random Walks on Graphs: Mixing Few to Cover Many Rivera, Nicolás et al. 2021
5 Choice and Bias in Random Walks Georgakopoulos, Agelos et al. 2020
6 Spread of Information and Diseases via Random Walks in Sparse Graphs Giakkoupis, George et al. 2020
7 Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities Sauerwald, Thomas et al. 2019
8 Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT Friedrich, Tobias et al. 2017
9 Multiple Random Walks on Paths and Grids Ivaskovic, Andrej et al. 2017
10 Randomized Load Balancing on Networks with Stochastic Inputs Cai, Leran et al. 2017
11 Balls into bins via local search: cover time and maximum load Bringmann, Karl et al. 2014
12 Low Randomness Rumor Spreading via Hashing Giakkoupis, George et al. 2012
13 Stabilizing Consensus with the Power of Two Choices Doerr, Benjamin et al. 2010
14 Cover Time and Broadcast Time Elsässer, Robert et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 14

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI