( en | de | ru )

 

Disambiguation of "Backurs, Arturs"

Author of the publication

copydeleteadd this publication to your clipboard
On the sum of $L1$ influences

, and . CoRR, (2013)

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

Faster Kernel Matrix Algebra via Density Estimation., , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 500-510. PMLR, (2021)On the sum of $L1$ influences, and . CoRR, (2013)Impossibility Results for Grammar-Compressed Linear Algebra., , , and . NeurIPS, (2020)Efficient Density Evaluation for Smooth Kernels., , , and . FOCS, page 615-626. IEEE Computer Society, (2018)If the Current Clique Algorithms are Optimal, So is Valiant's Parser., , and . FOCS, page 98-117. IEEE Computer Society, (2015)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)Subtree Isomorphism Revisited., , , , and . ACM Trans. Algorithms, 14 (3): 27:1-27:23 (2018)Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification., , , , and . TQC, volume 7582 of Lecture Notes in Computer Science, page 87-97. Springer, (2012)Which Regular Expression Patterns are Hard to Match?, and . CoRR, (2015)Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)., and . STOC, page 51-58. ACM, (2015)