7 citations · 20 across the 14 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016★ 1 cited
Average Size of a Suffix Tree for Markov Sources
Philippe Jacquet, Wojciech Szpankowski
We study a suffix tree built from a sequence generated by a Markovian source. Such sources are more realistic probabilistic models for text generation, data compression, molecular…
cs.DS2005
Partial fillup and search time in LC tries
Svante Janson, Wojciech Szpankowski
Andersson and Nilsson introduced in 1993 a level-compressed trie (in short: LC trie) in which a full subtree of a node is compressed to a single node of degree being the size of th…