![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Arturs Backurs
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c40]Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski:
Efficiently Computing Similarities to Private Datasets. ICLR 2024 - [c39]Fan Wu, Huseyin A. Inan, Arturs Backurs, Varun Chandrasekaran, Janardhan Kulkarni, Robert Sim:
Privately Aligning Language Models with Reinforcement Learning. ICLR 2024 - [c38]Chulin Xie, Zinan Lin, Arturs Backurs, Sivakanth Gopi, Da Yu, Huseyin A. Inan, Harsha Nori, Haotian Jiang, Huishuai Zhang, Yin Tat Lee, Bo Li, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 2: Text. ICML 2024 - [i30]Chulin Xie, Zinan Lin, Arturs Backurs, Sivakanth Gopi, Da Yu, Huseyin A. Inan, Harsha Nori, Haotian Jiang, Huishuai Zhang, Yin Tat Lee, Bo Li, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 2: Text. CoRR abs/2403.01749 (2024) - [i29]Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski:
Efficiently Computing Similarities to Private Datasets. CoRR abs/2403.08917 (2024) - 2023
- [c37]Jiyan He, Xuechen Li, Da Yu, Huishuai Zhang, Janardhan Kulkarni, Yin Tat Lee, Arturs Backurs, Nenghai Yu, Jiang Bian:
Exploring the Limits of Differentially Private Deep Learning with Group-wise Clipping. ICLR 2023 - [i28]Fan Wu, Huseyin A. Inan, Arturs Backurs, Varun Chandrasekaran, Janardhan Kulkarni, Robert Sim:
Privately Aligning Language Models with Reinforcement Learning. CoRR abs/2310.16960 (2023) - 2022
- [c36]Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang:
Differentially Private Fine-tuning of Language Models. ICLR 2022 - [c35]Fatemehsadat Mireshghallah, Arturs Backurs, Huseyin A. Inan, Lukas Wutschitz, Janardhan Kulkarni:
Differentially Private Model Compression. NeurIPS 2022 - [i27]Fatemehsadat Mireshghallah, Arturs Backurs, Huseyin A. Inan, Lukas Wutschitz, Janardhan Kulkarni:
Differentially Private Model Compression. CoRR abs/2206.01838 (2022) - [i26]Yi Zhang, Arturs Backurs, Sébastien Bubeck, Ronen Eldan, Suriya Gunasekar, Tal Wagner:
Unveiling Transformers with LEGO: a synthetic reasoning task. CoRR abs/2206.04301 (2022) - [i25]Jiyan He, Xuechen Li, Da Yu, Huishuai Zhang, Janardhan Kulkarni, Yin Tat Lee, Arturs Backurs, Nenghai Yu, Jiang Bian:
Exploring the Limits of Differentially Private Deep Learning with Group-wise Clipping. CoRR abs/2212.01539 (2022) - 2021
- [j4]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein:
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities. SIAM J. Comput. 50(4): 1155-1199 (2021) - [c34]Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev:
Two-Sided Kirszbraun Theorem. SoCG 2021: 13:1-13:14 - [c33]Sam Wiseman
, Arturs Backurs, Karl Stratos:
Data-to-text Generation by Splicing Together Nearest Neighbors. EMNLP (1) 2021: 4283-4299 - [c32]Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner:
Faster Kernel Matrix Algebra via Density Estimation. ICML 2021: 500-510 - [c31]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. SOSA 2021: 57-67 - [i24]Sam Wiseman, Arturs Backurs, Karl Stratos:
Generating (Formulaic) Text by Splicing Together Nearest Neighbors. CoRR abs/2101.08248 (2021) - [i23]Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner:
Faster Kernel Matrix Algebra via Density Estimation. CoRR abs/2102.08341 (2021) - [i22]Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang:
Differentially Private Fine-tuning of Language Models. CoRR abs/2110.06500 (2021) - 2020
- [c30]Arturs Backurs, Avrim Blum, Neha Gupta:
Active Local Learning. COLT 2020: 363-390 - [c29]Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Scalable Nearest Neighbor Search for Optimal Transport. ICML 2020: 497-506 - [c28]Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann:
Impossibility Results for Grammar-Compressed Linear Algebra. NeurIPS 2020 - [c27]Arturs Backurs, Sariel Har-Peled
:
Submodular Clustering in Low Dimensions. SWAT 2020: 8:1-8:14 - [i21]Arturs Backurs, Sariel Har-Peled:
Submodular Clustering in Low Dimensions. CoRR abs/2004.05494 (2020) - [i20]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. CoRR abs/2008.10577 (2020) - [i19]Arturs Backurs, Avrim Blum, Neha Gupta:
Active Local Learning. CoRR abs/2008.13374 (2020) - [i18]Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann:
Impossibility Results for Grammar-Compressed Linear Algebra. CoRR abs/2010.14181 (2020)
2010 – 2019
- 2019
- [c26]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. ICML 2019: 405-413 - [c25]Arturs Backurs, Piotr Indyk, Tal Wagner:
Space and Time Efficient Kernel Density Estimation in High Dimensions. NeurIPS 2019: 15773-15782 - [c24]Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos
, Hongxun Wu:
Fast Modular Subset Sum using Linear Sketching. SODA 2019: 58-69 - [i17]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. CoRR abs/1902.03519 (2019) - 2018
- [b1]Arturs Backurs:
Below P vs NP: fine-grained hardness for big data problems. Massachusetts Institute of Technology, Cambridge, USA, 2018 - [j3]Arturs Backurs, Piotr Indyk:
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False). SIAM J. Comput. 47(3): 1087-1097 (2018) - [j2]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser. SIAM J. Comput. 47(6): 2527-2555 (2018) - [j1]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. ACM Trans. Algorithms 14(3): 27:1-27:23 (2018) - [c23]Arturs Backurs, Moses Charikar
, Piotr Indyk, Paris Siminelakis:
Efficient Density Evaluation for Smooth Kernels. FOCS 2018: 615-626 - [c22]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein:
Towards tight approximation bounds for graph diameter and eccentricities. STOC 2018: 267-280 - [i16]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) - [i15]Kyriakos Axiotis, Arturs Backurs, Christos Tzamos:
Fast Modular Subset Sum using Linear Sketching. CoRR abs/1807.04825 (2018) - [i14]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
:
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities. CoRR abs/1808.08494 (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: 4308-4318 - [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. CCC 2014: 132-143 - [c6]Arturs Backurs, Piotr Indyk:
Better embeddings for planar Earth-Mover Distance over sparse sets. SoCG 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]Arturs Backurs, Mohammad Bavarian:
On the sum of $L1$ influences. CoRR abs/1302.4625 (2013) - [i3]Arturs Backurs, Mohammad Bavarian:
On the sum of L1 influences. Electron. Colloquium Comput. Complex. TR13 (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
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint