George Giakkoupis

64 papers A* 34A 9B 1Journal 17Unranked 2

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