Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Timothy M. Chan. More Logarithmic-factor Speedups for 3SUM, (median, +)-convolution, and Some Geometric 3SUM-hard Problems. ACM Transactions on Algorithms, 16(1), 2020. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard ProblemsTimothy M. Chan. soda 2018: 881-897 [doi] Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OVTimothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu. stoc 2022: 1501-1514 [doi]
The following publications are possibly variants of this publication: