π
π
The Cartographer
A Separation Between Run-Length SLPs and LZ77
November 20, 2017 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Philip Bille, Travis Gagie, Inge Li GΓΈrtz, Nicola Prezza
arXiv ID
1711.07270
Category
cs.DS: Data Structures & Algorithms
Citations
5
Venue
arXiv.org
Last Checked
4 months ago
Abstract
In this paper we give an infinite family of strings for which the length of the Lempel-Ziv'77 parse is a factor $Ξ©(\log n/\log\log n)$ smaller than the smallest run-length grammar.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted