8 citations · 10 across the 4 of their papers we have counts for
4 papers
Sharp Load Thresholds for Cuckoo Hashing
Nikolaos Fountoulakis, Konstantinos Panagiotou
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 co…
Extremal Subgraphs of Random Graphs: an Extended Version
Graham Brightwell, Konstantinos Panagiotou, Angelika Steger
We prove that there is a constant , such that whenever , with probability tending to 1 when goes to infinity, every maximum triangle-free subgraph of the ra…
3-Connected Cores In Random Planar Graphs
Nikolaos Fountoulakis, Konstantinos Panagiotou
The study of the structural properties of large random planar graphs has become in recent years a field of intense research in computer science and discrete mathematics. Nowadays,…
The Speed of Broadcasting in Random Networks: Density Does Not Matter
Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou
Broadcasting algorithms are of fundamental importance for distributed systems engineering. In this paper we revisit the classical and well-studied push protocol for message broadca…