3 citations · 7 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 1 cited
Depth-First Search performance in a random digraph with geometric outdegree distribution
Philippe Jacquet, Svante Janson
We present an analysis of the depth-first search algorithm in a random digraph model with independent outdegrees having a geometric distribution. The results include asymptotic res…
cs.DS2009★ 3 cited
Renewal theory in analysis of tries and strings
Svante Janson
We give a survey of a number of simple applications of renewal theory to problems on random strings and tries: insertion depth, size, insertion mode and imbalance of tries; variati…