scientific article
From MaRDI portal
Publication:2921648
zbMath1297.68085MaRDI QIDQ2921648
Publication date: 13 October 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)
Related Items (7)
Succinct indices for path minimum, with applications ⋮ Integer representation and counting in the bit probe model ⋮ Optimal indexes for sparse bit vectors ⋮ Integer Representation and Counting in the Bit Probe Model ⋮ Counting suffix arrays and strings ⋮ Optimal lower bounds for rank and select indexes ⋮ Succinct data structures for searchable partial sums with optimal worst-case performance
This page was built for publication:
