3 citations · 5 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 3 cited
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
Reut Levi, Dana Ron
Motivated by the problem of testing planarity and related properties, we study the problem of designing efficient {\em partition oracles}. A {\em partition oracle} is a procedure t…
cs.DS2013
A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support
Akashnil Dutta, Reut Levi, Dana Ron +1
We present a simple adaptation of the Lempel Ziv 78' (LZ78) compression scheme ({\em IEEE Transactions on Information Theory, 1978}) that supports efficient random access to the in…