George Giakkoupis
George Giakkoupis
Researcher, INRIA Rennes, France
Verified email at inria.fr - Homepage
Title
Cited by
Cited by
Year
Tight bounds for rumor spreading in graphs of a given conductance
G Giakkoupis
Proceedings of the 28th International Symposium on Theoretical Aspects of …, 2011
1322011
Rumor spreading and vertex expansion
G Giakkoupis, T Sauerwald
Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012
562012
Tight bounds for rumor spreading with vertex expansion
G Giakkoupis
Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2014
552014
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
522010
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
452005
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
392012
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
292013
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
Efficient plurality consensus, or: The benefits of cleaning up from time to time
P Berenbrink, T Friedetzky, G Giakkoupis, P Kling
262016
Randomized rumor spreading in dynamic graphs
G Giakkoupis, T Sauerwald, A Stauffer
Proceedings of the 41st International Colloquium on Automata, Languages, and …, 2014
262014
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
252012
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
252010
Bounds on the voter model in dynamic networks
P Berenbrink, G Giakkoupis, AM Kermarrec, F Mallmann-Trenn
arXiv preprint arXiv:1603.01895, 2016
232016
Models and algorithms for network immunization
G Giakkoupis, A Gionis, E Terzi, P Tsaparas
Technical report, C-2005-75, University of Helsink, 2005
222005
On the randomness requirements of rumor spreading
G Giakkoupis, P Woelfel
Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2011
202011
How asynchrony affects rumor spreading time
G Giakkoupis, Y Nazari, P Woelfel
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
192016
On the complexity of greedy routing in ring-based peer-to-peer networks
G Giakkoupis, V Hadzilacos
Proceedings of the 26th ACM Symposium on Principles of Distributed Computing …, 2007
162007
Optimal path search in small worlds: Dimension matters
G Giakkoupis, N Schabanel
Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC), 393-402, 2011
152011
Amplifiers and suppressors of selection for the moran process on undirected graphs
G Giakkoupis
arXiv preprint arXiv:1611.01585, 2016
142016
Gossip protocols for renaming and sorting
G Giakkoupis, AM Kermarrec, P Woelfel
Proceedings of the 27th International Symposium on Distributed Computing …, 2013
142013
The system can't perform the operation now. Try again later.
Articles 1–20