( en | de | ru )

 

Disambiguation of "Backurs, Arturs"

Author of the publication

copydeleteadd this publication to your clipboard
Quadratic-Time Hardness of LCS and other Sequence Similarity Measures.

, , and . CoRR, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Backurs, Arturs
add a person with the name Backurs, Arturs
 

Other publications of authors with the same name

Optimal quantum query bounds for almost all Boolean functions., , , and . STACS, volume 20 of LIPIcs, page 446-453. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)On the sum of L1 influences., and . Electron. Colloquium Comput. Complex., (2013)Impossibility Results for Grammar-Compressed Linear Algebra., , , and . NeurIPS, (2020)Faster Kernel Matrix Algebra via Density Estimation., , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 500-510. PMLR, (2021)If the Current Clique Algorithms are Optimal, So is Valiant's Parser., , and . FOCS, page 98-117. IEEE Computer Society, (2015)Efficient Density Evaluation for Smooth Kernels., , , and . FOCS, page 615-626. IEEE Computer Society, (2018)Scalable Fair Clustering., , , , , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 405-413. PMLR, (2019)Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)., and . SIAM J. Comput., 47 (3): 1087-1097 (2018)Search by quantum walks on two-dimensional grid without amplitude amplification, , , , and . CoRR, (2011)Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)., and . CoRR, (2014)