Your search returned the following 33 documents:

33. Balls into bins via local search: cover time and maximum load
    Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, and He Sun
    In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), Lyon, France, 2014
    
32. Balls into Bins via Local Search
    Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, and He Sun
    In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), New Orleans, USA, 2013, 16-34
    
31. Brief Announcement: Threshold Load Balancing in Networks
    Martin Hoefer and Thomas Sauerwald
    In: 32nd Symposium on Principles of Distributed Computing (PODC-13), Montreal, Canada, 2013, 54-56
    
30. Faster Rumor Spreading with Multiple Calls
    Konstantinos Panagiotou, Ali Pourmiri, and Thomas Sauerwald
    In: 24th International Symposium on Algorithms and Computation (ISAAC-13), Hong Kong, China, 2013, 446-456
    
29. A simple approach for adapting continuous load balancing processes to discrete settings
    Hoda Akbari, Petra Berenbrink, and Thomas Sauerwald
    In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, Madeira, Portugal, 2012, 271-280
    
28. Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
    Henning Meyerhenke and Thomas Sauerwald
    Algorithmica 64 (3): 329-361, 2012
    
27. Counting Arbitrary Subgraphs in Data Streams
    Daniel Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun
    In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 598-609
    
26. Low Randomness Rumor Spreading via Hashing
    George Giakkoupis, Thomas Sauerwald, He Sun, and Philipp Woelfel
    In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 314-325
    
25. Quasirandom Load Balancing
    Tobias Friedrich, Martin Gairing, and Thomas Sauerwald
    SIAM Journal on Computing 41 (4): 747-771, 2012
    
24. Rumor spreading and vertex expansion
    George Giakkoupis and Thomas Sauerwald
    In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 1623-1641
    
23. Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
    Thomas Sauerwald and He Sun
    In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), New Brunswick, USA, 2012, 341-350
    
22. Ultra-fast rumor spreading in social networks
    Nikolaos Fountoulakis, Konstantinos Panagiotou, and Thomas Sauerwald
    In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 1642-1660
    
21. Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
    Tobias Friedrich, Thomas Sauerwald, and Alexandre Stauffer
    In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), Yokohama, Japan, 2011, 190-199
    
20. Distributed Selfish Load Balancing on Networks
    Petra Berenbrink, Martin Hoefer, and Thomas Sauerwald
    In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), San Francisco, CA, 2011, 1487-1497
    
19. Faster Coupon Collecting via Replication with Applications in Gossiping
    Petra Berenbrink, Tom Friedetzky, Robert Elsaesser, Lars Nagel, and Thomas Sauerwald
    In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), Warsaw, Poland, 2011, 72-83
    
18. Quasirandom Rumor Spreading: An Experimental Analysis
    Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, and Thomas Sauerwald
    ACM Journal of Experimental Algorithmics 16: Article No. 3.3 p., 2011
    
17. Randomized Diffusion for Indivisible Loads
    Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, and Thomas Sauerwald
    In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), San Francisco, CA, 2011, 429-439
    
16. Rumor Spreading and Vertex Expansion on Regular Graphs
    Thomas Sauerwald and Alexandre Stauffer
    In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), San Francisco, CA, 2011, 462-475
    
15. Smoothed analysis of balancing networks
    Tobias Friedrich, Thomas Sauerwald, and Dan Vilenchik
    Random Structures & Algorithms 39 (1): 115-138, 2011
    
14. Stabilizing consensus with the power of two choices
    Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler
    In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), San Jose, USA, 2011, 149-158
    
13. Tight bounds for the cover time of multiple random walks
    Robert Elsaesser and Thomas Sauerwald
    Theoretical Computer Science 412 (24): 2623-2641, 2011
    
12. Brief Announcement: Stabilizing Consensus with the Power of Two Choices
    Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler
    In: Distributed Computing : 24th International Symposium, DISC 2010, Cambridge, MA USA, 2010, 528-530
    
11. Efficient Broadcast on Random Geometric Graphs
    Milan Bradonjić, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, and Alexandre Stauffer
    In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, 2010, 1412-1421
    
10. Quasirandom Load Balancing
    Tobias Friedrich, Martin Gairing, and Thomas Sauerwald
    In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, 2010, 1620-1629
    
9. Smoothed Analysis of Balancing Networks
   Tobias Friedrich, Thomas Sauerwald, and Dan Vilenchik
   Random Structures and Algorithms Early View: 1-24, 2010
   
8. The Cover Time of Deterministic Random Walks
   Tobias Friedrich and Thomas Sauerwald
   In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, 2010, 130-139
   
7. The Cover Time of Deterministic Random Walks
   Tobias Friedrich and Thomas Sauerwald
   The Electronic Journal of Combinatorics 17 (1): R167,1-R167,30, 2010
   
6. Quasirandom Rumor Spreading
   Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
   In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, USA, 2008, 773-781
   
5. Near-Perfect Load Balancing by Randomized Rounding
   Tobias Friedrich and Thomas Sauerwald
   In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, Bethesda, Maryland, USA, 2009, 121-130
   
4. Quasirandom Rumor Spreading on Expanders
   Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
   Electronic Notes in Discrete Mathematics 34: 243 - 247, 2009
   
3. Quasirandom Rumor Spreading: An Experimental Analysis
   Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, and Thomas Sauerwald
   In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), New York, USA, 2009, 145-153
   
2. Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
   Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
   In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 366-377
   
1. Smoothed Analysis of Balancing Networks
   Tobias Friedrich, Thomas Sauerwald, and Dan Vilenchik
   In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 472-483