5 citations · 5 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Characterization of random walks on space of unordered trees using efficient metric simulation
Farah Ben Naoum, Christophe Godin, Romain Azaïs
The simple random walk on shows two drastically different behaviours depending on the value of : it is recurrent when while it escapes (with a rate…
cs.DS2017
Nearest Embedded and Embedding Self-Nested Trees
Romain Azaïs
Self-nested trees present a systematic form of redundancy in their subtrees and thus achieve optimal compression rates by DAG compression. A method for quantifying the degree of se…