Papers
Topics
Authors
Recent
Search
2000 character limit reached

Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries

Published 9 Jun 2017 in cs.DS | (1706.03035v1)

Abstract: We present the first thorough practical study of the Lempel-Ziv-78 and the Lempel-Ziv-Welch computation based on trie data structures. With a careful selection of trie representations we can beat well-tuned popular trie data structures like Judy, m-Bonsai or Cedar.

Citations (8)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.