π
π
The Cartographer
Lempel Ziv Computation In Small Space (LZ-CISS)
April 10, 2015 Β· Declared Dead Β· π Annual Symposium on Combinatorial Pattern Matching
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Johannes Fischer, Tomohiro I, Dominik KΓΆppl
arXiv ID
1504.02605
Category
cs.DS: Data Structures & Algorithms
Citations
21
Venue
Annual Symposium on Combinatorial Pattern Matching
Last Checked
3 months ago
Abstract
For both the Lempel Ziv 77- and 78-factorization we propose algorithms generating the respective factorization using $(1+Ξ΅) n \lg n + O(n)$ bits (for any positive constant $Ξ΅\le 1$) working space (including the space for the output) for any text of size \$n\$ over an integer alphabet in $O(n / Ξ΅^{2})$ time.
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