Arturs Backurs
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
- [i14]Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann:
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve. CoRR abs/1803.00796 (2018) - 2017
- [c21]Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann:
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve. FOCS 2017: 192-203 - [c20]Arturs Backurs, Christos Tzamos:
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. ICML 2017: 311-321 - [c19]Amir Abboud, Arturs Backurs:
Towards Hardness of Approximation for Polynomial Time Problems. ITCS 2017: 11:1-11:26 - [c18]Arturs Backurs, Piotr Indyk, Ludwig Schmidt:
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks. NIPS 2017: 4311-4321 - [c17]Arturs Backurs, Piotr Indyk, Ludwig Schmidt:
Better Approximations for Tree Sparsity in Nearly-Linear Time. SODA 2017: 2215-2229 - [i13]Arturs Backurs, Piotr Indyk, Ludwig Schmidt:
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks. CoRR abs/1704.02958 (2017) - 2016
- [c16]Arturs Backurs, Anastasios Sidiropoulos:
Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces. APPROX-RANDOM 2016: 1:1-1:15 - [c15]Arturs Backurs, Piotr Indyk:
Which Regular Expression Patterns Are Hard to Match? FOCS 2016: 457-466 - [c14]Arturs Backurs, Nishanth Dikkala, Christos Tzamos:
Tight Hardness Results for Maximum Weight Rectangles. ICALP 2016: 81:1-81:13 - [c13]Arturs Backurs, Krzysztof Onak:
Fast Algorithms for Parsing Sequences of Parentheses with Few Errors. PODS 2016: 477-488 - [c12]Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff:
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching. SODA 2016: 318-337 - [c11]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. SODA 2016: 1256-1271 - [i12]Arturs Backurs, Nishanth Dikkala, Christos Tzamos:
Tight Hardness Results for Maximum Weight Rectangles. CoRR abs/1602.05837 (2016) - [i11]Arturs Backurs, Christos Tzamos:
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. CoRR abs/1607.04229 (2016) - 2015
- [c10]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
Tight Hardness Results for LCS and Other Sequence Similarity Measures. FOCS 2015: 59-78 - [c9]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
If the Current Clique Algorithms are Optimal, So is Valiant's Parser. FOCS 2015: 98-117 - [c8]Arturs Backurs, Piotr Indyk:
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). STOC 2015: 51-58 - [i10]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
Quadratic-Time Hardness of LCS and other Sequence Similarity Measures. CoRR abs/1501.07053 (2015) - [i9]Arturs Backurs, Piotr Indyk, Eric Price, Ilya P. Razenshteyn, David P. Woodruff:
Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. CoRR abs/1504.01076 (2015) - [i8]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
If the Current Clique Algorithms are Optimal, so is Valiant's Parser. CoRR abs/1504.01431 (2015) - [i7]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. CoRR abs/1510.04622 (2015) - [i6]Arturs Backurs, Piotr Indyk:
Which Regular Expression Patterns are Hard to Match? CoRR abs/1511.07070 (2015) - 2014
- [c7]Arturs Backurs, Mohammad Bavarian:
On the Sum of L1 Influences. IEEE Conference on Computational Complexity 2014: 132-143 - [c6]Arturs Backurs, Piotr Indyk:
Better embeddings for planar Earth-Mover Distance over sparse sets. Symposium on Computational Geometry 2014: 280 - [i5]Arturs Backurs, Piotr Indyk:
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). CoRR abs/1412.0348 (2014) - 2013
- [c5]Andris Ambainis, Arturs Backurs, Kaspars Balodis, Agnis Skuskovniks, Juris Smotrovs, Madars Virza:
Worst Case Analysis of Non-local Games. SOFSEM 2013: 121-132 - [c4]Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf:
Optimal quantum query bounds for almost all Boolean functions. STACS 2013: 446-453 - [i4]
- [i3]Arturs Backurs, Mohammad Bavarian:
On the sum of L1 influences. Electronic Colloquium on Computational Complexity (ECCC) 20: 39 (2013) - 2012
- [c3]Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitrijs Kravcenko, Raitis Ozols, Juris Smotrovs, Madars Virza:
Quantum Strategies Are Better Than Classical in Almost Any XOR Game. ICALP (1) 2012: 25-37 - [c2]Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Alexander Rivosh:
Grover's Algorithm with Errors. MEMICS 2012: 180-189 - [c1]Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols, Alexander Rivosh:
Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification. TQC 2012: 87-97 - 2011
- [i2]Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitry Kravchenko, Raitis Ozols, Juris Smotrovs, Madars Virza:
Quantum strategies are better than classical in almost any XOR game. CoRR abs/1112.3330 (2011) - [i1]Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols, Alexander Rivosh:
Search by quantum walks on two-dimensional grid without amplitude amplification. CoRR abs/1112.3337 (2011)
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-11 19:38 CEST by the dblp team