arXiv (All)
open access
Achieving Optimal Redundancy for Small Dynamic Rank/Select Dictionaries
In this paper, we study the number of bits required to construct a dynamic dictionary with optimal time for $\texttt{rank}/\texttt{select}$ operations. Using the standard (multiplication) Word-RAM model with $w$-bit words, we construct a data-structure for a dynamic $\texttt{rank}/\texttt{select}$ d
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Extensions to the YANG Data Model for Access Control Lists (ACLs)#131657
- Online Multi-Level Aggregation with Per-Batch Maximum Delay#999842
- The Power of Two-Choice Linear Probing#1155623
- Operations Model for Router Keying#399074
- Efficient and Robust Lock-Free Multi-Word Compare-and-Swap via Contention-Aware Helping#346482
Record · ID 1157124
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive