pith. sign in

Arturs Backurs

Identifiers

  • name variant Arturs Backurs 0.60 · backfill

Papers (15)

  1. Scalable Fair Clustering cs.DS · 2019 · author #1
  2. Fast Modular Subset Sum using Linear Sketching cs.DS · 2018 · author #2
  3. Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve cs.CC · 2018 · author #2
  4. On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks cs.CC · 2017 · author #1
  5. Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms cs.CC · 2016 · author #1
  6. Tight Hardness Results for Maximum Weight Rectangles cs.DS · 2016 · author #1
  7. Which Regular Expression Patterns are Hard to Match? cs.CC · 2015 · author #1
  8. Subtree Isomorphism Revisited cs.CC · 2015 · author #2
  9. If the Current Clique Algorithms are Optimal, so is Valiant's Parser cs.CC · 2015 · author #2
  10. Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching cs.DS · 2015 · author #1
  11. Quadratic-Time Hardness of LCS and other Sequence Similarity Measures cs.CC · 2015 · author #2
  12. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) cs.CC · 2014 · author #1
  13. Search by quantum walks on two-dimensional grid without amplitude amplification quant-ph · 2011 · author #2
  14. Quantum strategies are better than classical in almost any XOR game quant-ph · 2011 · author #2
  15. Worst case analysis of non-local games quant-ph · 2011 · author #2

Mentions

  • 1112.3337 #2 · backfill · confidence 0.70 Arturs Backurs
  • 1112.3330 #2 · backfill · confidence 0.70 Arturs Backurs
  • 1112.2856 #2 · backfill · confidence 0.70 Arturs Backurs

Frequent Coauthors