Grigory Yaroslavtsev
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
23
Venues
12
Active years
2009–2024
Best venue rank
A*
Where they publish
Papers
23 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | AAAI | Approximation Scheme for Weighted Metric Clustering via Sherali-Adams. | Dmitrii Avdiukhin, Vaggos Chatziafratis, Konstantin Makarychev, Grigory Yaroslavtsev |
| 2024 | ICLR | Optimal Sample Complexity of Contrastive Learning. | Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev |
| 2023 | AAAI | Tree Learning: Optimal Sample Complexity and Algorithms. | Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza |
| 2023 | IJCAI | HOUDINI: Escaping from Moderately Constrained Saddles. | Dmitrii Avdiukhin, Grigory Yaroslavtsev |
| 2021 | AAAI | Objective-Based Hierarchical Clustering of Deep Embedding Vectors. | Stanislav Naumov, Grigory Yaroslavtsev, Dmitrii Avdiukhin |
| 2020 | AISTATS | Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. | Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian |
| 2020 | AISTATS | "Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack. | Grigory Yaroslavtsev, Samson Zhou, Dmitrii Avdiukhin |
| 2020 | SODA | Fast Fourier Sparsity Testing. | Grigory Yaroslavtsev, Samson Zhou |
| 2019 | AISTATS | Hierarchical Clustering for Euclidean Data. | Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev |
| 2019 | KDD | Adversarially Robust Submodular Maximization under Knapsack Constraints. | Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, Samson Zhou |
| 2018 | ICML | Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under 𝓁 | Grigory Yaroslavtsev, Adithya Vadapalli |
| 2016 | SODA | Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. | Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev |
| 2015 | ICALP | Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. | Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev |
| 2015 | STOC | Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs. | Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev |
| 2014 | PODC | Beyond set disjointness: the communication complexity of finding the intersection. | Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev |
| 2014 | STOC | Parallel algorithms for geometric graph problems. | Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev |
| 2014 | STOC | L | Piotr Berman, Sofya Raskhodnikova, Grigory Yaroslavtsev |
| 2013 | ICDE | Accurate and efficient private release of datacubes and contingency tables. | Grigory Yaroslavtsev, Graham Cormode, Cecilia M. Procopiuc, Divesh Srivastava |
| 2013 | SODA | Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. | Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev |
| 2013 | SODA | Learning pseudo-Boolean | Sofya Raskhodnikova, Grigory Yaroslavtsev |
| 2011 | ICALP | Steiner Transitive-Closure Spanners of Low-Dimensional Posets. | Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev |
| 2011 | ICALP | Improved Approximation for the Directed Spanner Problem. | Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev |
| 2009 | SAT | Finding Efficient Circuits Using SAT-Solvers. | Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev |