34 citations · 40 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020★ 2 cited
An O(n) time algorithm for finding Hamilton cycles with high probability
Rajko Nenadov, Angelika Steger, Pascal Su
We design a randomized algorithm that finds a Hamilton cycle in time with high probability in a random graph with edge probability . T…
cs.DS2017
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…