( en | de | ru )

 

Disambiguation of "Backurs, Arturs"

Author of the publication

copydeleteadd this publication to your clipboard
If the Current Clique Algorithms are Optimal, So is Valiant's Parser.

, , and . FOCS, page 98-117. IEEE Computer Society, (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

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)Impossibility Results for Grammar-Compressed Linear Algebra., , , and . NeurIPS, (2020)On the sum of $L1$ influences, and . CoRR, (2013)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)Which Regular Expression Patterns are Hard to Match?, and . CoRR, (2015)Active Local Learning., , and . COLT, volume 125 of Proceedings of Machine Learning Research, page 363-390. PMLR, (2020)Differentially Private Fine-tuning of Language Models., , , , , , , , , and 2 other author(s). ICLR, OpenReview.net, (2022)Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching., , , and . SODA, page 318-337. SIAM, (2016)