Petra Berenbrink

Orcid: 0000-0002-6930-3259

Affiliations:
  • University of Hamburg, Department of Informatics, Germany
  • Simon Fraser University, School of Computing, Vancouver, BC, Canada
  • University of Paderborn, Department of Computer Science, Germany (PhD 2000)


According to our database1, Petra Berenbrink authored at least 100 papers between 1996 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Inference of a rumor's source in the independent cascade model.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Distributed Averaging in Opinion Dynamics.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Dynamic Averaging Load Balancing on Arbitrary Graphs.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Distributed Averaging in Population Protocols.
CoRR, 2022

On early extinction and the effect of travelling in the SIR model.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Fast Consensus via the Unconstrained Undecided State Dynamics.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Loosely-Stabilizing Phase Clocks and The Adaptive Majority Problem.
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

On the Hierarchy of Distributed Majority Protocols.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

On the Optimality of the Greedy Garbage Collection Strategy for SSDs.
Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

Asynchronous Opinion Dynamics in Social Networks.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Introduction to the Special Issue for SPAA 2019.
ACM Trans. Parallel Comput., 2021

Randomized renaming in shared memory systems.
J. Parallel Distributed Comput., 2021

Time-space trade-offs in population protocols for the majority problem.
Distributed Comput., 2021

Self-Stabilizing Phase Clocks and the Adaptive Majority Problem.
CoRR, 2021

Infinite Balanced Allocation via Finite Capacities.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020
Optimal time and space leader election in population protocols.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Brief Announcement: Optimal Time and Space Leader Election in Population Protocols.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Simulating Population Protocols in Sub-Constant Time per Interaction.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Improved Analysis of Deterministic Load-Balancing Schemes.
ACM Trans. Algorithms, 2019

On Counting the Population Size.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Tight & Simple Load Balancing.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

2018
Threshold load balancing with weighted tasks.
J. Parallel Distributed Comput., 2018

Simple Load Balancing.
CoRR, 2018

A population protocol for exact majority with O(\log<sup>5/3</sup>n) stabilization time and asymptotically optimal number of states.
CoRR, 2018

Majority & Stabilization in Population Protocols.
CoRR, 2018

Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins.
Algorithmica, 2018

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Simple and Efficient Leader Election.
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Ignore or Comply?: On Breaking Symmetry in Consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Tight Load Balancing Via Randomized Local Search.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems.
Distributed Comput., 2016

A simple approach for adapting continuous load balancing processes to discrete settings.
Distributed Comput., 2016

Concurrent imitation dynamics in congestion games.
Distributed Comput., 2016

Plurality Consensus via Shuffling: Lessons Learned from Load Balancing.
CoRR, 2016

Self-stabilizing Balls & Bins in Batches.
CoRR, 2016

Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract].
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Bounds on the Voter Model in Dynamic Networks.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time.
Random Struct. Algorithms, 2015

Randomized diffusion for indivisible loads.
J. Comput. Syst. Sci., 2015

Communication Complexity of Quasirandom Rumor Spreading.
Algorithmica, 2015

Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014
Randomised broadcasting: Memory vs. randomness.
Theor. Comput. Sci., 2014

Distributed Selfish Load Balancing on Networks.
ACM Trans. Algorithms, 2014

Balls into non-uniform bins.
J. Parallel Distributed Comput., 2014

Estimating the number of connected components in sublinear time.
Inf. Process. Lett., 2014

Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy.
CoRR, 2014

Palindrome Recognition In The Streaming Model.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013
Balls-into-bins with nearly optimal load distribution.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Parallel rotor walks on finite graphs and applications in discrete load balancing.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Distributing Storage in Cloud Environments.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012
Balls into bins with related random choices.
J. Parallel Distributed Comput., 2012

Chains-into-bins processes.
J. Discrete Algorithms, 2012

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

Distributed selfish load balancing with weights and speeds.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Improved Bounds for Discrete Diffusive Load Balancing.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

Multiple-Choice Balanced Allocation in (Almost) Parallel.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Faster Coupon Collecting via Replication with Applications in Gossiping.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation.
Theor. Comput. Sci., 2010

Speeding Up Random Walks with Neighborhood Exploration.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Efficient Information Exchange in the Random Phone-Call Model.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Energy efficient randomised communication in unknown AdHoc networks.
Theor. Comput. Sci., 2009

A sublinear-time approximation scheme for bin packing.
Theor. Comput. Sci., 2009

A new analytical method for parallel, diffusion-type load balancing.
J. Parallel Distributed Comput., 2009

The Weighted Coupon Collector's Problem and Applications.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
On weighted balls-into-bins games.
Theor. Comput. Sci., 2008

On the Stability of Dynamic Diffusion Load Balancing.
Algorithmica, 2008

2007
Distributed Selfish Load Balancing.
SIAM J. Comput., 2007

Not All Scale-Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Evolution.
PLoS Comput. Biol., 2007

2006
The degree distribution of the generalized duplication model.
Theor. Comput. Sci., 2006

Balanced Allocations: The Heavily Loaded Case.
SIAM J. Comput., 2006

Utilitarian resource assignment.
J. Discrete Algorithms, 2006

Energy Efficient Randomized Communication in Unknown AdHoc Networks
CoRR, 2006

Not All Scale Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Emulation.
Proceedings of the Systems Biology and Computational Proteomics, 2006

2005
(quasi) Spanners for Mobile Ad Hoc Networks.
J. Interconnect. Networks, 2005

Improved Duplication Models for Proteome Network Evolution.
Proceedings of the Systems Biology and Regulatory Genomics, 2005

Dynamic Diffusion Load Balancing.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Finding Frequent Patterns in a String in Sublinear Time.
Proceedings of the Algorithms, 2005

2004
Identifying Uniformly Mutated Segments within Repeats.
J. Bioinform. Comput. Biol., 2004

2003
The Natural Work-Stealing Algorithm is Stable.
SIAM J. Comput., 2003

A proportionate fair scheduling rule with good worst-case performance.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002
Statistical Identification of Uniformly Mutated Segments within Repeats.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
SIMLAB-A Simulation Environment for Storage Area Networks.
Proceedings of the Ninth Euromicro Workshop on Parallel and Distributed Processing, 2001

Simple Routing Strategies for Adversarial Systems.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Randomized allocation of independent tasks.
PhD thesis, 2000

Infinite parallel job allocation (extended abstract).
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Distributed Path Selection for Storage Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999
Allocating Weighted Jobs in Parallel.
Theory Comput. Syst., 1999

Simple Competitive Request Scheduling Strategies.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Randomized and Adversarial Load Balancing.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Parallel Continuous Randomized Load Balancing (Extended Abstract).
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

Analyzing an Infinite Parallel Job Allocation Process.
Proceedings of the Algorithms, 1998

1997
A Simple Distributed Scheduling Policy for Parallel Interactive Continuous Media Servers.
Parallel Comput., 1997

Online Scheduling of Continuous Media Streams.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
Fault-Tolerant Shared Memory Simulations.
Proceedings of the STACS 96, 1996


  Loading...