The following pages link to (Q2913804):
Displayed 13 items.
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- Data structures for categorical path counting queries (Q2089697) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- Mind the gap! (Q2414857) (← links)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
- 3D Rectangulations and Geometric Matrix Multiplication (Q2942614) (← links)
- Quantum Complexity of Boolean Matrix Multiplication and Related Problems (Q2944887) (← links)
- (Q3304119) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Internal masked prefix sums and its connection to fully internal measurement queries (Q6111587) (← links)