default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetra Berenbrink
- > Home > Persons > Petra Berenbrink
Publications
- 2024
[i30]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Population Protocols for Exact Plurality Consensus - How a small chance of failure helps to eliminate insignificant opinions. CoRR abs/2402.06471 (2024)- 2022
- [c71]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. PODC 2022: 224-234 - [c69]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Fast Consensus via the Unconstrained Undecided State Dynamics. SODA 2022: 3417-3429 - 2021
- [j35]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling
, Tomasz Radzik:
Time-space trade-offs in population protocols for the majority problem. Distributed Comput. 34(2): 91-111 (2021) - [c67]Petra Berenbrink, Tom Friedetzky, Christopher Hahn, Lukas Hintze, Dominik Kaaser, Peter Kling, Lars Nagel:
Infinite Balanced Allocation via Finite Capacities. ICDCS 2021: 965-975 - [i22]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Fast Consensus via the Unconstrained Undecided State Dynamics. CoRR abs/2103.10366 (2021) - 2020
- [c65]Petra Berenbrink, George Giakkoupis, Peter Kling:
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. PODC 2020: 218-220 - [c64]Petra Berenbrink, George Giakkoupis, Peter Kling:
Optimal time and space leader election in population protocols. STOC 2020: 119-129 - 2019
- [c63]Petra Berenbrink, Tom Friedetzky, Dominik Kaaser, Peter Kling:
Tight & Simple Load Balancing. IPDPS 2019: 718-726 - 2018
- [j31]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell:
Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins. Algorithmica 80(12): 3673-3703 (2018) - [c61]Petra Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach:
Simple and Efficient Leader Election. SOSA 2018: 9:1-9:11 - [c60]Petra Berenbrink, George Giakkoupis, Peter Kling:
Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. SODA 2018: 1715-1733 - [c59]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. DISC 2018: 10:1-10:18 - [i18]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
Majority & Stabilization in Population Protocols. CoRR abs/1805.04586 (2018) - [i17]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
A population protocol for exact majority with O(\log5/3n) stabilization time and asymptotically optimal number of states. CoRR abs/1805.05157 (2018) - [i16]Petra Berenbrink, Tom Friedetzky, Dominik Kaaser, Peter Kling:
Simple Load Balancing. CoRR abs/1808.05389 (2018) - 2017
- [c58]Petra Berenbrink, Peter Kling, Christopher Liaw, Abbas Mehrabian:
Tight Load Balancing Via Randomized Local Search. IPDPS 2017: 192-201 - [c57]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply?: On Breaking Symmetry in Consensus. PODC 2017: 335-344 - [i15]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply? On Breaking Symmetry in Consensus. CoRR abs/1702.04921 (2017) - [i14]Petra Berenbrink, Peter Kling, Christopher Liaw, Abbas Mehrabian:
Tight Load Balancing via Randomized Local Search. CoRR abs/1706.09997 (2017) - 2016
- [c56]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell:
Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing. ESA 2016: 10:1-10:18 - [c55]Petra Berenbrink, Tom Friedetzky, George Giakkoupis, Peter Kling:
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. ICALP 2016: 136:1-136:14 - [c53]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Christopher Wastell:
Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]. PODC 2016: 83-92 - [i13]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell:
Plurality Consensus via Shuffling: Lessons Learned from Load Balancing. CoRR abs/1602.01342 (2016) - [i11]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell:
Self-stabilizing Balls & Bins in Batches. CoRR abs/1603.02188 (2016)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
