T. Friedetzky

Most-cited papers

1. Distributed selfish load balancing

   P. Berenbrink, T. Friedetzky, L. Goldberg, P. Goldberg +2 more

   2005ACM-SIAM Symposium on Discrete Algorithms122 citations Open access

   Semantic Scholar

   Save

2. The natural work-stealing algorithm is stable

   P. Berenbrink, T. Friedetzky, L. Goldberg

   2001Proceedings IEEE International Conference on Cluster Computing94 citations Open access

   Semantic Scholar

   Save

3. On weighted balls-into-bins games

   P. Berenbrink, T. Friedetzky, Zengjian Hu, Russell Martin

   2005Theoretical Computer Science67 citations Open access

   Semantic Scholar

   Save

4. The degree distribution of the generalized duplication model

   G. Bebek, P. Berenbrink, C. Cooper, T. Friedetzky +2 more

   2006Theoretical Computer Science64 citations Open access

   Semantic Scholar

   Save

5. Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems

   P. Berenbrink, R. Elsässer, T. Friedetzky

   2008ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing52 citations Open access

   Semantic Scholar

   Save

6. A new analytical method for parallel, diffusion-type load balancing

   P. Berenbrink, T. Friedetzky, Zengjian Hu

   2006Proceedings 20th IEEE International Parallel & Distributed Processing Symposium47 citations Open access

   Semantic Scholar

   Save

7. Time-space trade-offs in population protocols for the majority problem

   P. Berenbrink, R. Elsässer, T. Friedetzky, D. Kaaser +2 more

   2020Distributed computing40 citations Open access

   Semantic Scholar

   Save

8. A Population Protocol for Exact Majority with O (log 5 / 3 n ) Stabilization Time and Θ(log n ) States

   P. Berenbrink, R. Elsässer, T. Friedetzky, D. Kaaser +2 more

   201840 citations

   Semantic Scholar

   Save

9. Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time

   P. Berenbrink, T. Friedetzky, George Giakkoupis, Peter Kling

   2016International Colloquium on Automata, Languages and Programming37 citations Open access

   Semantic Scholar

   Save

10. Randomized diffusion for indivisible loads

    P. Berenbrink, C. Cooper, T. Friedetzky, T. Friedrich +1 more

    2011ACM-SIAM Symposium on Discrete Algorithms32 citations Open access

    Semantic Scholar

    Save

11. Multiple-Choice Balanced Allocation in (Almost) Parallel

    P. Berenbrink, A. Czumaj, Matthias Englert, T. Friedetzky +1 more

    2012International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques29 citations Open access

    Semantic Scholar

    Save

12. Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks

    P. Berenbrink, T. Friedetzky, I. Hajirasouliha, Zengjian Hu

    2007Algorithmica26 citations Open access

    Semantic Scholar

    Save

13. A proportionate fair scheduling rule with good worst-case performance

    M. Adler, P. Berenbrink, T. Friedetzky, L. Goldberg +2 more

    2003ACM Symposium on Parallelism in Algorithms and Architectures25 citations Open access

    Semantic Scholar

    Save

14. Balls into non-uniform bins

    P. Berenbrink, A. Brinkmann, T. Friedetzky, Lars Nagel

    2010IEEE International Parallel and Distributed Processing Symposium24 citations Open access

    Semantic Scholar

    Save

15. A population protocol for exact majority with O(\log5/3n) stabilization time and asymptotically optimal number of states

    P. Berenbrink, R. Elsässer, T. Friedetzky, D. Kaaser +2 more

    2018International Symposium on Distributed Computing22 citations

    Semantic Scholar

    Save

16. Brief Announcement: Rapid Asynchronous Plurality Consensus

    R. Elsässer, T. Friedetzky, D. Kaaser, Frederik Mallmann-Trenn +1 more

    2017ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing21 citations Open access

    Semantic Scholar

    Save

17. Tight & Simple Load Balancing

    P. Berenbrink, T. Friedetzky, D. Kaaser, Peter Kling

    2019IEEE International Parallel and Distributed Processing Symposium18 citations Open access

    Semantic Scholar

    Save

18. Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time

    P. Berenbrink, C. Cooper, T. Friedetzky

    2012ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing18 citations Open access

    Semantic Scholar

    Save

19. Balls into bins with related random choices

    P. Berenbrink, A. Brinkmann, T. Friedetzky, Lars Nagel

    2010ACM Symposium on Parallelism in Algorithms and Architectures16 citations Open access

    Semantic Scholar

    Save

20. Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems

    Alberto Miranda, Sascha Effert, Yangwook Kang, E. L. Miller +4 more

    2014TOS15 citations Open access

    Semantic Scholar

    Save

21. Improved Duplication Models for Proteome Network Evolution

    G. Bebek, P. Berenbrink, C. Cooper, T. Friedetzky +2 more

    2005Systems Biology and Regulatory Genomics15 citations Open access

    Semantic Scholar

    Save

22. Infinite parallel job allocation (extended abstract)

    P. Berenbrink, A. Czumaj, T. Friedetzky, N. Vvedenskaya

    2000ACM Symposium on Parallelism in Algorithms and Architectures14 citations Open access

    Semantic Scholar

    Save

23. Efficient k-Party Voting with Two Choices

    R. Elsässer, T. Friedetzky, D. Kaaser, Frederik Mallmann-Trenn +1 more

    2016arXiv.org13 citations

    Semantic Scholar

    Save

24. Plurality Consensus via Shuffling: Lessons Learned from Load Balancing

    P. Berenbrink, T. Friedetzky, Peter Kling, Frederik Mallmann-Trenn +1 more

    2016arXiv.org13 citations

    Semantic Scholar

    Save

25. On the Stability of Dynamic Diffusion Load Balancing

    P. Berenbrink, T. Friedetzky, Russell Martin

    2005Algorithmica13 citations Open access

    Semantic Scholar

    Save

26. Rapid Asynchronous Plurality Consensus

    R. Elsässer, T. Friedetzky, D. Kaaser, Frederik Mallmann-Trenn +1 more

    201612 citations

    Semantic Scholar

    Save

27. Majority & Stabilization in Population Protocols

    P. Berenbrink, R. Elsässer, T. Friedetzky, D. Kaaser +2 more

    2018arXiv.org11 citations

    Semantic Scholar

    Save

28. Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]

    P. Berenbrink, T. Friedetzky, Peter Kling, Frederik Mallmann-Trenn +2 more

    2016ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing11 citations Open access

    Semantic Scholar

    Save

29. Randomized and adversarial load balancing

    P. Berenbrink, T. Friedetzky, A. Steger

    1999ACM Symposium on Parallelism in Algorithms and Architectures10 citations Open access

    Semantic Scholar

    Save

30. Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing

    P. Berenbrink, T. Friedetzky, Peter Kling, Frederik Mallmann-Trenn +1 more

    2016Embedded Systems and Applications9 citations

    Semantic Scholar

    Save

31. Observe and Remain Silent (Communication-Less Agent Location Discovery)

    T. Friedetzky, L. Gąsieniec, Thomas Gorry, Russell Martin

    2012International Symposium on Mathematical Foundations of Computer Science7 citations

    Semantic Scholar

    Save

32. Threshold Load Balancing with Weighted Tasks

    P. Berenbrink, T. Friedetzky, Frederik Mallmann-Trenn, Sepehr Meshkinfamfard +1 more

    2015IEEE International Parallel and Distributed Processing Symposium6 citations Open access

    Semantic Scholar

    Save

33. Parallel continuous randomized load balancing (extended abstract)

    P. Berenbrink, T. Friedetzky, E. Mayr

    1998ACM Symposium on Parallelism in Algorithms and Architectures6 citations Open access

    Semantic Scholar

    Save

34. Self-stabilizing Balls & Bins in Batches The Power of Leaky Bins

    P. Berenbrink, T. Friedetzky, Peter Kling, Frederik Mallmann-Trenn +2 more

    20185 citations

    Semantic Scholar

    Save

35. Distributing Storage in Cloud Environments

    P. Berenbrink, A. Brinkmann, T. Friedetzky, Dirk Meister +1 more

    2013IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum5 citations

    Semantic Scholar

    Save

36. Efficient Randomised Broadcasting in Random Regular Networks with Applications in Peer-to-Peer Systems ∗

    P. Berenbrink, Robert Els ̈asser, T. Friedetzky

    5 citations

    Semantic Scholar

    Save

37. A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols

    Henry Austin, P. Berenbrink, T. Friedetzky, Thorsten Götte +1 more

    2025ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing4 citations Open access

    Semantic Scholar

    Save

38. Payment Scheduling in the Interval Debt Model

    T. Friedetzky, David C. Kutner, G. Mertzios, I. A. Stewart +1 more

    2024Conference on Current Trends in Theory and Practice of Informatics4 citations Open access

    Semantic Scholar

    Save

39. Self-Stabilizing Balls and Bins in Batches

    P. Berenbrink, T. Friedetzky, Peter Kling, Frederik Mallmann-Trenn +2 more

    2018Algorithmica4 citations Open access

    Semantic Scholar

    Save

40. Randomized Renaming in Shared Memory Systems

    P. Berenbrink, A. Brinkmann, R. Elsässer, T. Friedetzky +1 more

    2015IEEE International Parallel and Distributed Processing Symposium3 citations Open access

    Semantic Scholar

    Save

41. Finding Frequent Patterns in a String in Sublinear Time

    P. Berenbrink, Funda Ergün, T. Friedetzky

    2005Embedded Systems and Applications3 citations Open access

    Semantic Scholar

    Save

42. On the Influence of PRNGs on Data Distribution

    I. Popov, A. Brinkmann, T. Friedetzky

    20122012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing2 citations

    Semantic Scholar

    Save

43. Faster Coupon Collecting via Replication with Applications in Gossiping

    P. Berenbrink, R. Elsässer, T. Friedetzky, Lars Nagel +1 more

    2011International Symposium on Mathematical Foundations of Computer Science2 citations

    Semantic Scholar

    Save

44. Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers

    H. Broersma, T. Erlebach, T. Friedetzky, D. Paulusma

    2008International Workshop on Graph-Theoretic Concepts in Computer Science2 citations

    Semantic Scholar

    Save

45. (Almost) Perfect Discrete Iterative Load Balancing

    P. Berenbrink, R. Elsässer, T. Friedetzky, Hamed Hosseinpour +3 more

    2025ACM-SIAM Symposium on Discrete Algorithms1 citations

    Semantic Scholar

    Save

46. Infinite Balanced Allocation via Finite Capacities

    P. Berenbrink, T. Friedetzky, Christopher Hahn, L. Hintze +3 more

    2021IEEE International Conference on Distributed Computing Systems1 citations Open access

    Semantic Scholar

    Save

47. Simple Load Balancing

    P. Berenbrink, T. Friedetzky, D. Kaaser, Peter Kling

    2018arXiv.org1 citations

    Semantic Scholar

    Save

48. Speeding up random walks by choosing unvisited edges or vertices ?

    P. Berenbrink, C. Cooper, T. Friedetzky

    20121 citations

    Semantic Scholar

    Save

49. Statistical Identification of Uniformly Mutated Segments within Repeats

    S. Sahinalp, E. Eichler, P. Goldberg, P. Berenbrink +2 more

    2002Annual Symposium on Combinatorial Pattern Matching1 citations Open access

    Semantic Scholar

    Save

50. Counting in Population Protocols on Graphs

    P. Berenbrink, R. Elsässer, T. Friedetzky, Thorsten Götte +2 more

    20260 citations

    Semantic Scholar

    Save