The following pages link to (Q4234056):
Displayed 14 items.
- A discrepancy lower bound for information complexity (Q343867) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- Protocols for asymmetric communication channels (Q1604209) (← links)
- On the difficulty of range searching. (Q2482904) (← links)
- Pointer chasing via triangular discrimination (Q4993101) (← links)
- (Q5002646) (← links)
- Predecessor queries in dynamic integer sets (Q5047156) (← links)
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching (Q5054813) (← links)
- On the difficulty of range searching (Q5057458) (← links)
- Tables should be sorted (on random access machines) (Q5057459) (← links)
- (Q5116481) (← links)
- Derandomization for sliding window algorithms with strict correctness (Q5918353) (← links)
- Fully Dynamic Transitive Closure in plane dags with one source and one sink (Q6102301) (← links)