Uniform algorithms for deterministic construction of efficient dictionaries
From MaRDI portal
Recommendations
Cited in
(16)- Dynamic construction of an antidictionary with linear complexity
- A trade-off for worst-case efficient dictionaries
- A new trade-off for deterministic dictionaries
- Deterministic dictionaries
- Making deterministic signatures quickly
- Making deterministic signatures quickly
- Longest common extensions in trees
- Longest common extensions in trees
- Constructing Efficient Dictionaries in Close to Sorting Time
- Dictionary Machine with Improved Performance
- scientific article; zbMATH DE number 1303598 (Why is no real title available?)
- scientific article; zbMATH DE number 1305431 (Why is no real title available?)
- New Tight Bounds on Uniquely Represented Dictionaries
- scientific article; zbMATH DE number 1445338 (Why is no real title available?)
- Uniform deterministic dictionaries
- On some deterministic dictionaries supporting sparsity
This page was built for publication: Uniform algorithms for deterministic construction of efficient dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464617)