Pages that link to "Item:Q2373728"
From MaRDI portal
The following pages link to The cell probe complexity of succinct data structures (Q2373728):
Displaying 17 items.
- Succinct representations of permutations and functions (Q441860) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- The cycle structure of a Markoff automorphism over finite fields (Q2308824) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Sunflowers: from soil to oil (Q5055337) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- (Q5121915) (← links)
- Coding for Sunflowers (Q5126764) (← links)
- On partial information retrieval: the unconstrained 100 prisoner problem (Q6042076) (← links)
