George GIAKKOUPIS

Address: IRISA/INRIA Rennes–Bretagne Atlantique
Equipe ASAP, Bureau F332
Campus Universitaire de Beaulieu
35042 Rennes Cedex, FRANCE
Office: F332
Phone: +33 2 99 84 71 96
Fax: +33 2 99 84 71 71
Email: george.giakkoupis@inria.fr

I am a permanent INRIA Researcher (CR1) at the ASAP team at IRISA/INRIA Rennes. Previous to that I was a PIMS Postdoctoral Fellow at the University of Calgary, in Canada, working with Philipp Woelfel, and a Postdoctoral Fellow at LIAFA in Paris, working with Pierre Fraigniaud. I received my PhD from the University of Toronto in 2008, under the supervision of Vassos Hadzilacos.

Research Interests

  • Randomized algorithms
  • Distributed algorithms
  • Theory of distributed computing

Activities

Publications

Electronic copies can be found here.

  • George Giakkoupis, Rachid Guerraoui, Arnaud Jégou, Anne-Marie Kermarrec and Nupur Mittal. Privacy-conscious information diffusion in social networks. Proc. 29th International Symposium on Distributed Computing (DISC), Oct. 5-9 2015.
  • George Giakkoupis, Maryam Helmi, Lisa Higham and Philipp Woelfel. Test-and-set in optimal space. Proc. 47th ACM Symposium on Theory of Computing (STOC), pp. 615-623, Jun. 14-17 2015.
  • Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler and Fabian Kuhn. Tight bounds on vertex connectivity under vertex sampling. Proc. 26th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2006-1018, Jan. 4-6 2015.
  • George Giakkoupis and Philipp Woelfel. Randomized mutual exclusion with constant amortized RMR complexity on the DSM. Proc. 55th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 504-513, Oct. 18-21 2014.
  • George Giakkoupis, Thomas Sauerwald and Alexandre Stauffer. Randomized Rumor Spreading in Dynamic Graphs. Proc. 41st International Colloquium on Automata, Languages and Programming (ICALP), pp. 495-507, Jul. 7-11 2014.
  • Pierre Fraigniaud and George Giakkoupis. Greedy routing in small-world networks with power-law degrees. Distributed Computing (DIST), 27(4): 231-253, 2014.
  • George Giakkoupis. Tight bounds for rumor spreading with vertex expansion. Proc. 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 801-815, Jan. 5-7 2014.
  • George Giakkoupis, Anne-Marie Kermarrec, and Philipp Woelfel. Gossip protocols for renaming and sorting. Proc. 27th International Symposium on Distributed Computing (DISC), pp. 194-208, Oct. 14-18 2013.
  • George Giakkoupis, Maryam Helmi, Lisa Higham, and Philipp Woelfel. An O(sqrt n) space bound for obstruction-free leader election. Proc. 27th International Symposium on Distributed Computing (DISC), pp. 46-60, Oct. 14-18 2013.
  • Dan Alistarh, James Aspnes, George Giakkoupis, and Philipp Woelfel. Randomized loose renaming in O(loglog n) time. Proc. 32nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 200-209, Jul. 22-24 2013.
  • George Giakkoupis and Philipp Woelfel. On the time and space complexity of randomized test-and-set. Proc. 31st ACM Symposium on Principles of Distributed Computing (PODC), pp. 19-28, Jul. 16-18 2012. Best paper award.
  • George Giakkoupis and Philipp Woelfel. A tight RMR lower bound for randomized mutual exclusion. Proc. 44th ACM Symposium on Theory of Computing (STOC), pp. 983-1002, May 20-22 2012.
  • George Giakkoupis, Thomas Sauerwald, He Sun, and Philipp Woelfel. Low randomness rumor spreading via hashing. Proc. 29th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 314-325, Feb. 29-Mar. 3 2012.
  • George Giakkoupis and Thomas Sauerwald. Rumor spreading and vertex expansion. Proc. 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1623-1641, Jan. 17-19 2012.
  • George Giakkoupis and Nicolas Schabanel. Optimal path search in small worlds: Dimension matters. Proc. 43rd ACM Symposium on Theory of Computing (STOC), pp. 393-402, June 6-8 2011.
  • George Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. Proc. 28th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 57-68, Mar. 10-12 2011.
  • George Giakkoupis and Philipp Woelfel. On the randomness requirements of rumor spreading. Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 449-461, Jan. 23-25 2011.
  • Pierre Fraigniaud and George Giakkoupis. On the bit communication complexity of randomized rumor spreading. Proc. 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 134-143, June 13-15 2010.
  • Pierre Fraigniaud and George Giakkoupis. On the searchability of small-world networks with arbitrary underlying structure. Proc. 42nd ACM Symposium on Theory of Computing (STOC), pp. 389-398, June 6-8 2010.
  • Pierre Fraigniaud and George Giakkoupis. The effect of power-law degrees on the navigability of small worlds. Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 240-249, Aug. 10-12 2009.
  • George Giakkoupis and Vassos Hadzilacos. On the complexity of greedy routing in ring-based peer-to-peer networks. Proc. 26th ACM Symposium on Principles of Distributed Computing (PODC), pp. 99-108, Aug. 12-15 2007.
  • George Giakkoupis and Vassos Hadzilacos. A scheme for load balancing in heterogeneous distributed hash tables. Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC), pp. 302-311, July 17-20 2005.