Publisher
Springer International Publishing
Reference32 articles.
1. Abboud, A., Backurs, A., Vassilevska Williams, V.: Tight hardness results for LCS and other sequence similarity measures. In: FOCS, pp. 59–78. IEEE Computer Society (2015)
2. Abboud, A., Bringmann, K.: Tighter connections between formula-SAT and shaving logs. In: ICALP. LIPIcs, vol. 107, pp. 8:1–8:18 (2018)
3. Abboud, A., Vassilevska Williams, V.: Popular conjectures imply strong lower bounds for dynamic problems. In: FOCS, pp. 434–443. IEEE Computer Society (2014)
4. Abboud, A., Williams, R.R., Yu, H.: More applications of the polynomial method to algorithm design. In: SODA, pp. 218–230. SIAM (2015)
5. Agarwal, P.K., Avraham, R.B., Kaplan, H., Sharir, M.: Computing the discrete Fréchet distance in subquadratic time. SIAM J. Comput. 43(2), 429–449 (2014)