Pages that link to "Item:Q2921648"
From MaRDI portal
The following pages link to Lower bounds on the size of selection and rank indexes (Q2921648):
Displaying 9 items.
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Integer representation and counting in the bit probe model (Q848941) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Supporting random access in files of variable length records (Q1802061) (← links)
- Rank and select operations on a word (Q2234779) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Optimal lower bounds for rank and select indexes (Q2465065) (← links)
- Integer Representation and Counting in the Bit Probe Model (Q5387741) (← links)