85 citations · 152 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014★ 34 cited
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond
Gábor Rétvári, János Tapolcai, Attila Kőrösi +2
Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the ef…
cs.DS2013
Memory size bounds of prefix DAGs
János Tapolcai, Gábor Rétvári, Attila Kőrösi
In this report an entropy bound on the memory size is given for a compression method of leaf-labeled trees. The compression converts the tree into a Directed Acyclic Graph (DAG) by…