For matrix multiplication ⟨d,n,d⟩ the round complexity is Õ(d^{4/3}); for ⟨n,d,n⟩ it is Θ(d √n) when d ≤ √n and O(d^{2/3} n^{2/3}) when d ≥ √n.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming , series =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.
citing papers explorer
-
Rectangular Matrix Multiplication in the Low-Bandwidth Model
For matrix multiplication ⟨d,n,d⟩ the round complexity is Õ(d^{4/3}); for ⟨n,d,n⟩ it is Θ(d √n) when d ≤ √n and O(d^{2/3} n^{2/3}) when d ≥ √n.
-
Concurrent Splay-Based Tree
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.