Artūrs Bačkurs

From MaRDI portal
Person:2843228

Available identifiers

zbMath Open backurs.artursWikidataQ102994076 ScholiaQ102994076MaRDI QIDQ2843228

List of research outcomes

PublicationDate of PublicationType
Submodular clustering in low dimensions2023-11-02Paper
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities2021-08-06Paper
Fast Modular Subset Sum using Linear Sketching2019-10-15Paper
Towards tight approximation bounds for graph diameter and eccentricities2019-08-22Paper
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser2018-12-19Paper
Subtree Isomorphism Revisited2018-11-13Paper
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching2018-07-16Paper
Subtree Isomorphism Revisited2018-07-16Paper
Better Approximations for Tree Sparsity in Nearly-Linear Time2018-07-16Paper
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)2018-07-04Paper
https://portal.mardi4nfdi.de/entity/Q46380592018-05-03Paper
Better embeddings for planar Earth-Mover Distance over sparse sets2018-04-23Paper
Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces2018-04-19Paper
Tight Hardness Results for Maximum Weight Rectangles2017-12-19Paper
Optimal quantum query bounds for almost all Boolean functions.2017-01-30Paper
Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification2015-12-03Paper
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)2015-08-21Paper
Grover’s Algorithm with Errors2015-08-05Paper
Worst Case Analysis of Non-local Games2014-11-04Paper
Quantum Strategies Are Better Than Classical in Almost Any XOR Game2013-08-12Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Artūrs Bačkurs