| Publication | Date of Publication | Type |
|---|
| The support of open versus closed random walks | 2024-11-14 | Paper |
| Tight bounds for repeated balls-into-bins | 2024-10-08 | Paper |
| Balanced allocations: caching and packing, twinning and thinning | 2024-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126348 | 2024-04-09 | Paper |
| Balanced Allocations with the Choice of Noise | 2024-03-26 | Paper |
| The Power of Filling in Balanced Allocations | 2024-02-07 | Paper |
| Rumors with Changing Credibility | 2023-11-28 | Paper |
| Multiple random walks on graphs: mixing few to cover many | 2023-11-08 | Paper |
| Spread of information and diseases via random walks in sparse graphs | 2023-11-02 | Paper |
| Time Dependent Biased Random Walks | 2023-10-31 | Paper |
| On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? | 2023-10-23 | Paper |
| An Improved Drift Theorem for Balanced Allocations | 2023-08-21 | Paper |
| The power of two choices for random walks | 2023-03-31 | Paper |
| Balanced Allocations in Batches: The Tower of Two Choices | 2023-02-08 | Paper |
| Choice and Bias in Random Walks | 2023-02-03 | Paper |
| Balanced Allocations with Heterogeneous Bins: The Power of Memory | 2023-01-23 | Paper |
| Accelerated information dissemination on networks with local and global edges | 2022-11-11 | Paper |
| Random Walks on Randomly Evolving Graphs | 2022-09-01 | Paper |
| Random walks on dynamic graphs: mixing times, hitting times, and return probabilities | 2022-07-21 | Paper |
| Balanced Allocations in Batches: Simplified and Generalized | 2022-03-25 | Paper |
| Tight Bounds for Repeated Balls-into-Bins | 2022-03-23 | Paper |
| Balanced Allocations: Caching and Packing, Twinning and Thinning | 2021-10-20 | Paper |
| Random walks on randomly evolving graphs | 2020-06-18 | Paper |
| Bounds on the satisfiability threshold for power law distributed random SAT | 2020-05-27 | Paper |
| Randomized load balancing on networks with stochastic inputs | 2020-05-27 | Paper |
| The Power of Two Choices for Random Walks | 2019-11-12 | Paper |
| On coalescence time in graphs: when is coalescing as fast as meeting? Extended abstract | 2019-10-15 | Paper |
| Quasirandom Rumor Spreading: An Experimental Analysis | 2019-09-11 | Paper |
| Balls into bins via local search | 2019-05-15 | Paper |
| Rumor spreading and vertex expansion | 2019-05-10 | Paper |
| Ultra-fast rumor spreading in social networks | 2019-05-10 | Paper |
| Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities | 2019-03-04 | Paper |
| Distributed selfish load balancing on networks | 2018-10-30 | Paper |
| Quasirandom rumor spreading | 2018-10-30 | Paper |
| The dispersion time of random walks on finite graphs | 2018-08-28 | Paper |
| Multiple random walks on paths and grids | 2018-04-19 | Paper |
| The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks | 2017-10-06 | Paper |
| Randomized rumour spreading: the effect of the network topology | 2017-10-04 | Paper |
| Distributed selfish load balancing on networks | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365056 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365053 | 2017-09-29 | Paper |
| Balls into bins via local search: cover time and maximum load | 2017-03-03 | Paper |
| Intersection and mixing times for reversible chains | 2017-02-07 | Paper |
| Balls into bins via local search: cover time and maximum load | 2016-07-25 | Paper |
| A simple approach for adapting continuous load balancing processes to discrete settings | 2016-05-23 | Paper |
| Lock-free algorithms under stochastic schedulers | 2016-03-23 | Paper |
| Ultra-fast load balancing on scale-free networks | 2015-11-04 | Paper |
| Asymptotic bounds on the equilateral dimension of hypercubes | 2015-09-24 | Paper |
| Communication complexity of quasirandom rumor spreading | 2015-07-10 | Paper |
| The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks | 2015-03-02 | Paper |
| Expansion and the cover time of parallel random walks | 2015-03-02 | Paper |
| Discrete load balancing is (almost) as easy as continuous load balancing | 2015-03-02 | Paper |
| Faster rumor spreading with multiple calls | 2015-02-19 | Paper |
| Near-perfect load balancing by randomized rounding | 2015-02-04 | Paper |
| The impact of randomization in smoothing networks | 2014-12-12 | Paper |
| A simple approach for adapting continuous load balancing processes to discrete settings | 2014-12-05 | Paper |
| Randomized diffusion for indivisible loads | 2014-09-22 | Paper |
| Cutoff phenomenon for random walks on Kneser graphs | 2014-08-29 | Paper |
| Randomized Rumor Spreading in Dynamic Graphs | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417718 | 2014-05-22 | Paper |
| Speeding up random walks with neighborhood exploration | 2014-05-22 | Paper |
| Quasirandom load balancing | 2014-05-22 | Paper |
| Quasirandom rumor spreading, an experimental analysis | 2014-04-01 | Paper |
| Faster rumor spreading with multiple calls | 2014-01-14 | Paper |
| Randomised broadcasting: memory vs. randomness | 2014-01-13 | Paper |
| Diameter and broadcast time of random geometric graphs in arbitrary dimensions | 2013-11-11 | Paper |
| Quasirandom rumor spreading on expanders | 2013-10-10 | Paper |
| Fast message dissemination in random geometric networks | 2013-06-25 | Paper |
| Beyond good partition shapes: an analysis of diffusive graph partitioning | 2013-01-28 | Paper |
| Quasirandom load balancing | 2012-11-29 | Paper |
| Counting arbitrary subgraphs in data streams | 2012-11-01 | Paper |
| Low randomness rumor spreading via hashing | 2012-08-23 | Paper |
| Cover time and broadcast time | 2012-04-24 | Paper |
| Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies | 2012-01-12 | Paper |
| Diameter and broadcast time of random geometric graphs in arbitrary dimensions | 2011-12-16 | Paper |
| Faster coupon collecting via replication with applications in gossiping | 2011-08-17 | Paper |
| Tight bounds for the cover time of multiple random walks | 2011-06-07 | Paper |
| The impact of randomization in smoothing networks | 2010-09-09 | Paper |
| Communication complexity of quasirandom rumor spreading | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579453 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579471 | 2010-08-06 | Paper |
| Randomised Broadcasting: Memory vs. Randomness | 2010-04-27 | Paper |
| A self-stabilizing algorithm for cut problems in synchronous networks | 2010-04-06 | Paper |
| On mixing and edge expansion properties in randomized broadcasting | 2010-02-23 | Paper |
| On the runtime and robustness of randomized broadcasting | 2009-08-21 | Paper |
| The Weighted Coupon Collector’s Problem and Applications | 2009-07-23 | Paper |
| Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness | 2009-07-14 | Paper |
| Tight Bounds for the Cover Time of Multiple Random Walks | 2009-07-14 | Paper |
| On randomized broadcasting in star graphs | 2009-03-04 | Paper |
| On Radio Broadcasting in Random Geometric Graphs | 2008-11-20 | Paper |
| Self-stabilizing Cuts in Synchronous Networks | 2008-07-10 | Paper |
| On Mixing and Edge Expansion Properties in Randomized Broadcasting | 2008-05-27 | Paper |
| On the Runtime and Robustness of Randomized Broadcasting | 2008-04-24 | Paper |
| Analyzing Disturbed Diffusion on Networks | 2008-04-24 | Paper |
| Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs | 2007-09-03 | Paper |
| Agent-based randomized broadcasting in large networks | 2007-02-19 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Mean-Biased Processes for Balanced Allocations | N/A | Paper |
