| 2026 | PODC | Simple and Efficient Randomized Wait-Free Locks. | Kahbod Aeini, Dante Bencivenga, George Giakkoupis, Philipp Woelfel |
| 2026 | PODC | Distributed Stochastic Graph Algorithms. | Keren Censor-Hillel, Aditi Dudeja, George Giakkoupis |
| 2026 | PODC | Brief Announcement: DjVu: A Minimalistic Mechanism for Distributed Plurality Consensus. | Francesco d'Amore, Niccol D'Archivio, George Giakkoupis, Frdric Giroire, Emanuele Natale |
| 2024 | FOCS | Naively Sorting Evolving Data is Optimal and Robust. | George Giakkoupis, Marcos Kiwi, Dimitrios Los |
| 2024 | PODC | Faster Randomized Repeated Choice and DCAS. | Dante Bencivenga, George Giakkoupis, Philipp Woelfel |
| 2024 | PODC | Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model. | George Giakkoupis, Volker Turau, Isabella Ziccardi |
| 2023 | PODC | Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. | David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel |
| 2023 | PODC | Distributed Self-Stabilizing MIS with Few States and Weak Communication. | George Giakkoupis, Isabella Ziccardi |
| 2022 | STOC | Expanders via local edge flips in quasilinear time. | George Giakkoupis |
| 2021 | ICDE | Cluster-and-Conquer: When Randomness Meets Graph Locality. | George Giakkoupis, Anne-Marie Kermarrec, Olivier Ruas, Franois Taani |
| 2021 | PODC | Search via Parallel Lvy Walks on Z2. | Andrea Clementi, Francesco d'Amore, George Giakkoupis, Emanuele Natale |
| 2021 | SODA | Self-Stabilizing Clock Synchronization with 1-bit Messages. | Paul Bastide, George Giakkoupis, Hayk Saribekyan |
| 2021 | STOC | Efficient randomized DCAS. | George Giakkoupis, Mehrdad Jafari Giv, Philipp Woelfel |
| 2020 | PODC | Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. | Petra Berenbrink, George Giakkoupis, Peter Kling |
| 2020 | STOC | Optimal time and space leader election in population protocols. | Petra Berenbrink, George Giakkoupis, Peter Kling |
| 2019 | PODC | How to Spread a Rumor: Call Your Neighbors or Take a Walk? | George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan |
| 2018 | SODA | Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. | Petra Berenbrink, George Giakkoupis, Peter Kling |
| 2018 | STACS | An Improved Bound for Random Binary Search Trees with Concurrent Insertions. | George Giakkoupis, Philipp Woelfel |
| 2017 | PODC | Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. | George Giakkoupis, Philipp Woelfel |
| 2016 | ICALP | Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. | Petra Berenbrink, Tom Friedetzky, George Giakkoupis, Peter Kling |
| 2016 | ICALP | Bounds on the Voter Model in Dynamic Networks. | Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn |
| 2016 | Middleware | Lightweight Privacy-Preserving Averaging for the Internet of Things. | Tristan Allard, Davide Frey, George Giakkoupis, Julien Lepiller |
| 2016 | PODC | How Asynchrony Affects Rumor Spreading Time. | George Giakkoupis, Yasamin Nazari, Philipp Woelfel |
| 2015 | SODA | Tight Bounds on Vertex Connectivity Under Vertex Sampling. | Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn |
| 2015 | STOC | Test-and-Set in Optimal Space. | George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel |
| 2014 | FOCS | Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. | George Giakkoupis, Philipp Woelfel |
| 2014 | ICALP | Randomized Rumor Spreading in Dynamic Graphs. | George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer |
| 2014 | SODA | Tight Bounds for Rumor Spreading with Vertex Expansion. | George Giakkoupis |
| 2013 | PODC | Randomized loose renaming in | Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel |
| 2012 | PODC | On the time and space complexity of randomized test-and-set. | George Giakkoupis, Philipp Woelfel |
| 2012 | PODC | Brief announcement: a tight RMR lower bound for randomized mutual exclusion. | George Giakkoupis, Philipp Woelfel |
| 2012 | SODA | Rumor spreading and vertex expansion. | George Giakkoupis, Thomas Sauerwald |
| 2012 | STOC | A tight RMR lower bound for randomized mutual exclusion. | George Giakkoupis, Philipp Woelfel |
| 2012 | STACS | Low Randomness Rumor Spreading via Hashing. | George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel |
| 2011 | SODA | On the Randomness Requirements of Rumor Spreading. | George Giakkoupis, Philipp Woelfel |
| 2011 | STOC | Optimal path search in small worlds: dimension matters. | George Giakkoupis, Nicolas Schabanel |
| 2011 | STACS | Tight bounds for rumor spreading in graphs of a given conductance. | George Giakkoupis |
| 2010 | STOC | On the searchability of small-world networks with arbitrary underlying structure. | Pierre Fraigniaud, George Giakkoupis |
| 2010 | SPAA | On the bit communication complexity of randomized rumor spreading. | Pierre Fraigniaud, George Giakkoupis |
| 2009 | PODC | The effect of power-law degrees on the navigability of small worlds: [extended abstract]. | Pierre Fraigniaud, George Giakkoupis |
| 2007 | PODC | On the complexity of greedy routing in ring-based peer-to-peer networks. | George Giakkoupis, Vassos Hadzilacos |
| 2005 | PODC | A scheme for load balancing in heterogenous distributed hash tables. | George Giakkoupis, Vassos Hadzilacos |