Bit-probe lower bounds for succinct data structures (Q5172742): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1536414.1536480 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999560384 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:51, 19 March 2024
scientific article; zbMATH DE number 6397955
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bit-probe lower bounds for succinct data structures |
scientific article; zbMATH DE number 6397955 |
Statements
Bit-probe lower bounds for succinct data structures (English)
0 references
4 February 2015
0 references
bit-probe
0 references
cell-probe
0 references
dictionary
0 references
logarithmic form
0 references
lower bound
0 references
membership query
0 references
succinct data structure
0 references
ternary value
0 references
