![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Grigory Yaroslavtsev
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c30]Dmitrii Avdiukhin, Vaggos Chatziafratis, Konstantin Makarychev, Grigory Yaroslavtsev:
Approximation Scheme for Weighted Metric Clustering via Sherali-Adams. AAAI 2024: 7926-7934 - [c29]Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev:
Optimal Sample Complexity of Contrastive Learning. ICLR 2024 - 2023
- [c28]Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza:
Tree Learning: Optimal Sample Complexity and Algorithms. AAAI 2023: 6701-6708 - [c27]Dmitrii Avdiukhin, Grigory Yaroslavtsev:
HOUDINI: Escaping from Moderately Constrained Saddles. IJCAI 2023: 3442-3450 - [i28]Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza:
Tree Learning: Optimal Algorithms and Sample Complexity. CoRR abs/2302.04492 (2023) - [i27]Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev:
Optimal Sample Complexity of Contrastive Learning. CoRR abs/2312.00379 (2023) - 2022
- [i26]Dmitrii Avdiukhin, Grigory Yaroslavtsev:
HOUDINI: Escaping from Moderately Constrained Saddles. CoRR abs/2205.13753 (2022) - 2021
- [c26]Stanislav Naumov, Grigory Yaroslavtsev, Dmitrii Avdiukhin:
Objective-Based Hierarchical Clustering of Deep Embedding Vectors. AAAI 2021: 9055-9063 - [c25]Dmitrii Avdiukhin, Grigory Yaroslavtsev:
Escaping Saddle Points with Compressed SGD. NeurIPS 2021: 10273-10284 - [i25]Dmitrii Avdiukhin, Grigory Yaroslavtsev:
Escaping Saddle Points with Compressed SGD. CoRR abs/2105.10090 (2021) - 2020
- [c24]Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. AISTATS 2020: 3121-3132 - [c23]Grigory Yaroslavtsev, Samson Zhou, Dmitrii Avdiukhin:
"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack. AISTATS 2020: 3263-3274 - [c22]Grigory Yaroslavtsev, Samson Zhou:
Fast Fourier Sparsity Testing. SOSA 2020: 57-68 - [i24]Stanislav Naumov, Grigory Yaroslavtsev, Dmitrii Avdiukhin:
Objective-Based Hierarchical Clustering of Deep Embedding Vectors. CoRR abs/2012.08466 (2020)
2010 – 2019
- 2019
- [j8]Dmitrii Avdiukhin, Sergey Pupyrev, Grigory Yaroslavtsev:
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent. Proc. VLDB Endow. 12(8): 906-919 (2019) - [c21]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev:
Hierarchical Clustering for Euclidean Data. AISTATS 2019: 2721-2730 - [c20]Grigory Yaroslavtsev, Samson Zhou:
Approximate F2-Sketching of Valuation Functions. APPROX-RANDOM 2019: 69:1-69:21 - [c19]Kaave Hosseini
, Shachar Lovett, Grigory Yaroslavtsev:
Optimality of Linear Sketching Under Modular Updates. CCC 2019: 13:1-13:17 - [c18]Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, Samson Zhou:
Adversarially Robust Submodular Maximization under Knapsack Constraints. KDD 2019: 148-156 - [i23]Dmitrii Avdiukhin, Sergey Pupyrev, Grigory Yaroslavtsev:
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent. CoRR abs/1902.03522 (2019) - [i22]Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, Samson Zhou:
Adversarially Robust Submodular Maximization under Knapsack Constraints. CoRR abs/1905.02367 (2019) - [i21]Grigory Yaroslavtsev, Samson Zhou:
Approximate F2-Sketching of Valuation Functions. CoRR abs/1907.00524 (2019) - [i20]Dmitrii Avdiukhin, Grigory Yaroslavtsev, Samson Zhou:
"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack. CoRR abs/1910.05646 (2019) - [i19]Grigory Yaroslavtsev, Samson Zhou:
Fast Fourier Sparsity Testing. CoRR abs/1910.05686 (2019) - [i18]Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto
, Euiwoong Lee, Mohammad Mahdian, Konstantin Makarychev, Grigory Yaroslavtsev:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. CoRR abs/1912.06983 (2019) - 2018
- [c17]Sampath Kannan, Elchanan Mossel, Swagato Sanyal, Grigory Yaroslavtsev:
Linear Sketching over F_2. CCC 2018: 8:1-8:37 - [c16]Grigory Yaroslavtsev, Adithya Vadapalli:
Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under 𝓁p Distances. ICML 2018: 5596-5605 - [i17]Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev:
Optimality of Linear Sketching under Modular Updates. CoRR abs/1809.09063 (2018) - [i16]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev:
Hierarchical Clustering for Euclidean Data. CoRR abs/1812.10582 (2018) - [i15]Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev:
Optimality of Linear Sketching under Modular Updates. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i14]Grigory Yaroslavtsev, Adithya Vadapalli:
Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under $\ell_p$-Distances. CoRR abs/1710.01431 (2017) - 2016
- [j7]Joshua Brody, Amit Chakrabarti
, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Certifying Equality With Limited Interaction. Algorithmica 76(3): 796-845 (2016) - [j6]Michael J. Kearns, Aaron Roth
, Zhiwei Steven Wu, Grigory Yaroslavtsev:
Private algorithms for the protected in social network search. Proc. Natl. Acad. Sci. USA 113(4): 913-918 (2016) - [c15]Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev:
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. SODA 2016: 1345-1364 - [i13]Sampath Kannan, Elchanan Mossel, Grigory Yaroslavtsev:
Linear Sketching over $\mathbb F_2$. CoRR abs/1611.01879 (2016) - [i12]Elchanan Mossel, Sampath Kannan, Grigory Yaroslavtsev:
Linear Sketching over 𝔽2. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c14]Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev:
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. ICALP (1) 2015: 960-972 - [c13]Shuchi Chawla, Konstantin Makarychev, Tselil Schramm
, Grigory Yaroslavtsev:
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs. STOC 2015: 219-228 - [i11]Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev:
Tight Bounds for Linear Sketches of Approximate Matchings. CoRR abs/1505.01467 (2015) - [i10]Michael J. Kearns, Aaron Roth, Zhiwei Steven Wu, Grigory Yaroslavtsev:
Privacy for the Protected (Only). CoRR abs/1506.00242 (2015) - [i9]Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev:
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j5]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner transitive-closure spanners of low-dimensional posets. Comb. 34(3): 255-277 (2014) - [j4]Vishesh Karwa, Sofya Raskhodnikova, Adam D. Smith, Grigory Yaroslavtsev:
Private Analysis of Graph Structure. ACM Trans. Database Syst. 39(3): 22:1-22:33 (2014) - [c12]Joshua Brody, Amit Chakrabarti
, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Certifying Equality With Limited Interaction. APPROX-RANDOM 2014: 545-581 - [c11]Eric Blais, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Lower Bounds for Testing Properties of Functions over Hypergrid Domains. CCC 2014: 309-320 - [c10]Joshua Brody, Amit Chakrabarti
, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Beyond set disjointness: the communication complexity of finding the intersection. PODC 2014: 106-113 - [c9]Piotr Berman, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Lp-testing. STOC 2014: 164-173 - [c8]Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak
, Grigory Yaroslavtsev:
Parallel algorithms for geometric graph problems. STOC 2014: 574-583 - [i8]Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev:
Parallel Algorithms for Geometric Graph Problems. CoRR abs/1401.0042 (2014) - [i7]Nikhil R. Devanur, Konstantin Makarychev, Debmalya Panigrahi, Grigory Yaroslavtsev:
Online Algorithms for Machine Minimization. CoRR abs/1403.0486 (2014) - [i6]Grigory Yaroslavtsev:
Going for Speed: Sublinear Algorithms for Dense r-CSPs. CoRR abs/1407.7887 (2014) - [i5]Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev:
Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs. CoRR abs/1412.0681 (2014) - 2013
- [j3]Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Approximation algorithms for spanner problems and Directed Steiner Forest. Inf. Comput. 222: 93-107 (2013) - [c7]Grigory Yaroslavtsev, Graham Cormode
, Cecilia M. Procopiuc, Divesh Srivastava:
Accurate and efficient private release of datacubes and contingency tables. ICDE 2013: 745-756 - [c6]Sofya Raskhodnikova, Grigory Yaroslavtsev:
Learning pseudo-Boolean k-DNF and submodular functions. SODA 2013: 1356-1368 - [c5]Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev:
Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. SODA 2013: 1738-1756 - [i4]Eric Blais, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Lower Bounds for Testing Properties of Functions on Hypergrid Domains. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c4]Piotr Berman, Grigory Yaroslavtsev:
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs. APPROX-RANDOM 2012: 50-60 - [i3]Graham Cormode, Cecilia M. Procopiuc, Divesh Srivastava, Grigory Yaroslavtsev:
Accurate and Efficient Private Release of Datacubes and Contingency Tables. CoRR abs/1207.6096 (2012) - [i2]Sofya Raskhodnikova, Grigory Yaroslavtsev:
Learning pseudo-Boolean k-DNF and Submodular Functions. CoRR abs/1208.2294 (2012) - 2011
- [j2]Vishesh Karwa, Sofya Raskhodnikova, Adam D. Smith, Grigory Yaroslavtsev:
Private Analysis of Graph Structure. Proc. VLDB Endow. 4(11): 1146-1157 (2011) - [c3]Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Improved Approximation for the Directed Spanner Problem. ICALP (1) 2011: 1-12 - [c2]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner Transitive-Closure Spanners of Low-Dimensional Posets. ICALP (1) 2011: 760-772 - 2010
- [j1]Evgeny Demenkov, Arist Kojevnikov, Alexander S. Kulikov
, Grigory Yaroslavtsev:
New upper bounds on the Boolean circuit complexity of symmetric functions. Inf. Process. Lett. 110(7): 264-267 (2010) - [i1]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner Transitive-Closure Spanners of d-Dimensional Posets. CoRR abs/1011.6100 (2010)
2000 – 2009
- 2009
- [c1]Arist Kojevnikov, Alexander S. Kulikov
, Grigory Yaroslavtsev:
Finding Efficient Circuits Using SAT-Solvers. SAT 2009: 32-44
Coauthor Index
![](https://dblp.dagstuhl.de/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-08-21 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint