Fault-Tolerant Shared Memory Simulations. - Petra Berenbrink; Friedhelm Meyer auf der Heide; Volker Stemann (STACS, 1996)

Online Scheduling of Continuous Media Streams. - Burkhard Monien; Petra Berenbrink; Reinhard Lüling; Marco Riedel (Foundations of Computer Science: Potential - Theory - Cognition, 1997)

Allocating Weighted Jobs in Parallel. - Petra Berenbrink; Friedhelm Meyer auf der Heide; Klaus Schröder (SPAA, 1997)

A Simple Distributed Scheduling Policy for Parallel Interactive Continuous Media Servers. - Valentin Rottmann; Petra Berenbrink; Reinhard Lüling (Parallel Comput., 1997)

Analyzing an Infinite Parallel Job Allocation Process. - Micah Adler; Petra Berenbrink; Klaus Schröder (ESA, 1998)

Parallel Continuous Randomized Load Balancing (Extended Abstract). - Petra Berenbrink; Tom Friedetzky; Ernst W. Mayr (SPAA, 1998)

Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. - Petra Berenbrink; Christian Scheideler (SODA, 1999)

Randomized and Adversarial Load Balancing. - Petra Berenbrink; Tom Friedetzky; Angelika Steger (SPAA, 1999)

Simple Competitive Request Scheduling Strategies. - Petra Berenbrink; Marco Riedel; Christian Scheideler (SPAA, 1999)

Distributed Path Selection for Storage Networks. - Petra Berenbrink; André Brinkmann; Christian Scheideler (PDPTA, 2000)

Infinite parallel job allocation (extended abstract). - Petra Berenbrink; Artur Czumaj; Tom Friedetzky; Nikita D. Vvedenskaya (SPAA, 2000)

Balanced allocations: the heavily loaded case. - Petra Berenbrink; Artur Czumaj; Angelika Steger; Berthold Vöcking (STOC, 2000)

Randomized allocation of independent tasks. - Petra Berenbrink (Logos-Verlag, 2000)

Simple Routing Strategies for Adversarial Systems. - Baruch Awerbuch; Petra Berenbrink; André Brinkmann; Christian Scheideler (FOCS, 2001)

The Natural Work-Stealing Algorithm is Stable. - Petra Berenbrink; Tom Friedetzky; Leslie Ann Goldberg (FOCS, 2001)

SIMLAB-A Simulation Environment for Storage Area Networks. - Petra Berenbrink; André Brinkmann; Christian Scheideler (PDP, 2001)

Statistical Identification of Uniformly Mutated Segments within Repeats. - Süleyman Cenk Sahinalp; Evan E. Eichler; Paul W. Goldberg; Petra Berenbrink; Tom Friedetzky; Funda Ergün (CPM, 2002)

A proportionate fair scheduling rule with good worst-case performance. - Micah Adler; Petra Berenbrink; Tom Friedetzky; Leslie Ann Goldberg; Paul W. Goldberg; Mike Paterson (SPAA, 2003)

Identifying Uniformly Mutated Segments within Repeats. - Süleyman Cenk Sahinalp; Evan E. Eichler; Paul W. Goldberg; Petra Berenbrink; Tom Friedetzky; Funda Ergün (J. Bioinform. Comput. Biol., 2004)

Finding Frequent Patterns in a String in Sublinear Time. - Petra Berenbrink; Funda Ergün; Tom Friedetzky (ESA, 2005)

Dynamic Diffusion Load Balancing. - Petra Berenbrink; Tom Friedetzky; Russell A. Martin (ICALP, 2005)

Improved Duplication Models for Proteome Network Evolution. - Gürkan Bebek; Petra Berenbrink; Colin Cooper; Tom Friedetzky; Joseph H. Nadeau; Süleyman Cenk Sahinalp (Systems Biology and Regulatory Genomics, 2005)

On Weighted Balls-into-Bins Games. - Petra Berenbrink; Tom Friedetzky; Zengjian Hu; Russell A. Martin (STACS, 2005)

(quasi) Spanners for Mobile Ad Hoc Networks. - Petra Berenbrink; Tom Friedetzky; Ján Manuch; Ladislav Stacho (J. Interconnect. Networks, 2005)

A new analytical method for parallel, diffusion-type load balancing. - Petra Berenbrink; Tom Friedetzky; Zengjian Hu (IPDPS, 2006)

Not All Scale Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Emulation. - Fereydoun Hormozdiari; Petra Berenbrink; Natasa Przulj; Süleyman Cenk Sahinalp (Systems Biology and Computational Proteomics, 2006)

Distributed selfish load balancing. - Petra Berenbrink; Tom Friedetzky; Leslie Ann Goldberg; Paul W. Goldberg; Zengjian Hu; Russell A. Martin (SODA, 2006)

Energy Efficient Randomized Communication in Unknown AdHoc Networks - Petra Berenbrink; Colin Cooper; Zengjian Hu (CoRR, 2006)

Utilitarian resource assignment. - Petra Berenbrink; Leslie Ann Goldberg; Paul W. Goldberg; Russell A. Martin (J. Discrete Algorithms, 2006)

The degree distribution of the generalized duplication model. - Gürkan Bebek; Petra Berenbrink; Colin Cooper; Tom Friedetzky; Joseph H. Nadeau; Süleyman Cenk Sahinalp (Theor. Comput. Sci., 2006)

Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks. - Petra Berenbrink; Tom Friedetzky; Iman Hajirasouliha; Zengjian Hu (ESA, 2007)

Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation. - Petra Berenbrink; Oliver Schulte (ESA, 2007)

Energy efficient randomised communication in unknown AdHoc networks. - Petra Berenbrink; Colin Cooper; Zengjian Hu (SPAA, 2007)

Not All Scale-Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Evolution. - Fereydoun Hormozdiari; Petra Berenbrink; Natasa Przulj; Süleyman Cenk Sahinalp (PLoS Comput. Biol., 2007)

Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky (PODC, 2008)

On the Stability of Dynamic Diffusion Load Balancing. - Petra Berenbrink; Tom Friedetzky; Russell A. Martin (Algorithmica, 2008)

The Weighted Coupon Collector's Problem and Applications. - Petra Berenbrink; Thomas Sauerwald (COCOON, 2009)

Concurrent imitation dynamics in congestion games. - Heiner Ackermann; Petra Berenbrink; Simon Fischer 001; Martin Hoefer 001 (PODC, 2009)

A sublinear-time approximation scheme for bin packing. - Tugkan Batu; Petra Berenbrink; Christian Sohler (Theor. Comput. Sci., 2009)

Communication Complexity of Quasirandom Rumor Spreading. - Petra Berenbrink; Robert Elsässer; Thomas Sauerwald (ESA (1), 2010)

Efficient Information Exchange in the Random Phone-Call Model. - Petra Berenbrink; Jurek Czyzowicz; Robert Elsässer; Leszek Gasieniec (ICALP (2), 2010)

Balls into non-uniform bins. - Petra Berenbrink; André Brinkmann; Tom Friedetzky; Lars Nagel 001 (IPDPS, 2010)

Chains-into-Bins Processes. - Tugkan Batu; Petra Berenbrink; Colin Cooper (IWOCA, 2010)

Randomised Broadcasting: Memory vs. Randomness. - Petra Berenbrink; Robert Elsässer; Thomas Sauerwald (LATIN, 2010)

Speeding Up Random Walks with Neighborhood Exploration. - Petra Berenbrink; Colin Cooper; Robert Elsässer; Tomasz Radzik; Thomas Sauerwald (SODA, 2010)

Balls into bins with related random choices. - Petra Berenbrink; André Brinkmann; Tom Friedetzky; Lars Nagel 001 (SPAA, 2010)

Faster Coupon Collecting via Replication with Applications in Gossiping. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Lars Nagel 001; Thomas Sauerwald (MFCS, 2011)

Randomized Diffusion for Indivisible Loads. - Petra Berenbrink; Colin Cooper; Tom Friedetzky; Tobias Friedrich 001; Thomas Sauerwald (SODA, 2011)

Distributed Selfish Load Balancing on Networks. - Petra Berenbrink; Martin Hoefer 001; Thomas Sauerwald (SODA, 2011)

Multiple-Choice Balanced Allocation in (Almost) Parallel. - Petra Berenbrink; Artur Czumaj; Matthias Englert; Tom Friedetzky; Lars Nagel 001 (APPROX-RANDOM, 2012)

Improved Bounds for Discrete Diffusive Load Balancing. - Clemens P. J. Adolphs; Petra Berenbrink (IPDPS, 2012)

Distributed selfish load balancing with weights and speeds. - Clemens P. J. Adolphs; Petra Berenbrink (PODC, 2012)

A simple approach for adapting continuous load balancing processes to discrete settings. - Hoda Akbari; Petra Berenbrink; Thomas Sauerwald (PODC, 2012)

Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time. - Petra Berenbrink; Colin Cooper; Tom Friedetzky (PODC, 2012)

Distributing Storage in Cloud Environments. - Petra Berenbrink; André Brinkmann; Tom Friedetzky; Dirk Meister; Lars Nagel 001 (IPDPS Workshops, 2013)

Parallel rotor walks on finite graphs and applications in discrete load balancing. - Hoda Akbari; Petra Berenbrink (SPAA, 2013)

Balls-into-bins with nearly optimal load distribution. - Petra Berenbrink; Kamyar Khodamoradi; Thomas Sauerwald; Alexandre Stauffer (SPAA, 2013)

Palindrome Recognition In The Streaming Model. - Petra Berenbrink; Funda Ergün; Frederik Mallmann-Trenn; Erfan Sadeqi Azer (STACS, 2014)

Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy. - Petra Berenbrink; Ralf Klasing; Adrian Kosowski; Frederik Mallmann-Trenn; Przemyslaw Uznanski (CoRR, 2014)

Estimating the number of connected components in sublinear time. - Petra Berenbrink; Bruce Krayenhoff; Frederik Mallmann-Trenn (Inf. Process. Lett., 2014)

Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion. - Hoda Akbari; Petra Berenbrink; Robert Elsässer; Dominik Kaaser (ICDCS, 2015)

Randomized Renaming in Shared Memory Systems. - Petra Berenbrink; André Brinkmann; Robert Elsässer; Tom Friedetzky; Lars Nagel 001 (IPDPS, 2015)

Threshold Load Balancing with Weighted Tasks. - Petra Berenbrink; Tom Friedetzky; Frederik Mallmann-Trenn; Sepehr Meshkinfamfard; Chris Wastell (IPDPS, 2015)

Improved Analysis of Deterministic Load-Balancing Schemes. - Petra Berenbrink; Ralf Klasing; Adrian Kosowski; Frederik Mallmann-Trenn; Przemyslaw Uznanski (PODC, 2015)

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing. - Petra Berenbrink; Tom Friedetzky; Peter Kling; Frederik Mallmann-Trenn; Chris Wastell (ESA, 2016)

Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. - Petra Berenbrink; Tom Friedetzky; George Giakkoupis; Peter Kling (ICALP, 2016)

Bounds on the Voter Model in Dynamic Networks. - Petra Berenbrink; George Giakkoupis; Anne-Marie Kermarrec; Frederik Mallmann-Trenn (ICALP, 2016)

Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]. - Petra Berenbrink; Tom Friedetzky; Peter Kling; Frederik Mallmann-Trenn; Lars Nagel 001; Christopher Wastell (PODC, 2016)

Self-stabilizing Balls & Bins in Batches. - Petra Berenbrink; Tom Friedetzky; Peter Kling; Frederik Mallmann-Trenn; Lars Nagel 001; Chris Wastell (CoRR, 2016)

Plurality Consensus via Shuffling: Lessons Learned from Load Balancing. - Petra Berenbrink; Tom Friedetzky; Peter Kling; Frederik Mallmann-Trenn; Chris Wastell (CoRR, 2016)

Tight Load Balancing Via Randomized Local Search. - Petra Berenbrink; Peter Kling; Christopher Liaw; Abbas Mehrabian (IPDPS, 2017)

Ignore or Comply?: On Breaking Symmetry in Consensus. - Petra Berenbrink; Andrea Clementi; Robert Elsässer; Peter Kling; Frederik Mallmann-Trenn; Emanuele Natale (PODC, 2017)

Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. - Petra Berenbrink; George Giakkoupis; Peter Kling (SODA, 2018)

Simple and Efficient Leader Election. - Petra Berenbrink; Dominik Kaaser; Peter Kling; Lena Otterbach (SOSA, 2018)

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Peter Kling; Tomasz Radzik (DISC, 2018)

Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins. - Petra Berenbrink; Tom Friedetzky; Peter Kling; Frederik Mallmann-Trenn; Lars Nagel 001; Chris Wastell (Algorithmica, 2018)

Majority & Stabilization in Population Protocols. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Peter Kling; Tomasz Radzik (CoRR, 2018)

A population protocol for exact majority with O( log5/3n) stabilization time and asymptotically optimal number of states. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Peter Kling; Tomasz Radzik (CoRR, 2018)

Simple Load Balancing. - Petra Berenbrink; Tom Friedetzky; Dominik Kaaser; Peter Kling (CoRR, 2018)

Tight & Simple Load Balancing. - Petra Berenbrink; Tom Friedetzky; Dominik Kaaser; Peter Kling (IPDPS, 2019)

On Counting the Population Size. - Petra Berenbrink; Dominik Kaaser; Tomasz Radzik (PODC, 2019)

Simulating Population Protocols in Sub-Constant Time per Interaction. - Petra Berenbrink; David Hammer; Dominik Kaaser; Ulrich Meyer 001; Manuel Penschuck; Hung Tran (ESA, 2020)

Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. - Petra Berenbrink; George Giakkoupis; Peter Kling (PODC, 2020)

Optimal time and space leader election in population protocols. - Petra Berenbrink; George Giakkoupis; Peter Kling (STOC, 2020)

Infinite Balanced Allocation via Finite Capacities. - Petra Berenbrink; Tom Friedetzky; Christopher Hahn; Lukas Hintze; Dominik Kaaser; Peter Kling; Lars Nagel 001 (ICDCS, 2021)

Self-Stabilizing Phase Clocks and the Adaptive Majority Problem. - Petra Berenbrink; Felix Biermeier; Christopher Hahn; Dominik Kaaser (CoRR, 2021)

Time-space trade-offs in population protocols for the majority problem. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Peter Kling; Tomasz Radzik (Distributed Comput., 2021)

Introduction to the Special Issue for SPAA 2019. - Petra Berenbrink (ACM Trans. Parallel Comput., 2021)

Asynchronous Opinion Dynamics in Social Networks. - Petra Berenbrink; Martin Hoefer 001; Dominik Kaaser; Pascal Lenzner; Malin Rau; Daniel Schmand (AAMAS, 2022)

On the Optimality of the Greedy Garbage Collection Strategy for SSDs. - Ernst Althaus; Petra Berenbrink; André Brinkmann; Rebecca Steiner (ICDCS, 2022)

On the Hierarchy of Distributed Majority Protocols. - Petra Berenbrink; Amin Coja-Oghlan; Oliver Gebhard; Max Hahn-Klimroth; Dominik Kaaser; Malin Rau (OPODIS, 2022)

Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. - Gregor Bankhamer; Petra Berenbrink; Felix Biermeier; Robert Elsässer; Hamed Hosseinpour; Dominik Kaaser; Peter Kling (PODC, 2022)

Loosely-Stabilizing Phase Clocks and The Adaptive Majority Problem. - Petra Berenbrink; Felix Biermeier; Christopher Hahn; Dominik Kaaser (SAND, 2022)

Fast Consensus via the Unconstrained Undecided State Dynamics. - Gregor Bankhamer; Petra Berenbrink; Felix Biermeier; Robert Elsässer; Hamed Hosseinpour; Dominik Kaaser; Peter Kling (SODA, 2022)

On early extinction and the effect of travelling in the SIR model. - Petra Berenbrink; Colin Cooper; Cristina Gava; David Kohan Marzagão; Frederik Mallmann-Trenn; Tomasz Radzik (UAI, 2022)

Distributed Averaging in Population Protocols. - Petra Berenbrink; Colin Cooper; Cristina Gava; David Kohan Marzagão; Frederik Mallmann-Trenn; Nicolás Rivera; Tomasz Radzik (CoRR, 2022)

Dynamic Averaging Load Balancing on Arbitrary Graphs. - Petra Berenbrink; Lukas Hintze; Hamed Hosseinpour; Dominik Kaaser; Malin Rau (ICALP, 2023)

Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model. - Talley Amir; James Aspnes; Petra Berenbrink; Felix Biermeier; Christopher Hahn; Dominik Kaaser; John Lazarsfeld (PODC, 2023)

Distributed Averaging in Opinion Dynamics. - Petra Berenbrink; Colin Cooper; Cristina Gava; David Kohan Marzagão; Frederik Mallmann-Trenn; Tomasz Radzik; Nicolas Rivera (PODC, 2023)

Inference of a rumor's source in the independent cascade model. - Petra Berenbrink; Max Hahn-Klimroth; Dominik Kaaser; Lena Krieg; Malin Rau (UAI, 2023)

Undecided State Dynamics with Stubborn Agents. - Petra Berenbrink; Felix Biermeier; Christopher Hahn (CoRR, 2024)

WalkSAT is linear on random 2-SAT. - Petra Berenbrink; Amin Coja-Oghlan; Colin Cooper; Thorsten Götte; Lukas Hintze; Pavel Zakharov (CoRR, 2024)

Silent Self-Stabilizing Ranking: Time Optimal and Space Efficient. - Petra Berenbrink; Robert Elsässer; Thorsten Götte; Lukas Hintze; Dominik Kaaser (ICDCS, 2025)

Shared memory consensus on a ring: Epigenetic Consensus. - Petra Berenbrink; Funda Ergün; Anna Geisler; Yannic Maus (ICDCS, 2025)

Opinion Dynamics with Median Aggregation. - Petra Berenbrink; Martin Hoefer 001; Dominik Kaaser; Marten Maack; Malin Rau; Lisa Wilhelmi (AAMAS, 2025)

A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols. - Henry Austin; Petra Berenbrink; Tom Friedetzky; Thorsten Götte; Lukas Hintze (PODC, 2025)