#### Filter Results:

- Full text PDF available (28)

#### Publication Year

2002

2017

- This year (3)
- Last five years (17)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding… (More)

- Nikolaos Fountoulakis, Bruce A. Reed
- Random Struct. Algorithms
- 2008

In this article we present a study of the mixing time of a random walk on the largest component of a supercritical random graph, also known as the giant component. We identify local obstructions that slow down the random walk, when the average degree d is at most O(√ ln n), proving that the mixing time in this case is ((ln n/d) 2) asymptotically almost… (More)

- Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger
- SIAM J. Comput.
- 2013

Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions. In this paper we investigate further the random walk heuristic for inserting in an online fashion new items into the hash… (More)

- N Fountoulakis, B A Reed
- 2006

We prove a new bound on the mixing time of a Markov chain by considering the conductance of its connected subsets.

- Nikolaos Fountoulakis
- Internet Mathematics
- 2007

We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards we focus on site percolation where the vertices are retained with probability p. We establish critical values for p… (More)

- Nikolaos Fountoulakis, Konstantinos Panagiotou
- Random Struct. Algorithms
- 2010

Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assume that initially one node in a given network holds some piece of information. In each round, every one of the informed nodes chooses independently a neighbor uniformly at random… (More)

- Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou
- INFOCOM
- 2010

—Broadcasting algorithms are of fundamental importance for distributed systems engineering. In this paper we revisit the classical and well-studied push protocol for message broadcasting and we investigate a faulty version of it. Assuming that initially only one node has some piece of information, at each stage every one of the informed nodes chooses… (More)

We analyze the popular push-pull protocol for spreading a rumor in networks. Initially, a single node knows of a rumor. In each succeeding round, every node chooses a random neighbor, and the two nodes share the rumor if one of them is already aware of it. We present the first theoretical analysis of this protocol on random graphs that have a power law… (More)

- Nikolaos Fountoulakis, Konstantinos Panagiotou
- Random Struct. Algorithms
- 2012

The paradigm of many choices has influenced significantly the design of efficient data structures and, most notably, hash tables. Cuckoo hashing is a technique that extends this concept. There, we are given a table with n locations, and we assume that each location can hold one item. Each item to be inserted chooses randomly k ≥ 2 locations and has to be… (More)

- Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
- Electronic Notes in Discrete Mathematics
- 2007

Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn;p denote a random graph on n vertices with edge probability p. Bollobb as, Catlin and Erd} os [5] asymptotically determined ccl(Gn;p) when p is a constant. Luczak, Pittel and Wierman [10] gave bounds on ccl(Gn;p) when p is very close… (More)