| Tight bounds for rumor spreading in graphs of a given conductance G Giakkoupis Proceedings of the 28th International Symposium on Theoretical Aspects of …, 2011 | 155 | 2011 |
| Tight bounds for rumor spreading with vertex expansion G Giakkoupis Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2014 | 67 | 2014 |
| Rumor spreading and vertex expansion G Giakkoupis, T Sauerwald Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012 | 65 | 2012 |
| 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 | 58 | 2020 |
| On the searchability of small-world networks with arbitrary underlying structure P Fraigniaud, G Giakkoupis Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), 389-398, 2010 | 55 | 2010 |
| Bounds on the voter model in dynamic networks P Berenbrink, G Giakkoupis, AM Kermarrec, F Mallmann-Trenn arXiv preprint arXiv:1603.01895, 2016 | 47 | 2016 |
| A scheme for load balancing in heterogenous distributed hash tables G Giakkoupis, V Hadzilacos Proceedings of the 24th ACM Symposium on Principles of Distributed Computing …, 2005 | 46 | 2005 |
| On the time and space complexity of randomized test-and-set G Giakkoupis, P Woelfel Proceedings of the 31st ACM Symposium on Principles of Distributed Computing …, 2012 | 43 | 2012 |
| How asynchrony affects rumor spreading time G Giakkoupis, Y Nazari, P Woelfel Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 36 | 2016 |
| Efficient plurality consensus, or: The benefits of cleaning up from time to time P Berenbrink, T Friedetzky, G Giakkoupis, P Kling 43rd International Colloquium on Automata, Languages and Programming (ICALP …, 2016 | 36 | 2016 |
| Randomized rumor spreading in dynamic graphs G Giakkoupis, T Sauerwald, A Stauffer Proceedings of the 41st International Colloquium on Automata, Languages, and …, 2014 | 36 | 2014 |
| An O (sqrt n) space bound for obstruction-free leader election G Giakkoupis, M Helmi, L Higham, P Woelfel Proceedings of the 27th International Symposium on Distributed Computing …, 2013 | 33* | 2013 |
| Rumor spreading and conductance F Chierichetti, G Giakkoupis, S Lattanzi, A Panconesi Journal of the ACM (JACM) 65 (4), 1-21, 2018 | 29 | 2018 |
| Models and algorithms for network immunization G Giakkoupis, A Gionis, E Terzi, P Tsaparas Technical report, C-2005-75, University of Helsink, 2005 | 28 | 2005 |
| A tight RMR lower bound for randomized mutual exclusion G Giakkoupis, P Woelfel Proceedings of the 44th ACM Symposium on Theory of Computing (STOC), 983-1002, 2012 | 27 | 2012 |
| The effect of power-law degrees on the navigability of small worlds (extended abstract) P Fraigniaud, G Giakkoupis Proceedings of the 28th ACM Symposium on Principles of Distributed Computing …, 2009 | 27* | 2009 |
| Amplifiers and suppressors of selection for the moran process on undirected graphs G Giakkoupis arXiv preprint arXiv:1611.01585, 2016 | 26 | 2016 |
| On the bit communication complexity of randomized rumor spreading P Fraigniaud, G Giakkoupis Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and …, 2010 | 26 | 2010 |
| Privacy-conscious information diffusion in social networks G Giakkoupis, R Guerraoui, A Jégou, AM Kermarrec, N Mittal Proceedings of the 29th International Symposium on Distributed Computing …, 2015 | 22 | 2015 |
| On the randomness requirements of rumor spreading G Giakkoupis, P Woelfel Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2011 | 22 | 2011 |
Philipp WoelfelUniversity of CalgaryVerified email at ucalgary.ca
