A scheme for load balancing in heterogenous distributed hash tables. - George Giakkoupis; Vassos Hadzilacos (PODC, 2005)

On the complexity of greedy routing in ring-based peer-to-peer networks. - George Giakkoupis; Vassos Hadzilacos (PODC, 2007)

The effect of power-law degrees on the navigability of small worlds: [extended abstract]. - Pierre Fraigniaud; George Giakkoupis (PODC, 2009)

On Load Balancing and Routing in Peer-to-peer Systems. - George Giakkoupis (2009)

On the bit communication complexity of randomized rumor spreading. - Pierre Fraigniaud; George Giakkoupis (SPAA, 2010)

On the searchability of small-world networks with arbitrary underlying structure. - Pierre Fraigniaud; George Giakkoupis (STOC, 2010)

On the Randomness Requirements of Rumor Spreading. - George Giakkoupis; Philipp Woelfel (SODA, 2011)

Tight bounds for rumor spreading in graphs of a given conductance. - George Giakkoupis (STACS, 2011)

Optimal path search in small worlds: dimension matters. - George Giakkoupis; Nicolas Schabanel (STOC, 2011)

On the time and space complexity of randomized test-and-set. - George Giakkoupis; Philipp Woelfel (PODC, 2012)

Brief announcement: a tight RMR lower bound for randomized mutual exclusion. - George Giakkoupis; Philipp Woelfel (PODC, 2012)

Rumor spreading and vertex expansion. - George Giakkoupis; Thomas Sauerwald (SODA, 2012)

Low Randomness Rumor Spreading via Hashing. - George Giakkoupis; Thomas Sauerwald; He Sun 001; Philipp Woelfel (STACS, 2012)

A tight RMR lower bound for randomized mutual exclusion. - George Giakkoupis; Philipp Woelfel (STOC, 2012)

Randomized loose renaming in O(log log n) time. - Dan Alistarh; James Aspnes; George Giakkoupis; Philipp Woelfel (PODC, 2013)

An O(sqrt n) Space Bound for Obstruction-Free Leader Election. - George Giakkoupis; Maryam Helmi; Lisa Higham; Philipp Woelfel (DISC, 2013)

Gossip Protocols for Renaming and Sorting. - George Giakkoupis; Anne-Marie Kermarrec; Philipp Woelfel (DISC, 2013)

Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. - George Giakkoupis; Philipp Woelfel (FOCS, 2014)

Randomized Rumor Spreading in Dynamic Graphs. - George Giakkoupis; Thomas Sauerwald; Alexandre Stauffer (ICALP (2), 2014)

Tight Bounds for Rumor Spreading with Vertex Expansion. - George Giakkoupis (SODA, 2014)

Greedy routing in small-world networks with power-law degrees. - Pierre Fraigniaud; George Giakkoupis (Distributed Comput., 2014)

Tight Bounds on Vertex Connectivity Under Vertex Sampling. - Keren Censor-Hillel; Mohsen Ghaffari 001; George Giakkoupis; Bernhard Haeupler; Fabian Kuhn (SODA, 2015)

Test-and-Set in Optimal Space. - George Giakkoupis; Maryam Helmi; Lisa Higham; Philipp Woelfel (STOC, 2015)

Privacy-Conscious Information Diffusion in Social Networks. - George Giakkoupis; Rachid Guerraoui; Arnaud Jégou; Anne-Marie Kermarrec; Nupur Mittal (DISC, 2015)

Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. - Petra Berenbrink; Tom Friedetzky; George Giakkoupis; Peter Kling (ICALP, 2016)

Bounds on the Voter Model in Dynamic Networks. - Petra Berenbrink; George Giakkoupis; Anne-Marie Kermarrec; Frederik Mallmann-Trenn (ICALP, 2016)

Lightweight Privacy-Preserving Averaging for the Internet of Things. - Tristan Allard; Davide Frey; George Giakkoupis; Julien Lepiller (M4IoT@Middleware, 2016)

How Asynchrony Affects Rumor Spreading Time. - George Giakkoupis; Yasamin Nazari; Philipp Woelfel (PODC, 2016)

Amplifiers and Suppressors of Selection for the Moran Process on Undirected Graphs. - George Giakkoupis (CoRR, 2016)

Deterministic and Fast Randomized Test-and-Set in Optimal Space. - George Giakkoupis; Maryam Helmi; Lisa Higham; Philipp Woelfel (CoRR, 2016)

Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. - George Giakkoupis; Philipp Woelfel (PODC, 2017)

Tight Bounds on Vertex Connectivity Under Sampling. - Keren Censor-Hillel; Mohsen Ghaffari 001; George Giakkoupis; Bernhard Haeupler; Fabian Kuhn (ACM Trans. Algorithms, 2017)

Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. - Petra Berenbrink; George Giakkoupis; Peter Kling (SODA, 2018)

An Improved Bound for Random Binary Search Trees with Concurrent Insertions. - George Giakkoupis; Philipp Woelfel (STACS, 2018)

Rumor Spreading and Conductance. - Flavio Chierichetti; George Giakkoupis; Silvio Lattanzi; Alessandro Panconesi (J. ACM, 2018)

How to Spread a Rumor: Call Your Neighbors or Take a Walk? - George Giakkoupis; Frederik Mallmann-Trenn; Hayk Saribekyan (PODC, 2019)

Efficient randomized test-and-set implementations. - George Giakkoupis; Philipp Woelfel (Distributed Comput., 2019)

Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. - Petra Berenbrink; George Giakkoupis; Peter Kling (PODC, 2020)

Optimal time and space leader election in population protocols. - Petra Berenbrink; George Giakkoupis; Peter Kling (STOC, 2020)

Spread of Information and Diseases via Random Walks in Sparse Graphs. - George Giakkoupis; Hayk Saribekyan; Thomas Sauerwald (DISC, 2020)

On the Search Efficiency of Parallel Lévy Walks on Z2. - Andrea Clementi; Francesco D'Amore 001; George Giakkoupis; Emanuele Natale (CoRR, 2020)

Cluster-and-Conquer: When Randomness Meets Graph Locality. - George Giakkoupis; Anne-Marie Kermarrec; Olivier Ruas; François Taïani (ICDE, 2021)

Search via Parallel Lévy Walks on Z2. - Andrea Clementi; Francesco D'Amore 001; George Giakkoupis; Emanuele Natale (PODC, 2021)

Self-Stabilizing Clock Synchronization with 1-bit Messages. - Paul Bastide 002; George Giakkoupis; Hayk Saribekyan (SODA, 2021)

Efficient randomized DCAS. - George Giakkoupis; Mehrdad Jafari Giv; Philipp Woelfel (STOC, 2021)

Expanders via local edge flips in quasilinear time. - George Giakkoupis (STOC, 2022)

Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. - David Yu Cheng Chan; George Giakkoupis; Philipp Woelfel (PODC, 2023)

Distributed Self-Stabilizing MIS with Few States and Weak Communication. - George Giakkoupis; Isabella Ziccardi (PODC, 2023)

Naively Sorting Evolving Data is Optimal and Robust. - George Giakkoupis; Marcos Kiwi; Dimitrios Los (FOCS, 2024)

Faster Randomized Repeated Choice and DCAS. - Dante Bencivenga; George Giakkoupis; Philipp Woelfel (PODC, 2024)

Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model. - George Giakkoupis; Volker Turau; Isabella Ziccardi (PODC, 2024)

Self-Stabilizing MIS Computation in the Beeping Model. - George Giakkoupis; Volker Turau; Isabella Ziccardi (DISC, 2024)

Luby's MIS algorithms made self-stabilizing. - George Giakkoupis; Volker Turau; Isabella Ziccardi (Inf. Process. Lett., 2025)

On the h-majority dynamics with many opinions. - Francesco D'Amore 001; Niccolò D'Archivio; George Giakkoupis; Emanuele Natale (CoRR, 2025)