George Giakkoupis

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 36

Top Topics

Mutual Exclusion

Top Venues

Publications

George Giakkoupis, Volker Turau, Isabella Ziccardi
Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model. PODC (2024)
George Giakkoupis, Volker Turau, Isabella Ziccardi
Self-Stabilizing MIS Computation in the Beeping Model. CoRR (2024)
George Giakkoupis, Marcos Kiwi, Dimitrios Los
Naively Sorting Evolving Data is Optimal and Robust. CoRR (2024)
Dante Bencivenga, George Giakkoupis, Philipp Woelfel
Faster Randomized Repeated Choice and DCAS. PODC (2024)
George Giakkoupis, Isabella Ziccardi
Distributed Self-Stabilizing MIS with Few States and Weak Communication. PODC (2023)
David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. PODC (2023)
George Giakkoupis, Isabella Ziccardi
Distributed Self-Stabilizing MIS with Few States and Weak Communication. CoRR (2023)
George Giakkoupis
Expanders via local edge flips in quasilinear time. STOC (2022)
George Giakkoupis, Anne-Marie Kermarrec, Olivier Ruas, François Taïani
Cluster-and-Conquer: When Randomness Meets Graph Locality. ICDE (2021)
Paul Bastide, George Giakkoupis, Hayk Saribekyan
Self-Stabilizing Clock Synchronization with 1-bit Messages. SODA (2021)
George Giakkoupis, Mehrdad Jafari Giv, Philipp Woelfel
Efficient randomized DCAS. STOC (2021)
Andrea E. F. Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale
Search via Parallel Lévy Walks on Z2. PODC (2021)
George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan
How to Spread a Rumor: Call Your Neighbors or Take a Walk? CoRR (2020)
Andrea E. F. Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale
. CoRR (2020)
George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald
Spread of Information and Diseases via Random Walks in Sparse Graphs. DISC (2020)
Petra Berenbrink, George Giakkoupis, Peter Kling
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. PODC (2020)
Petra Berenbrink, George Giakkoupis, Peter Kling
Optimal time and space leader election in population protocols. STOC (2020)
George Giakkoupis, Anne-Marie Kermarrec, Olivier Ruas, François Taïani
Cluster-and-Conquer: When Randomness Meets Graph Locality. CoRR (2020)
George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan
How to Spread a Rumor: Call Your Neighbors or Take a Walk? PODC (2019)
George Giakkoupis, Philipp Woelfel
Efficient Randomized Test-And-Set Implementations. CoRR (2019)
George Giakkoupis, Philipp Woelfel
Efficient randomized test-and-set implementations. Distributed Comput. 32 (6) (2019)
George Giakkoupis, Philipp Woelfel
An Improved Bound for Random Binary Search Trees with Concurrent Insertions. STACS (2018)
Petra Berenbrink, George Giakkoupis, Peter Kling
Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. SODA (2018)
Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, Alessandro Panconesi
Rumor Spreading and Conductance. J. ACM 65 (4) (2018)
Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn
Tight Bounds on Vertex Connectivity Under Sampling. ACM Trans. Algorithms 13 (2) (2017)
George Giakkoupis, Philipp Woelfel
Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. PODC (2017)
Petra Berenbrink, Tom Friedetzky, George Giakkoupis, Peter Kling
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. ICALP (2016)
Tristan Allard, Davide Frey, George Giakkoupis, Julien Lepiller
Lightweight Privacy-Preserving Averaging for the Internet of Things. M4IoT@Middleware (2016)
Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn
Bounds on the Voter Model in Dynamic Networks. ICALP (2016)
George Giakkoupis
Amplifiers and Suppressors of Selection for the Moran Process on Undirected Graphs. CoRR (2016)
George Giakkoupis, Yasamin Nazari, Philipp Woelfel
How Asynchrony Affects Rumor Spreading Time. PODC (2016)
Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn
Bounds on the Voter Model in Dynamic Networks. CoRR (2016)
George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel
Deterministic and Fast Randomized Test-and-Set in Optimal Space. CoRR (2016)
George Giakkoupis, Rachid Guerraoui, Arnaud Jégou, Anne-Marie Kermarrec, Nupur Mittal
Privacy-Conscious Information Diffusion in Social Networks. DISC (2015)
Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn
Tight Bounds on Vertex Connectivity Under Vertex Sampling. SODA (2015)
George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel
Test-and-Set in Optimal Space. STOC (2015)
George Giakkoupis
Tight Bounds for Rumor Spreading with Vertex Expansion. SODA (2014)
George Giakkoupis, Philipp Woelfel
Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. FOCS (2014)
Pierre Fraigniaud, George Giakkoupis
Greedy routing in small-world networks with power-law degrees. Distributed Comput. 27 (4) (2014)
George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer
Randomized Rumor Spreading in Dynamic Graphs. ICALP (2) (2014)
George Giakkoupis, Anne-Marie Kermarrec, Philipp Woelfel
Gossip Protocols for Renaming and Sorting. DISC (2013)
George Giakkoupis
Tight Bounds for Rumor Spreading with Vertex Expansion CoRR (2013)
George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel
An O(sqrt n) Space Bound for Obstruction-Free Leader Election. DISC (2013)
Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel
) time. PODC (2013)
George Giakkoupis, Philipp Woelfel
On the time and space complexity of randomized test-and-set. PODC (2012)
George Giakkoupis, Philipp Woelfel
A tight RMR lower bound for randomized mutual exclusion. STOC (2012)
George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel
Low Randomness Rumor Spreading via Hashing. STACS (2012)
George Giakkoupis, Philipp Woelfel
Brief announcement: a tight RMR lower bound for randomized mutual exclusion. PODC (2012)
George Giakkoupis, Thomas Sauerwald
Rumor spreading and vertex expansion. SODA (2012)
George Giakkoupis, Philipp Woelfel
On the Randomness Requirements of Rumor Spreading. SODA (2011)
George Giakkoupis, Nicolas Schabanel
Optimal path search in small worlds: dimension matters. STOC (2011)
George Giakkoupis
Tight bounds for rumor spreading in graphs of a given conductance. STACS (2011)
Pierre Fraigniaud, George Giakkoupis
On the bit communication complexity of randomized rumor spreading. SPAA (2010)
Pierre Fraigniaud, George Giakkoupis
On the searchability of small-world networks with arbitrary underlying structure. STOC (2010)
Pierre Fraigniaud, George Giakkoupis
The effect of power-law degrees on the navigability of small worlds: [extended abstract]. PODC (2009)
George Giakkoupis, Vassos Hadzilacos
On the complexity of greedy routing in ring-based peer-to-peer networks. PODC (2007)
George Giakkoupis, Vassos Hadzilacos
A scheme for load balancing in heterogenous distributed hash tables. PODC (2005)