2 papers
cs.IT2023
On Random Tree Structures, Their Entropy, and Compression
Amirmohammad Farzaneh, Mihai-Alin Badiu, Justin P. Coon
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then b…
cs.NI2022
TreeExplorer: a coding algorithm for rooted trees with application to wireless and ad hoc routing
Amirmohammad Farzaneh, Mihai-Alin Badiu, Justin P. Coon
Routing tables in ad hoc and wireless routing protocols can be represented using rooted trees. The constant need for communication and storage of these trees in routing protocols d…