Pages that link to "Item:Q472491"
From MaRDI portal
The following pages link to Optimal indexes for sparse bit vectors (Q472491):
Displaying 14 items.
- Entropy-bounded representation of point grids (Q390358) (← links)
- High-order entropy compressed bit vectors with rank/select (Q1736624) (← links)
- Approximate query processing over static sets and sliding windows (Q1981762) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Rank and select operations on a word (Q2234779) (← links)
- Canonical density control (Q2380023) (← links)
- Optimal lower bounds for rank and select indexes (Q2465065) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Lower bounds on the size of selection and rank indexes (Q2921648) (← links)
- Low-weight halfspaces for sparse boolean vectors (Q2986855) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- Index Vector Elimination – Making Index Vectors Affordable (Q3612949) (← links)
- Approximate query processing over static sets and sliding windows (Q5091046) (← links)
- Adaptive succinctness (Q6536273) (← links)