scientific article; zbMATH DE number 6297694
From MaRDI portal
Publication:5417611
zbMath1288.68051MaRDI QIDQ5417611
Mihai Pǎtraşcu, Emanuele Viola
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (13)
Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Nearly Optimal Static Las Vegas Succinct Dictionary ⋮ Entropy-bounded representation of point grids ⋮ Succinct representations of permutations and functions ⋮ Wavelet trees for all ⋮ Optimal indexes for sparse bit vectors ⋮ Improved Time and Space Bounds for Dynamic Range Mode ⋮ A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Sampling Lower Bounds: Boolean Average-Case and Permutations ⋮ Everywhere-Tight Information Cost Tradeoffs for Augmented Index ⋮ Random Access to High-Order Entropy Compressed Text ⋮ Adaptive succinctness
This page was built for publication:
