Articles with public access mandates - George GiakkoupisLearn more
Not available anywhere: 2
Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model
G Giakkoupis, V Turau, I Ziccardi
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing …, 2024
Mandates: European Commission, Agence Nationale de la Recherche
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols
P Berenbrink, G Giakkoupis, P Kling
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
Mandates: Agence Nationale de la Recherche
Available somewhere: 19
Tight bounds for rumor spreading with vertex expansion
G Giakkoupis
Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2014
Mandates: European Commission
Optimal time and space leader election in population protocols
P Berenbrink, G Giakkoupis, P Kling
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
Mandates: Agence Nationale de la Recherche
How asynchrony affects rumor spreading time
G Giakkoupis, Y Nazari, P Woelfel
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
Mandates: Natural Sciences and Engineering Research Council of Canada
Rumor spreading and conductance
F Chierichetti, G Giakkoupis, S Lattanzi, A Panconesi
Journal of the ACM (JACM) 65 (4), 1-21, 2018
Mandates: European Commission
How to spread a rumor: Call your neighbors or take a walk?
G Giakkoupis, F Mallmann-Trenn, H Saribekyan
Proceedings of the 2019 ACM symposium on principles of distributed computing …, 2019
Mandates: US National Science Foundation, Bill & Melinda Gates Foundation, European …
Search via parallel Lévy walks on Z2
A Clementi, F d'Amore, G Giakkoupis, E Natale
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
Mandates: Agence Nationale de la Recherche
Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model
G Giakkoupis, P Woelfel
Proceedings of the ACM Symposium on Principles of Distributed Computing, 221-229, 2017
Mandates: Natural Sciences and Engineering Research Council of Canada
Randomized loose renaming in O (log logn) time
D Alistarh, J Aspnes, G Giakkoupis, P Woelfel
Proceedings of the 31st ACM Symposium on Principles of Distributed Computing …, 2013
Mandates: Swiss National Science Foundation
Self-stabilizing clock synchronization with 1-bit messages
P Bastide, G Giakkoupis, H Saribekyan
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Mandates: Agence Nationale de la Recherche
Distributed self-stabilizing MIS with few states and weak communication
G Giakkoupis, I Ziccardi
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023
Mandates: European Commission, Agence Nationale de la Recherche
Efficient randomized DCAS
G Giakkoupis, MJ Giv, P Woelfel
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Mandates: Natural Sciences and Engineering Research Council of Canada, Agence …
Efficient randomized test-and-set implementations
G Giakkoupis, P Woelfel
Distributed Computing 32 (6), 565-586, 2019
Mandates: Natural Sciences and Engineering Research Council of Canada
Spread of information and diseases via random walks in sparse graphs
G Giakkoupis, H Saribekyan, T Sauerwald
DISC 2020-34rd International Symposium on Distributed Computing, 1-42, 2020
Mandates: Bill & Melinda Gates Foundation, European Commission, Agence Nationale de la …
Tight bounds on vertex connectivity under sampling
K Censor-Hillel, M Ghaffari, G Giakkoupis, B Haeupler, F Kuhn
ACM Transactions on Algorithms (TALG) 13 (2), 1-26, 2017
Mandates: US National Science Foundation
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
DYC Chan, G Giakkoupis, P Woelfel
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023
Mandates: Natural Sciences and Engineering Research Council of Canada, Agence …
Expanders via local edge flips in quasilinear time
G Giakkoupis
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
Mandates: Agence Nationale de la Recherche
An Improved Bound for Random Binary Search Trees with Concurrent Insertions
G Giakkoupis, P Woelfel
STACS 2018-35th Symposium on Theoretical Aspects of Computer Science, 1-13, 2018
Mandates: Natural Sciences and Engineering Research Council of Canada
Faster Randomized Repeated Choice and DCAS
D Bencivenga, G Giakkoupis, P Woelfel
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing …, 2024
Mandates: Agence Nationale de la Recherche
Publication and funding information is determined automatically by a computer program