متابعة
Grigory Yaroslavtsev
Grigory Yaroslavtsev
George Mason University
بريد إلكتروني تم التحقق منه على grigory.us - الصفحة الرئيسية
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
Private analysis of graph structure‏
V Karwa, S Raskhodnikova, A Smith, G Yaroslavtsev‏
ACM Transactions on Database Systems (TODS) 39 (3), 1-33, 2014‏
3332014
Parallel algorithms for geometric graph problems‏
A Andoni, A Nikolov, K Onak, G Yaroslavtsev‏
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014‏
2142014
Near optimal lp rounding algorithm for correlationclustering on complete and complete k-partite graphs‏
S Chawla, K Makarychev, T Schramm, G Yaroslavtsev‏
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015‏
1512015
Tight bounds for linear sketches of approximate matchings‏
S Assadi, S Khanna, Y Li, G Yaroslavtsev‏
arXiv preprint arXiv:1505.01467, 2015‏
148*2015
Approximation algorithms for spanner problems and directed steiner forest‏
P Berman, A Bhattacharyya, K Makarychev, S Raskhodnikova, ...‏
Information and Computation 222, 93-107, 2013‏
81*2013
Lp-testing‏
P Berman, S Raskhodnikova, G Yaroslavtsev‏
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014‏
772014
Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under Distances‏
G Yaroslavtsev, A Vadapalli‏
International Conference on Machine Learning, 5600-5609, 2018‏
752018
Lower bounds for testing properties of functions over hypergrid domains‏
E Blais, S Raskhodnikova, G Yaroslavtsev‏
2014 IEEE 29th Conference on Computational Complexity (CCC), 309-320, 2014‏
612014
Private algorithms for the protected in social network search‏
M Kearns, A Roth, ZS Wu, G Yaroslavtsev‏
Proceedings of the National Academy of Sciences 113 (4), 913-918, 2016‏
59*2016
Finding efficient circuits using SAT-solvers‏
A Kojevnikov, AS Kulikov, G Yaroslavtsev‏
International Conference on Theory and Applications of Satisfiability …, 2009‏
592009
Accurate and efficient private release of datacubes and contingency tables‏
G Cormode, CM Procopiuc, D Srivastava, G Yaroslavtsev‏
arXiv preprint arXiv:1207.6096, 2012‏
55*2012
Hierarchical clustering for euclidean data‏
M Charikar, V Chatziafratis, R Niazadeh, G Yaroslavtsev‏
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019‏
502019
New upper bounds on the Boolean circuit complexity of symmetric functions‏
E Demenkov, A Kojevnikov, A Kulikov, G Yaroslavtsev‏
Information Processing Letters 110 (7), 264-267, 2010‏
502010
Beating the direct sum theorem in communication complexity with implications for sketching‏
M Molinaro, DP Woodruff, G Yaroslavtsev‏
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013‏
442013
Beyond set disjointness: the communication complexity of finding the intersection‏
J Brody, A Chakrabarti, R Kondapally, DP Woodruff, G Yaroslavtsev‏
Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014‏
392014
Adversarially robust submodular maximization under knapsack constraints‏
D Avdiukhin, S Mitrović, G Yaroslavtsev, S Zhou‏
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge …, 2019‏
352019
Objective-based hierarchical clustering of deep embedding vectors‏
S Naumov, G Yaroslavtsev, D Avdiukhin‏
Proceedings of the AAAI Conference on Artificial Intelligence 35 (10), 9055-9063, 2021‏
332021
Bisect and conquer: Hierarchical clustering via max-uncut bisection‏
S Ahmadian, V Chatziafratis, A Epasto, E Lee, M Mahdian, K Makarychev, ...‏
arXiv preprint arXiv:1912.06983, 2019‏
33*2019
Certifying equality with limited interaction‏
J Brody, A Chakrabarti, R Kondapally, DP Woodruff, G Yaroslavtsev‏
Algorithmica 76, 796-845, 2016‏
302016
Learning Pseudo-Boolean k-DNF and Submodular Functions‏
S Raskhodnikova, G Yaroslavtsev‏
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013‏
302013
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20