15 citations · 31 across the 11 of their papers we have counts for
3 papers · 1 filter
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…
Search via Parallel Lévy Walks on
Andrea Clementi, Francesco d'Amore, George Giakkoupis +1
Motivated by the Lévy foraging hypothesis -- the premise that various animal species have adapted to follow Lévy walks to optimize their search efficiency -- we study the parallel…