Sketching and Streaming for Dictionary Compression
Fuente:
arXiv
Saved in:
| Main Authors: | Becker, Ruben, Canton, Matteo, Cenzato, Davide, Kim, Sung-Hwan, Kodric, Bojana, Prezza, Nicola |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Random Wheeler Automata
by: Becker, Ruben, et al.
Published: (2023)
by: Becker, Ruben, et al.
Published: (2023)
The Trie Measure, Revisited
by: Alanko, Jarno N., et al.
Published: (2025)
by: Alanko, Jarno N., et al.
Published: (2025)
Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025)
by: Becker, Ruben, et al.
Published: (2025)
Testing Suffixient Sets
by: Cenzato, Davide, et al.
Published: (2025)
by: Cenzato, Davide, et al.
Published: (2025)
Suffixient Arrays: a New Efficient Suffix Array Compression Technique
by: Cenzato, Davide, et al.
Published: (2024)
by: Cenzato, Davide, et al.
Published: (2024)
Computing the LCP Array of a Labeled Graph
by: Alanko, Jarno, et al.
Published: (2024)
by: Alanko, Jarno, et al.
Published: (2024)
Encoding Co-Lex Orders of Finite-State Automata in Linear Space
by: Becker, Ruben, et al.
Published: (2025)
by: Becker, Ruben, et al.
Published: (2025)
Indexing Finite-State Automata Using Forward-Stable Partitions
by: Becker, Ruben, et al.
Published: (2024)
by: Becker, Ruben, et al.
Published: (2024)
Algorithms for Massive Data -- Lecture Notes
by: Prezza, Nicola
Published: (2023)
by: Prezza, Nicola
Published: (2023)
A survey of BWT variants for string collections
by: Cenzato, Davide, et al.
Published: (2022)
by: Cenzato, Davide, et al.
Published: (2022)
Space-time Trade-offs for the LCP Array of Wheeler DFAs
by: Cotumaccio, Nicola, et al.
Published: (2023)
by: Cotumaccio, Nicola, et al.
Published: (2023)
Improved Circular Dictionary Matching
by: Cotumaccio, Nicola
Published: (2025)
by: Cotumaccio, Nicola
Published: (2025)
BWT for string collections
by: Cenzato, Davide, et al.
Published: (2025)
by: Cenzato, Davide, et al.
Published: (2025)
Suffixient Sets
by: Depuydt, Lore, et al.
Published: (2023)
by: Depuydt, Lore, et al.
Published: (2023)
Incongruity-sensitive access to highly compressed strings
by: Cicalese, Ferdinando, et al.
Published: (2026)
by: Cicalese, Ferdinando, et al.
Published: (2026)
Compressed Dictionary Matching on Run-Length Encoded Strings
by: Bille, Philip, et al.
Published: (2025)
by: Bille, Philip, et al.
Published: (2025)
Compressing Dynamic Fully Indexable Dictionaries in Word-RAM
by: Domingues, Gabriel Marques
Published: (2026)
by: Domingues, Gabriel Marques
Published: (2026)
QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
by: Qi, Yiyan, et al.
Published: (2024)
by: Qi, Yiyan, et al.
Published: (2024)
Approaching 100% Confidence in Stream Summary through ReliableSketch
by: Wu, Yuhan, et al.
Published: (2024)
by: Wu, Yuhan, et al.
Published: (2024)
A Unified Construction of Streaming Sketches via the Lévy-Khintchine Representation Theorem
by: Pettie, Seth, et al.
Published: (2024)
by: Pettie, Seth, et al.
Published: (2024)
On the Streaming Complexity of Expander Decomposition
by: Chen, Yu, et al.
Published: (2024)
by: Chen, Yu, et al.
Published: (2024)
Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
by: Jiang, Cheng, et al.
Published: (2026)
by: Jiang, Cheng, et al.
Published: (2026)
On the Complexity of Computing the Co-lexicographic Width of a Regular Language
by: Becker, Ruben, et al.
Published: (2024)
by: Becker, Ruben, et al.
Published: (2024)
Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
by: Mazziane, Younes Ben, et al.
Published: (2026)
by: Mazziane, Younes Ben, et al.
Published: (2026)
Pattern Masking for Dictionary Matching
by: Charalampopoulos, Panagiotis, et al.
Published: (2020)
by: Charalampopoulos, Panagiotis, et al.
Published: (2020)
Key Compression Limits for $k$-Minimum Value Sketches
by: Dickens, Charlie, et al.
Published: (2024)
by: Dickens, Charlie, et al.
Published: (2024)
On Sketching Trimmed Statistics
by: Lin, Honghao, et al.
Published: (2025)
by: Lin, Honghao, et al.
Published: (2025)
On Sketching Quadratic Forms
by: Andoni, Alexandr, et al.
Published: (2015)
by: Andoni, Alexandr, et al.
Published: (2015)
Average-Distortion Sketching
by: Bao, Yiqiao, et al.
Published: (2024)
by: Bao, Yiqiao, et al.
Published: (2024)
Fast Similarity Sketching
by: Dahlgaard, Søren, et al.
Published: (2017)
by: Dahlgaard, Søren, et al.
Published: (2017)
LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics
by: Hilgendorf, Martin, et al.
Published: (2025)
by: Hilgendorf, Martin, et al.
Published: (2025)
Nearly Optimal Internal Dictionary Matching
by: Chen, Jingbang, et al.
Published: (2023)
by: Chen, Jingbang, et al.
Published: (2023)
Optimal Static Fully Indexable Dictionaries
by: Liang, Jingxun, et al.
Published: (2025)
by: Liang, Jingxun, et al.
Published: (2025)
Optimal-Time Mapping in Run-Length Compressed PBWT
by: Bonizzoni, Paola, et al.
Published: (2026)
by: Bonizzoni, Paola, et al.
Published: (2026)
The Case for External Graph Sketching
by: Bender, Michael A., et al.
Published: (2025)
by: Bender, Michael A., et al.
Published: (2025)
Sketching Cuts in Graphs and Hypergraphs
by: Kogan, Dmitry, et al.
Published: (2014)
by: Kogan, Dmitry, et al.
Published: (2014)
EdgeSketch: Efficient Analysis of Massive Graph Streams
by: Lemiesz, Jakub, et al.
Published: (2026)
by: Lemiesz, Jakub, et al.
Published: (2026)
Approximating Tensor Network Contraction with Sketches
by: Heddes, Mike, et al.
Published: (2026)
by: Heddes, Mike, et al.
Published: (2026)
Fast Sampling Based Sketches for Tensors
by: Swartworth, William, et al.
Published: (2024)
by: Swartworth, William, et al.
Published: (2024)
Optimal Non-Adaptive Cell Probe Dictionaries and Hashing
by: Larsen, Kasper Green, et al.
Published: (2023)
by: Larsen, Kasper Green, et al.
Published: (2023)
Similar Items
-
Random Wheeler Automata
by: Becker, Ruben, et al.
Published: (2023) -
The Trie Measure, Revisited
by: Alanko, Jarno N., et al.
Published: (2025) -
Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025) -
Testing Suffixient Sets
by: Cenzato, Davide, et al.
Published: (2025) -
Suffixient Arrays: a New Efficient Suffix Array Compression Technique
by: Cenzato, Davide, et al.
Published: (2024)