6 citations · 6 across the 3 of their papers we have counts for
5 papers
Cluster-and-Conquer: When Randomness Meets Graph Locality
George Giakkoupis, Anne-Marie Kermarrec, Olivier Ruas +1
K-Nearest-Neighbors (KNN) graphs are central to many emblematic data mining and machine-learning applications. Some of the most efficient KNN graph algorithms are incremental and l…
How to Spread a Rumor: Call Your Neighbors or Take a Walk?
George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan
We study the problem of randomized information dissemination in networks. We compare the now standard PUSH-PULL protocol, with agent-based alternatives where information is dissemi…
Efficient Randomized Test-And-Set Implementations
George Giakkoupis, Philipp Woelfel
We study randomized test-and-set (TAS) implementations from registers in the asynchronous shared memory model with n processes. We introduce the problem of group election, a natura…
Bounds on the Voter Model in Dynamic Networks
Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec +1
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 cons…
Tight Bounds for Rumor Spreading with Vertex Expansion
George Giakkoupis
We establish a bound for the classic PUSH-PULL rumor spreading protocol on arbitrary graphs, in terms of the vertex expansion of the graph. We show that O(log^2(n)/α) rounds suffic…