52 citations · 224 across the 34 of their papers we have counts for
4 papers · 1 filter
Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes
Fabian Kuhn, Konstantinos Panagiotou, Pascal Su
We investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal trees for the NCA function: For a giv…
Optimal strategies for weighted ray search
Spyros Angelopoulos, Konstantinos Panagiotou
We introduce and study the general setting of weighted search in which a number of targets, each with a certain weight, are hidden in a star-like environment that consists of i…
On the Insertion Time of Cuckoo Hashing
Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger
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 locati…
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…