Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: George
    Last name: Giakkoupis
    DBLP: 08/5740
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 34 of 34  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Petra Berenbrink, George Giakkoupis, Peter Kling.
    Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs.
    Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 2018 (0) 2018
    Conference paper
    Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn.
    Tight Bounds on Vertex Connectivity Under Sampling.
    ACM Trans. Algorithms 2016, Volume 13 (0) 2017
    Conference paper
    George Giakkoupis, Philipp Woelfel.
    Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model.
    Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017 2017 (0) 2017
    Conference paper
    Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn.
    Bounds on the Voter Model in Dynamic Networks.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    George Giakkoupis, Yasamin Nazari, Philipp Woelfel.
    How Asynchrony Affects Rumor Spreading Time.
    Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016 2016 (0) 2016
    Conference paper
    Petra Berenbrink, Tom Friedetzky, George Giakkoupis, Peter Kling.
    Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn.
    Bounds on the Voter Model in Dynamic Networks.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel.
    Deterministic and Fast Randomized Test-and-Set in Optimal Space.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    George Giakkoupis.
    Amplifiers and Suppressors of Selection for the Moran Process on Undirected Graphs.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Tristan Allard, Davide Frey, George Giakkoupis, Julien Lepiller.
    Lightweight Privacy-Preserving Averaging for the Internet of Things.
    Proceedings of the 3rd Workshop on Middleware for Context-Aware Applications in the IoT, M4IoT@Middleware 2016, Trento, Italy, December 12-13, 2016 2016 (0) 2016
    Conference paper
    Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn.
    Tight Bounds on Vertex Connectivity Under Vertex Sampling.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Conference paper
    George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel.
    Test-and-Set in Optimal Space.
    Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015 2015 (0) 2015
    Conference paper
    George Giakkoupis, Rachid Guerraoui, Arnaud Jégou, Anne-Marie Kermarrec, Nupur Mittal.
    Privacy-Conscious Information Diffusion in Social Networks.
    Distributed Computing - 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings 2015 (0) 2015
    Conference paper
    George Giakkoupis.
    Tight Bounds for Rumor Spreading with Vertex Expansion.
    Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 2014 (0) 2014
    Conference paper
    George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer.
    Randomized Rumor Spreading in Dynamic Graphs.
    Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II 2014 (0) 2014
    Conference paper
    Pierre Fraigniaud, George Giakkoupis.
    Greedy routing in small-world networks with power-law degrees.
    Distributed Computing 2014, Volume 27 (0) 2014
    Conference paper
    George Giakkoupis, Philipp Woelfel.
    Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM.
    55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014 2014 (0) 2014
    Journal article
    George Giakkoupis.
    Tight Bounds for Rumor Spreading with Vertex Expansion
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel.
    Randomized loose renaming in
    ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22-24, 2013 2013 (0) 2013
    Conference paper
    George Giakkoupis, Anne-Marie Kermarrec, Philipp Woelfel.
    Gossip Protocols for Renaming and Sorting.
    Distributed Computing - 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings 2013 (0) 2013
    Conference paper
    George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel.
    An O(sqrt n) Space Bound for Obstruction-Free Leader Election.
    Distributed Computing - 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings 2013 (0) 2013
    Conference paper
    George Giakkoupis, Philipp Woelfel.
    A tight RMR lower bound for randomized mutual exclusion.
    Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012 2012 (0) 2012
    Conference paper
    George Giakkoupis, Philipp Woelfel.
    Brief announcement: a tight RMR lower bound for randomized mutual exclusion.
    ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012 2012 (0) 2012
    Conference paper
    George Giakkoupis, Philipp Woelfel.
    On the time and space complexity of randomized test-and-set.
    ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012 2012 (0) 2012
    Conference paper
    George Giakkoupis, Thomas Sauerwald.
    Rumor spreading and vertex expansion.
    Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 2012 (0) 2012
    Conference paper
    George Giakkoupis, Thomas Sauerwald, He Sun 0001, Philipp Woelfel.
    Low Randomness Rumor Spreading via Hashing.
    29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France 2012 (0) 2012
    Conference paper
    George Giakkoupis.
    Tight bounds for rumor spreading in graphs of a given conductance.
    27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France 2010 (0) 2011
    Conference paper
    George Giakkoupis, Philipp Woelfel.
    On the Randomness Requirements of Rumor Spreading.
    Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 2011 (0) 2011
    Conference paper
    George Giakkoupis, Nicolas Schabanel.
    Optimal path search in small worlds: dimension matters.
    Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011 2011 (0) 2011
    Conference paper
    Pierre Fraigniaud, George Giakkoupis.
    On the searchability of small-world networks with arbitrary underlying structure.
    Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 2010 (0) 2010
    Conference paper
    Pierre Fraigniaud, George Giakkoupis.
    On the bit communication complexity of randomized rumor spreading.
    SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010 2010 (0) 2010
    Conference paper
    Pierre Fraigniaud, George Giakkoupis.
    The effect of power-law degrees on the navigability of small worlds: [extended abstract].
    Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 2009 (0) 2009
    Conference paper
    George Giakkoupis, Vassos Hadzilacos.
    On the complexity of greedy routing in ring-based peer-to-peer networks.
    Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 2007 (0) 2007
    Conference paper
    George Giakkoupis, Vassos Hadzilacos.
    A scheme for load balancing in heterogenous distributed hash tables.
    Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005 2005 (0) 2005
    Show item 1 to 34 of 34  

    Your query returned 34 matches in the database.