scientific article; zbMATH DE number 4155862
From MaRDI portal
Publication:3484345
Recommendations
- scientific article; zbMATH DE number 4062630
- Optimal implicit dictionaries over unbounded universes
- New Tight Bounds on Uniquely Represented Dictionaries
- A complete characterization of optimal dictionaries for least squares representation
- On Greedy Algorithms with bounded cumulative coherence
- On some deterministic dictionaries supporting sparsity
- On greedy algorithms for dictionaries with bounded cumulative coherence
- On the Hardness of Finding Optimal Multiple Preset Dictionaries
- Existence of the best \(n\)-term approximants for structured dictionaries
- Optimal dictionary for least squares representation
Cited in
(12)- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- A dynamic dictionary for priced information with application
- On the Complexity of a Game Related to the Dictionary Problem
- scientific article; zbMATH DE number 4062630 (Why is no real title available?)
- Cross-referenced dictionaries and the limits of write optimization
- scientific article; zbMATH DE number 742984 (Why is no real title available?)
- New Tight Bounds on Uniquely Represented Dictionaries
- Dynamic Trees with Almost-Optimal Access Cost
- Binary search trees: How low can you go?
- Fast updating of well-balanced trees
- On some deterministic dictionaries supporting sparsity
- Bounded ordered dictionaries in O(log log N) time and O(n) space
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484345)
