Advanced search    

Search: authors:"Petra Berenbrink"

13 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

- 3664 . IEEE , 2009 . doi: 10 .1109/ICASSP. 2009 . 4960420 . Petra Berenbrink , Robert El?ssser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . Majority & stabilization in population ... protocols . Unpublished manuscript, available on arXiv, May 2018 . Petra Berenbrink , Robert Els?sser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . A population protocol for exact

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

- 3664 . IEEE , 2009 . doi: 10 .1109/ICASSP. 2009 . 4960420 . Petra Berenbrink , Robert El?ssser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . Majority & stabilization in population ... protocols . Unpublished manuscript, available on arXiv, May 2018 . Petra Berenbrink , Robert Els?sser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . A population protocol for exact

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

- 3664 . IEEE , 2009 . doi: 10 .1109/ICASSP. 2009 . 4960420 . Petra Berenbrink , Robert El?ssser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . Majority & stabilization in population ... protocols . Unpublished manuscript, available on arXiv, May 2018 . Petra Berenbrink , Robert Els?sser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . A population protocol for exact

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

- 3664 . IEEE , 2009 . doi: 10 .1109/ICASSP. 2009 . 4960420 . Petra Berenbrink , Robert El?ssser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . Majority & stabilization in population ... protocols . Unpublished manuscript, available on arXiv, May 2018 . Petra Berenbrink , Robert Els?sser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . A population protocol for exact

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

- 3664 . IEEE , 2009 . doi: 10 .1109/ICASSP. 2009 . 4960420 . Petra Berenbrink , Robert El?ssser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . Majority & stabilization in population ... protocols . Unpublished manuscript, available on arXiv, May 2018 . Petra Berenbrink , Robert Els?sser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . A population protocol for exact

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

- 3664 . IEEE , 2009 . doi: 10 .1109/ICASSP. 2009 . 4960420 . Petra Berenbrink , Robert El?ssser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . Majority & stabilization in population ... protocols . Unpublished manuscript, available on arXiv, May 2018 . Petra Berenbrink , Robert Els?sser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . A population protocol for exact

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

- 3664 . IEEE , 2009 . doi: 10 .1109/ICASSP. 2009 . 4960420 . Petra Berenbrink , Robert El?ssser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . Majority & stabilization in population ... protocols . Unpublished manuscript, available on arXiv, May 2018 . Petra Berenbrink , Robert Els?sser, Tom Friedetzky, Dominik Kaaser, Peter Kling , and Tomasz Radzik . A population protocol for exact

Simple and Efficient Leader Election

We provide a simple and efficient population protocol for leader election that uses O(log n) states and elects exactly one leader in O(n (log n)^2) interactions with high probability and in expectation. Our analysis is simple and based on fundamental stochastic arguments. Our protocol combines the tournament based leader elimination by Alistarh and Gelashvili, ICALP'15, with the...

Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time

Plurality consensus considers a network of n nodes, each having one of k opinions. Nodes execute a (randomized) distributed protocol with the goal that all nodes adopt the plurality (the opinion initially supported by the most nodes). Communication is realized via the Gossip (or random phone call) model. A major open question has been whether there is a protocol for the complete...

Bounds on the Voter Model in Dynamic Networks

In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the consensus time, which is the first point in time where all nodes have the same opinion. We consider dynamic graphs in which the edges are rewired in every round (by an adversary) giving rise to the graph...

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing

moment in [26]). Petra Berenbrink, Tom Friedetzky, George Giakkoupis, and Peter Kling [13] build upon [3] and design a protocol that reaches plurality consensus (w.h.p.) in time O (log n ? log log n) and ... indivisible loads . J. Comput. Syst. Sci. , 81 ( 1 ): 159 - 185 , 2015 . Petra Berenbrink , Tom Friedetzky, George Giakkoupis , and Peter Kling . Efficient plurality consensus, or: The benefits of cleaning up

Palindrome Recognition In The Streaming Model

A palindrome is defined as a string which reads forwards the same as backwards, like, for example, the string "racecar". In the Palindrome Problem, one tries to find all palindromes in a given string. In contrast, in the case of the Longest Palindromic Substring Problem, the goal is to find an arbitrary one of the longest palindromes in the string. In this paper we present three...

Not All Scale-Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Evolution

The (asymptotic) degree distributions of the best-known “scale-free” network models are all similar and are independent of the seed graph used; hence, it has been tempting to assume that networks generated by these models are generally similar. In this paper, we observe that several key topological features of such networks depend heavily on the specific model and the seed graph...