P
Petra Berenbrink
Researcher at Simon Fraser University
Publications - 104
Citations - 2166
Petra Berenbrink is an academic researcher from Simon Fraser University. The author has contributed to research in topics: Load balancing (computing) & Computer science. The author has an hindex of 23, co-authored 93 publications receiving 2025 citations. Previous affiliations of Petra Berenbrink include University of Hamburg & University of Paderborn.
Papers
More filters
Journal ArticleDOI
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation
Petra Berenbrink,Oliver Schulte +1 more
TL;DR: This paper considers Nash equilibria for the selfish task allocation game proposed in Koutsoupias, Papadimitriou (1999) [26], where a set of n users with unsplittable tasks of different size try to access m parallel links with different speeds.
Posted Content
A sublinear-time approximation scheme for bin packing
TL;DR: weighted samples are used, where item i is sampled with probability proportional to its weight: that is, with probability w"i/@?"iw"i, in the presence of weighted samples, the approximation algorithm runs in O@?(n@?poly(1/@e) time, where g(x) is an exponential function of x.
Posted Content
Majority & Stabilization in Population Protocols.
TL;DR: This work presents protocols which allow for a trade-off between space and time, and improves the number of interactions by almost a linear factor.
Proceedings ArticleDOI
Simple competitive request scheduling strategies
TL;DR: This paper examines the problem of scheduling real-time requests in distributed data servers in an online setting, and presents (partly matching) upper and lower bounds for several simple scheduling strategies.
Balanced allocations: balls-into-bins revisited and chains-into-bins
TL;DR: In this article, the maximum load of a chains-into-bins game was analyzed and it was shown that for any number of random choices d and which number of balls m, an off-line assignment can be upper bounded by one if m < 0.97677 n and d = 4.