George Giakkoupis I am currently a post-doc researcher at the LIAFA (Laboratoire d'Informatique Algorithmique: Fondements et Applications) in Paris. I recently completed my PhD in the Computer Science department at the University of Toronto. You can find my CV here.

Publications

P. Fraigniaud and G. Giakkoupis. On the searchability of small-world networks with arbitrary underlying structure. Proceedings of the 42th ACM Symposium on Theory of Computing (STOC), Cambridge, MA, USA, June 6-8 2010.

P. Fraigniaud and G. Giakkoupis. The effect of power-law degrees on the navigability of small worlds. Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC), pages 240-249, Calgary, Alberta, Canada, August 10-12 2009. --- Full version.

G. Giakkoupis and V. Hadzilacos. On the complexity of greedy routing in ring-based peer-to-peer networks. Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC), pages 99-108, Portland, Oregon, USA, August 12-15 2007. --- See also Chapters 7 & 8 of my thesis.

G. Giakkoupis and V. Hadzilacos. A scheme for load balancing in heterogeneous distributed hash tables. Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC), pages 302-311, Las Vegas, Nevada, USA, July 17-20 2005. --- For a full and updated version see Chapters 2-6 of my thesis.

Thesis

G. Giakkoupis. On load balancing and routing in peer-to-peer systems. Ph.D. Thesis, Department of Computer Science, University of Toronto, 2008.

Teaching

CSCB36 -- Introduction to the Theory of Computation -- Summer 2008

Contact Information