Petra Berenbrink

From MaRDI portal
Person:287987

Available identifiers

zbMath Open berenbrink.petraMaRDI QIDQ287987

List of research outcomes





PublicationDate of PublicationType
Dynamic averaging load balancing on arbitrary graphs2024-11-14Paper
Asynchronous opinion dynamics in social networks2024-09-10Paper
Fast consensus via the unconstrained undecided state dynamics2024-07-19Paper
Population Protocols for Exact Plurality Consensus2024-03-26Paper
Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model2024-03-26Paper
Distributed Averaging in Opinion Dynamics2024-03-26Paper
Dynamic Averaging Load Balancing on Arbitrary Graphs2023-02-23Paper
A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states2022-07-21Paper
Time-space trade-offs in population protocols for the majority problem2021-05-17Paper
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols2021-03-15Paper
On Counting the Population Size2021-01-20Paper
Optimal time and space leader election in population protocols2021-01-19Paper
Simple and Efficient Leader Election2019-10-25Paper
Improved analysis of deterministic load-balancing schemes2019-03-28Paper
Distributed selfish load balancing on networks2018-10-30Paper
Self-stabilizing balls and bins in batches. The power of leaky bins2018-10-18Paper
Tight bounds for coalescing-branching random walks on regular graphs2018-03-15Paper
Plurality consensus in arbitrary graphs: lessons learned from load balancing2018-03-02Paper
Bounds on the Voter Model in Dynamic Networks2017-12-19Paper
Efficient plurality consensus, or: the benefits of cleaning up from time to time2017-12-19Paper
Fault-tolerant shared memory simulations2017-11-16Paper
Ignore or comply? On breaking symmetry in consensus2017-10-11Paper
Distributed selfish load balancing on networks2017-09-29Paper
Self-stabilizing balls \& bins in batches: the power of leaky bins (extended abstract)2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53650532017-09-29Paper
Tight Load Balancing via Randomized Local Search2017-06-29Paper
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems2017-04-04Paper
https://portal.mardi4nfdi.de/entity/Q29654802017-03-03Paper
Concurrent imitation dynamics in congestion games2016-05-23Paper
A simple approach for adapting continuous load balancing processes to discrete settings2016-05-23Paper
Improved analysis of deterministic load-balancing schemes2016-03-23Paper
Balls into non-uniform bins2015-12-18Paper
Communication complexity of quasirandom rumor spreading2015-07-10Paper
Random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time2015-02-20Paper
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems2014-12-12Paper
Distributed selfish load balancing with weights and speeds2014-12-05Paper
Random walks which prefer unvisited edges, exploring high girth even degree expanders in linear time2014-12-05Paper
A simple approach for adapting continuous load balancing processes to discrete settings2014-12-05Paper
Balanced allocations: the heavily loaded case2014-09-26Paper
Randomized diffusion for indivisible loads2014-09-22Paper
Concurrent imitation dynamics in congestion games2014-07-23Paper
Estimating the number of connected components in sublinear time2014-07-18Paper
Speeding up random walks with neighborhood exploration2014-05-22Paper
Randomised broadcasting: memory vs. randomness2014-01-13Paper
Multiple-choice balanced allocation in (almost) parallel2012-11-02Paper
Chains-into-bins processes2012-09-13Paper
Balls into bins with related random choices2012-07-13Paper
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks2012-04-26Paper
Faster coupon collecting via replication with applications in gossiping2011-08-17Paper
Chains-into-Bins Processes2011-05-19Paper
Efficient Information Exchange in the Random Phone-Call Model2010-09-07Paper
Communication complexity of quasirandom rumor spreading2010-09-06Paper
Distributed selfish load balancing2010-08-16Paper
Randomised Broadcasting: Memory vs. Randomness2010-04-27Paper
Evolutionary equilibrium in Bayesian routing games: specialization and niche formation2010-03-09Paper
A sublinear-time approximation scheme for bin packing2009-11-06Paper
The Weighted Coupon Collector’s Problem and Applications2009-07-23Paper
Energy efficient randomised communication in unknown AdHoc networks2009-07-10Paper
On weighted balls-into-bins games2009-01-08Paper
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks2008-09-25Paper
Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation2008-09-25Paper
Distributed Selfish Load Balancing2008-08-14Paper
On the stability of dynamic diffusion load balancing2008-04-03Paper
Utilitarian resource assignment2007-02-14Paper
Algorithms – ESA 20052006-06-27Paper
Balanced Allocations: The Heavily Loaded Case2006-06-01Paper
Automata, Languages and Programming2006-01-10Paper
STACS 20052005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q47377052004-08-11Paper
The Natural Work-Stealing Algorithm is Stable2003-09-28Paper
Allocating weighted jobs in parallel2000-01-10Paper
https://portal.mardi4nfdi.de/entity/Q42522791999-06-17Paper
A simple distributed scheduling policy for parallel interactive continuous media servers1998-08-13Paper

Research outcomes over time

This page was built for person: Petra Berenbrink