Pages that link to "Item:Q2817656"
From MaRDI portal
The following pages link to Lower bounds for union-split-find related problems on random access machines (Q2817656):
Displaying 27 items.
- On the cell probe complexity of polynomial evaluation (Q673647) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- ANN for time series under the Fréchet distance (Q832871) (← links)
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- On data structures and asymmetric communication complexity (Q1273860) (← links)
- Lower bounds for dynamic data structures on algebraic RAMs (Q1348938) (← links)
- Protocols for asymmetric communication channels (Q1604209) (← links)
- Improved fast integer sorting in linear space (Q1854461) (← links)
- Lower bounds for dynamic algebraic problems (Q1854488) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- Dynamic nested brackets (Q1882928) (← links)
- Lower bounds for the union-find and the split-find problem on pointer machines (Q1915507) (← links)
- Optimal collapsing protocol for multiparty pointer jumping (Q2441545) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- On the difficulty of range searching. (Q2482904) (← links)
- A Lower Bound on the Complexity of the Union-Split-Find Problem (Q3832045) (← links)
- Predecessor queries in dynamic integer sets (Q5047156) (← links)
- Sorting and searching revisted (Q5054812) (← links)
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching (Q5054813) (← links)
- Neighbours on a grid (Q5054822) (← links)
- Dynamic algorithms for the Dyck languages (Q5057425) (← links)
- On the difficulty of range searching (Q5057458) (← links)
- (Q5121915) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)
- A generalization of a lower bound technique due to Fredman and Saks (Q5943826) (← links)
- Fully Dynamic Transitive Closure in plane dags with one source and one sink (Q6102301) (← links)
- Predecessor on the Ultra-Wide Word RAM (Q6492089) (← links)
