15 citations · 31 across the 11 of their papers we have counts for
8 papers · 1 filter
DejaVu: A Minimalistic Mechanism for Distributed Plurality Consensus
Francesco d'Amore, Niccolò D'Archivio, George Giakkoupis +2
We study the plurality consensus problem in distributed systems where a population of extremely simple agents, each initially holding one of opinions, aims to agree on the init…
On the -majority dynamics with many opinions
Francesco d'Amore, Niccolò D'Archivio, George Giakkoupis +1
We present the first upper bound on the convergence time to consensus of the well-known -majority dynamics with opinions, in the synchronous setting, for and that ar…
Self-Stabilizing MIS Computation in the Beeping Model
George Giakkoupis, Volker Turau, Isabella Ziccardi
We consider self-stabilizing algorithms to compute a Maximal Independent Set (MIS) in the extremely weak beeping communication model. The model consists of an anonymous network wit…
Distributed Self-Stabilizing MIS with Few States and Weak Communication
George Giakkoupis, Isabella Ziccardi
We study a simple random process that computes a maximal independent set (MIS) on a general -vertex graph. Each vertex has a binary state, black or white, where black indicates…
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…
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…
Deterministic and Fast Randomized Test-and-Set in Optimal Space
George Giakkoupis, Maryam Helmi, Lisa Higham +1
The test-and-set object is a fundamental synchronization primitive for shared memory systems. A test-and-set object stores a bit, initialized to 0, and supports one operation, test…