Bit-Probe Lower Bounds for Succinct Data Structures (Q4910576): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998068971 / rank | |||
Normal rank | |||
Latest revision as of 01:16, 20 March 2024
scientific article; zbMATH DE number 6146317
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bit-Probe Lower Bounds for Succinct Data Structures |
scientific article; zbMATH DE number 6146317 |
Statements
Bit-Probe Lower Bounds for Succinct Data Structures (English)
0 references
19 March 2013
0 references
succinct data structure
0 references
nonbinary array
0 references
membership
0 references
lower bound
0 references
bit-probe
0 references
cell-probe
0 references
logarithmic forms
0 references
