BibTex

@article{talg2017kvc,
  author = {Keren Censor-Hillel and Mohsen Ghaffari and George Giakkoupis and Bernhard Haeupler and Fabian Kuhn},
  title = {Tight bounds on vertex connectivity under sampling},
  journal = {ACM Transactions on Algorithms},
  year = {2017},
  volume = {13}
  number = {2},
  pages = {19:1--19:26}
}

@inproceedings{podc2017mutex,
  author = {George Giakkoupis and Philipp Woelfel},
  title = {Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model},
  booktitle = {Proceedings of the 36th {ACM} Symposium on Principles of Distributed Computing (PODC)},
  year = {2017},
  pages = {221--229},
  month = jul # {~25--27}
}

@inproceedings{podc2016asyncrs,
  author = {George Giakkoupis and Yasamin Nazari and Philipp Woelfel},
  title = {How asynchrony affects rumor spreading time},
  booktitle = {Proceedings of the 35th {ACM} Symposium on Principles of Distributed Computing (PODC)},
  year = {2016},
  pages = {185--194},
  month = jul # {~25--29}
}

@inproceedings{icalp2016voter,
  author = {Petra Berenbrink and George Giakkoupis and Anne-Marie Kermarrec and Frederik Mallmann-Trenn},
  title = {Bounds on the voter model in dynamic networks},
  booktitle = {Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP)},
  year = {2016},
  pages = {146:1-146:15},
  month = jul # {~12--15}
}

@inproceedings{icalp2016plurality,
  author = {Petra Berenbrink and Tom Friedetzky and George Giakkoupis and Peter Kling},
  title = {Efficient plurality consensus, or: The benefits of cleaning up from time to time},
  booktitle = {Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP)},
  year = {2016},
  pages = {136:1--136:14},
  month = jul # {~12--15}
}

@inproceedings{disc2015riposte,
  author = {George Giakkoupis and Rachid Guerraoui and Arnaud Jégou and Anne-Marie Kermarrec and Nupur Mittal},
  title = {Privacy-conscious information diffusion in social networks},
  booktitle = {Proceedings of the 29th International Symposium on Distributed Computing (DISC)},
  year = {2015},
  pages = {480--496},
  month = oct # {~5--9}
}

@inproceedings{stoc2015tasspace,
  author = {George Giakkoupis and Maryam Helmi and Lisa Higham and Philipp Woelfel},
  title = {Test-and-set in optimal space},
  booktitle = {Proceedings of the 47th ACM Symposium on Theory of Computing (STOC)},
  year = {2015},
  pages = {615--623},
  month = jun # {~14--17}
}

@inproceedings{soda2015kvc,
  author = {Keren Censor-Hillel and Mohsen Ghaffari and George Giakkoupis and Bernhard Haeupler and Fabian Kuhn},
  title = {Tight bounds on vertex connectivity under vertex sampling},
  booktitle = {Proceedings of the 26th {ACM}-{SIAM} Symposium on Discrete Algorithms (SODA)},
  year = {2015},
  pages = {2006--1018},
  month = jan # {~4--6}
}

@inproceedings{focs2014mutexobl,
  author = {George Giakkoupis and Philipp Woelfel},
  title = {Randomized mutual exclusion with constant amortized RMR complexity on the {DSM}},
  booktitle = {Proceedings of the 55th IEEE Symposium on Foundations of Computer Science (FOCS)},
  year = {2014},
  pages = {504--513},
  month = oct # {~18--21}
}

@inproceedings{icalp2014rsdynamic,
  author = {George Giakkoupis and Thomas Sauerwald and Alexandre Stauffer},
  title = {Randomized rumor spreading in dynamic graphs},
  booktitle = {Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP)},
  year = {2014},
  pages = {495--507},
  month = jul # {~8--11}
}

@article{DIST2014swpl,
  author = {Pierre Fraigniaud and George Giakkoupis},
  title = {Greedy routing in small-world networks with power-law degrees},
  journal = {Distributed Computing},
  year = {2014},
  volume = {27}
  number = {4},
  pages = {231--253}
}

@inproceedings{soda2014vexpansion,
  author = {George Giakkoupis},
  title = {Tight bounds for rumor spreading with vertex expansion},
  booktitle = {Proceedings of the 25th {ACM}-{SIAM} Symposium on Discrete Algorithms (SODA)},
  year = {2014},
  pages = {801--815},
  month = jan # {~5--7}
}

@inproceedings{disc2013sorting,
  author = {George Giakkoupis and Anne-Marie Kermarrec and Philipp Woelfel},
  title = {Gossip protocols for renaming and sorting},
  booktitle = {Proceedings of the 27th International Symposium on Distributed Computing (DISC)},
  year = {2013},
  pages = {194--208},
  month = oct # {~14--18}
}

@inproceedings{disc2013sqrtn,
  author = {George Giakkoupis and Maryam Helmi and Lisa Higham and Philipp Woelfel},
  title = {An ${O}(\sqrt n)$ space bound for obstruction-free leader election},
  booktitle = {Proceedings of the 27th International Symposium on Distributed Computing (DISC)},
  year = {2013},
  pages = {46--60},
  month = oct # {~14--18}
}

@inproceedings{podc2013renaming,
  author = {Dan Alistarh and James Aspnes and George Giakkoupis and Philipp Woelfel},
  title = {Randomized loose renaming in ${O}(\log\log n)$ time},
  booktitle = {Proceedings of the 32nd {ACM} Symposium on Principles of Distributed Computing (PODC)},
  year = {2013},
  pages = {200--209},
  month = jul # {~22--24}
}

@inproceedings{podc2012tas,
  author = {George Giakkoupis and Philipp Woelfel},
  title = {On the time and space complexity of randomized {T}est-{A}nd-{S}et},
  booktitle = {Proceedings of the 31st {ACM} Symposium on Principles of Distributed Computing (PODC)},
  year = {2012},
  pages = {19--28},
  month = jul # {~16--18}
}

@inproceedings{stoc2012rmutex,
  author = {George Giakkoupis and Philipp Woelfel},
  title = {A tight {RMR} lower bound for randomized mutual exclusion},
  booktitle = {Proceedings of the 44th {ACM} Symposium on Theory of Computing (STOC)},
  year = {2012},
  pages = {983--1002},
  month = may # {~19--22}
}

@inproceedings{stacs2012hashing,
  author = {George Giakkoupis and Thomas Sauerwald and He Sun and Philipp Woelfel},
  title = {Low randomness rumor spreading via hashing},
  booktitle = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS)},
  year = {2012},
  pages = {314--425},
  month = feb # {~29--} # mar # {~3}
}

@inproceedings{soda2012vertex-expansion,
  author = {George Giakkoupis and Thomas Sauerwald},
  title = {Rumor spreading and vertex expansion},
  booktitle = {Proceedings of the 23rd {ACM}-{SIAM} Symposium on Discrete Algorithms (SODA)},
  year = {2012},
  pages = {1623--1641},
  month = jan # {~17--19}
}

@inproceedings{stoc2011paths,
  author = {George Giakkoupis and Nicolas Schabanel},
  title = {Optimal path search in small worlds: {D}imension matters},
  booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing (STOC)},
  year = {2011},
  pages = {393--402},
  month = jun # {~6--8}
}

@inproceedings{stacs2011conductance,
  author = {George Giakkoupis},
  title = {Tight bounds for rumor spreading in graphs of a given conductance},
  booktitle = {Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS)},
  year = {2011},
  pages = {57--68},
  month = mar # {~10--12}
}

@inproceedings{soda2011randomness,
  author = {George Giakkoupis and Philipp Woelfel},
  title = {On the randomness requirements of rumor spreading},
  booktitle = {Proceedings of the 22nd {ACM}-{SIAM} Symposium on Discrete Algorithms (SODA)},
  year = {2011},
  pages = {449--461},
  month = jan # {~23--25}
}

@inproceedings{spaa2010rumor,
  author = {Pierre Fraigniaud and George Giakkoupis},
  title = {On the bit communication complexity of randomized rumor spreading},
  booktitle = {Proceedings of the 22nd {ACM} Symposium on Parallel Algorithms and Architectures (SPAA)},
  year = {2010},
  pages = {134--143},
  month = jun # {~13--15}
}

@inproceedings{stoc2010searchability,
  author = {Pierre Fraigniaud and George Giakkoupis},
  title = {On the searchability of small-world networks with arbitrary underlying structure},
  booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing (STOC)},
  year = {2010},
  pages = {389--398},
  month = jun # {~6--8}
}

@inproceedings{podc2009power-law,
  author = {Pierre Fraigniaud and George Giakkoupis},
  title = {The effect of power-law degrees on the navigability of small worlds},
  booktitle = {Proceedings of the 28th {ACM} Symposium on Principles of Distributed Computing (PODC)},
  year = {2009},
  pages = {240--249},
  month = aug # {~10--12}
}

@inproceedings{podc2007greedy,
  author = {George Giakkoupis and Vassos Hadzilacos},
  title = {On the complexity of greedy routing in ring-based peer-to-peer networks},
  booktitle = {Proceedings of the 26th {ACM} Symposium on Principles of Distributed Computing (PODC)},
  year = {2007},
  pages = {99--108},
  month = aug # {~12--15}
}

@inproceedings{podc2005load-balancing,
  author = {George Giakkoupis and Vassos Hadzilacos},
  title = {A scheme for load balancing in heterogenous distributed hash tables},
  booktitle = {Proceedings of the 24th {ACM} Symposium on Principles of Distributed Computing (PODC)},
  year = {2005},
  pages = {302--311},
  month = jul # {~17--20}
}

@phdthesis{phd2008p2p,
  author = {George Giakkoupis},
  title = {On load balancing and routing in peer-to-peer systems},
  school = {Department of Computer Science, University of Toronto},
  year = {2008},
  month = nov
}