P. Berenbrink

Most-cited papers

1. Not All Scale-Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Evolution

   F. Hormozdiari, P. Berenbrink, Natasa Przulj, S. Sahinalp

   2006PLoS Comput. Biol.144 citations Open access

   Semantic Scholar

   Save

2. 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

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. Optimal time and space leader election in population protocols

   P. Berenbrink, George Giakkoupis, Peter Kling

   2020Symposium on the Theory of Computing64 citations

   Semantic Scholar

   Save

5. 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

6. 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

7. Bounds on the Voter Model in Dynamic Networks

   P. Berenbrink, George Giakkoupis, A. Kermarrec, Frederik Mallmann-Trenn

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

   Semantic Scholar

   Save

8. Ignore or Comply?: On Breaking Symmetry in Consensus

   P. Berenbrink, A. Clementi, R. Elsässer, Peter Kling +2 more

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

   Semantic Scholar

   Save

9. 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

10. Simple and Efficient Leader Election

    P. Berenbrink, D. Kaaser, Peter Kling, Lena Otterbach

    2018SIAM Symposium on Simplicity in Algorithms42 citations

    Semantic Scholar

    Save

11. 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

12. Balls-into-bins with nearly optimal load distribution

    P. Berenbrink, Kamyar Khodamoradi, Thomas Sauerwald, Alexandre O. Stauffer

    2013ACM Symposium on Parallelism in Algorithms and Architectures38 citations Open access

    Semantic Scholar

    Save

13. 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

14. The Weighted Coupon Collector's Problem and Applications

    P. Berenbrink, Thomas Sauerwald

    2009International Computing and Combinatorics Conference37 citations

    Semantic Scholar

    Save

15. Speeding up random walks with neighborhood exploration

    P. Berenbrink, C. Cooper, R. Elsässer, T. Radzik +1 more

    2010ACM-SIAM Symposium on Discrete Algorithms34 citations

    Semantic Scholar

    Save

16. 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

17. Concurrent imitation dynamics in congestion games

    Heiner Ackermann, P. Berenbrink, Simon Fischer, M. Hoefer

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

    Semantic Scholar

    Save

18. Energy efficient randomised communication in unknown AdHoc networks

    P. Berenbrink, Zengjian Hu, C. Cooper

    2006ACM Symposium on Parallelism in Algorithms and Architectures30 citations Open access

    Semantic Scholar

    Save

19. 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

20. Distributed selfish load balancing on networks

    P. Berenbrink, M. Hoefer, Thomas Sauerwald

    2011ACM-SIAM Symposium on Discrete Algorithms27 citations

    Semantic Scholar

    Save

21. 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

22. Parallel rotor walks on finite graphs and applications in discrete load balancing

    Hoda Akbari, P. Berenbrink

    2013ACM Symposium on Parallelism in Algorithms and Architectures24 citations

    Semantic Scholar

    Save

23. 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

24. Estimating the number of connected components in sublinear time

    P. Berenbrink, B. Krayenhoff, Frederik Mallmann-Trenn

    2014Information Processing Letters23 citations

    Semantic Scholar

    Save

25. On Counting the Population Size

    P. Berenbrink, D. Kaaser, T. Radzik

    2019ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing22 citations Open access

    Semantic Scholar

    Save

26. 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

27. Distributed selfish load balancing with weights and speeds

    C. Adolphs, P. Berenbrink

    2011ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing22 citations Open access

    Semantic Scholar

    Save

28. Efficient Information Exchange in the Random Phone-Call Model

    P. Berenbrink, J. Czyzowicz, R. Elsässer, L. Gąsieniec

    2010International Colloquium on Automata, Languages and Programming22 citations

    Semantic Scholar

    Save

29. Asynchronous opinion dynamics in social networks

    P. Berenbrink, M. Hoefer, D. Kaaser, Pascal Lenzner +2 more

    2022Distributed computing21 citations Open access

    Semantic Scholar

    Save

30. Utilitarian resource assignment

    P. Berenbrink, L. Goldberg, P. Goldberg, Russell Martin

    2004J. Discrete Algorithms19 citations Open access

    Semantic Scholar

    Save

31. 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

32. Improved Analysis of Deterministic Load-Balancing Schemes

    P. Berenbrink, R. Klasing, A. Kosowski, Frederik Mallmann-Trenn +1 more

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

    Semantic Scholar

    Save

33. 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

34. A simple approach for adapting continuous load balancing processes to discrete settings

    Hoda Akbari, P. Berenbrink, Thomas Sauerwald

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

    Semantic Scholar

    Save

35. 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

36. Fast Consensus via the Unconstrained Undecided State Dynamics

    Gregor Bankhamer, P. Berenbrink, F. Biermeier, R. Elsässer +3 more

    2021ACM-SIAM Symposium on Discrete Algorithms15 citations Open access

    Semantic Scholar

    Save

37. Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs

    P. Berenbrink, George Giakkoupis, Peter Kling

    2018ACM-SIAM Symposium on Discrete Algorithms15 citations Open access

    Semantic Scholar

    Save

38. Communication Complexity of Quasirandom Rumor Spreading

    P. Berenbrink, R. Elsässer, Thomas Sauerwald

    2010Algorithmica15 citations

    Semantic Scholar

    Save

39. 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

40. 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

41. On the Stability of Dynamic Diffusion Load Balancing

    P. Berenbrink, T. Friedetzky, Russell Martin

    2005Algorithmica13 citations Open access

    Semantic Scholar

    Save

42. Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model

    Talley Amir, J. Aspnes, P. Berenbrink, F. Biermeier +3 more

    2023ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing12 citations Open access

    Semantic Scholar

    Save

43. Simulating Population Protocols in Sub-Constant Time per Interaction

    P. Berenbrink, David Hammer, D. Kaaser, U. Meyer +2 more

    2020Embedded Systems and Applications12 citations

    Semantic Scholar

    Save

44. Majority & Stabilization in Population Protocols

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

    2018arXiv.org11 citations

    Semantic Scholar

    Save

45. 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

46. Palindrome Recognition In The Streaming Model

    P. Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer

    2013Symposium on Theoretical Aspects of Computer Science11 citations

    Semantic Scholar

    Save

47. Improved Bounds for Discrete Diffusive Load Balancing

    C. Adolphs, P. Berenbrink

    2012IEEE International Parallel and Distributed Processing Symposium10 citations

    Semantic Scholar

    Save

48. A sublinear-time approximation scheme for bin packing

    Tuğkan Batu, P. Berenbrink, C. Sohler

    2009Theoretical Computer Science10 citations Open access

    Semantic Scholar

    Save

49. Inference of a Rumor's Source in the Independent Cascade Model

    P. Berenbrink, Max Hahn-Klimroth, Dominik Kaaser, Lena Krieg +1 more

    2022Conference on Uncertainty in Artificial Intelligence9 citations Open access

    Semantic Scholar

    Save

50. Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions

    Gregor Bankhamer, P. Berenbrink, F. Biermeier, R. Elsässer +3 more

    2022ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing9 citations

    Semantic Scholar

    Save