The following pages link to Thomas Sauerwald (Q287993):
Displaying 50 items.
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions (Q378238) (← links)
- Randomised broadcasting: memory vs. randomness (Q391757) (← links)
- Cutoff phenomenon for random walks on Kneser graphs (Q403570) (← links)
- Asymptotic bounds on the equilateral dimension of hypercubes (Q497358) (← links)
- Intersection and mixing times for reversible chains (Q508469) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- The cover time of deterministic random walks (Q612954) (← links)
- Randomized diffusion for indivisible loads (Q743119) (← links)
- (Q838154) (redirect page) (← links)
- On the runtime and robustness of randomized broadcasting (Q838155) (← links)
- On mixing and edge expansion properties in randomized broadcasting (Q848940) (← links)
- Agent-based randomized broadcasting in large networks (Q867856) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- On randomized broadcasting in star graphs (Q1003763) (← links)
- Beyond good partition shapes: an analysis of diffusive graph partitioning (Q1934315) (← links)
- Accelerated information dissemination on networks with local and global edges (Q2097337) (← links)
- Faster rumor spreading with multiple calls (Q2256120) (← links)
- Communication complexity of quasirandom rumor spreading (Q2354024) (← links)
- Fast message dissemination in random geometric networks (Q2375822) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Lock-Free Algorithms under Stochastic Schedulers (Q2796261) (← links)
- Quasirandom Rumor Spreading on Expanders (Q2851470) (← links)
- Faster Rumor Spreading with Multiple Calls (Q2872108) (← links)
- (Q2904772) (← links)
- Balls into bins via local search: cover time and maximum load (Q2965483) (← links)
- Faster Coupon Collecting via Replication with Applications in Gossiping (Q3088030) (← links)
- Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions (Q3104613) (← links)
- Quasirandom Load Balancing (Q3143292) (← links)
- Counting Arbitrary Subgraphs in Data Streams (Q3167047) (← links)
- Ultra-Fast Load Balancing on Scale-Free Networks (Q3449501) (← links)
- Self-stabilizing Cuts in Synchronous Networks (Q3511402) (← links)
- On Radio Broadcasting in Random Geometric Graphs (Q3540232) (← links)
- Randomised Broadcasting: Memory vs. Randomness (Q3557029) (← links)
- (Q3579453) (← links)
- (Q3579471) (← links)
- Communication Complexity of Quasirandom Rumor Spreading (Q3586457) (← links)
- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs (Q3590930) (← links)
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness (Q3638048) (← links)
- Tight Bounds for the Cover Time of Multiple Random Walks (Q3638052) (← links)
- (Q4636644) (← links)
- Distributed Selfish Load Balancing on Networks (Q4962160) (← links)
- Quasirandom Rumor Spreading (Q4962167) (← links)
- (Q5091254) (← links)
- Random Walks on Randomly Evolving Graphs (Q5100954) (← links)
- (Q5111472) (← links)
- (Q5111724) (← links)
- Randomized Rumor Spreading in Dynamic Graphs (Q5167863) (← links)
- Near-perfect load balancing by randomized rounding (Q5172705) (← links)
- The multi-agent rotor-router on the ring (Q5176115) (← links)
- Expansion and the cover time of parallel random walks (Q5176208) (← links)
