Pages that link to "Item:Q2475409"
From MaRDI portal
The following pages link to Lower bounds for predecessor searching in the cell probe model (Q2475409):
Displaying 8 items.
- Linear algebraic methods in communication complexity (Q417541) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Pointer chasing via triangular discrimination (Q4993101) (← links)
- (Q5121915) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)
- Predecessor on the Ultra-Wide Word RAM (Q6492089) (← links)
