research
∙
05/10/2021
Distinct Fringe Subtrees in Random Trees
A fringe subtree of a rooted tree is a subtree induced by one of the ver...
share
research
∙
04/27/2021
Hypersuccinct Trees – New universal tree source codes for optimal compressed tree data structures
We present a new universal source code for unlabeled binary and ordinal ...
research
∙
06/01/2020
A Comparison of Empirical Tree Entropies
Whereas for strings, higher-order empirical entropy is the standard entr...
research
∙
03/06/2020
On the Collection of Fringe Subtrees in Random Binary Trees
A fringe subtree of a rooted tree is a subtree consisting of one of the ...
research
∙
10/16/2019
Tree-Shape Grammars for Random Access
Shape grammars are well known in the graphics and design communities but...
research
∙
01/10/2019
Entropy Bounds for Grammar-Based Tree Compressors
The definition of k^th-order empirical entropy of strings is extended to...
research
∙
11/06/2018
Tunneling on Wheeler Graphs
The Burrows-Wheeler Transform (BWT) is an important technique both in da...
research
∙
04/27/2018