MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 20 documents:

  1. On the Insertion Time of Cuckoo Hashing
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    SIAM Journal on Computing , 2013. Note: Accepted for publication.
  2. Tight Load Thresholds for Cuckoo Hashing
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    Random Structures and Algorithms 41 (3): 306-333, 2012
  3. Ultra-fast rumor spreading in social networks
    Nikolaos Fountoulakis, Konstantinos Panagiotou, and Thomas Sauerwald
    In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 1642-1660
  4. 3-Connected Cores In Random Planar Graphs
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    Combinatorics, Probability & Computing 20 (3): 381-412, 2011
  5. Average Case Parameterized Complexity
    Nikolaos Fountoulakis, Tobias Friedrich, and Danny Hermelin
    . Note: Submitted
  6. The Multiple-orientability Thresholds for Random Hypergraphs
    Nikolaos Fountoulakis, Megha Khosla, and Konstantinos Panagiotou
    In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011, 1222-1236
  7. Orientability of random hypergraphs and the power of multiple choices
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, Bordeaux, France, 2010, 348-359
  8. Reliable broadcasting in random networks and the effect of density
    Nikolaos Fountoulakis, Anna Huber, and Konstantinos Panagiotou
    In: 2010 Proceedings IEEE INFOCOM, San Diego, USA, 2010, 2552-2560
  9. Rumor spreading on random regular graphs and expanders
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Barcelona, Spain, 2010, 560-573
  10. The t-stability number of a random graph
    Nikolaos Fountoulakis, Ross Kang, and Colin McDiarmid
    The Electronic Journal of Combinatorics 17 (1): R59,1-R59,29, 2010
  11. Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
    Nikolaos Fountoulakis, Anna Huber, and Konstantinos Panagiotou
    In: Distributed Computing : 23rd International Symposium, DISC 2009, Elche/Elx, Spain, 2009, 529-530. Note: Full version available from arXiv:0904.4851
  12. Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
    Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, and Deryk Osthus
    Combinatorica 29 (3): 263-297, 2009. Note: to appear
  13. Minors in random regular graphs
    Nikolaos Fountoulakis, Daniela Kühn, and Deryk Osthus
    Random Structures and Algorithms 35: 444-463, 2009
  14. Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
    Nikolaos Fountoulakis and Anna Huber
    SIAM Journal on Discrete Mathematics 23 (4): 1964-1991, 2009
  15. The Speed of Broadcasting in Random Networks: Density Does Not Matter
    Nikolaos Fountoulakis, Anna Huber, and Konstantinos Panagiotou
    In: 23rd International Symposium on Distributed Computing (DISC '09), Elche/Elx, Spain, 2009, 529-530
  16. 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
    Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, and Deryk Osthus
    Journal of Combinatorial Theory B 98: 484-505, 2008
  17. The evolution of the mixing rate of a simple random walk on the giant component of a random graph
    Nikolaos Fountoulakis and Bruce Reed
    Random Structures and Algorithms 33: 68-86, 2008
  18. The order of the largest complete minor in a random graph
    Nikolaos Fountoulakis, Daniela Kühn, and Deryk Osthus
    Random Structures and Algorithms 33: 127-141, 2008
  19. Faster Mixing and Small Bottlenecks
    Nikolaos Fountoulakis and Bruce Reed
    Probability Theory and Related Fields 137: 475-486, 2007
  20. Percolation on sparse random graphs with given degree sequence
    Nikolaos Fountoulakis
    Internet Mathematics 4 (4): 329-356, 2007. Note: to appear