Grigory Yaroslavtsev
Grigory Yaroslavtsev
Assistant Professor, Indiana University, Bloomington
Verified email at grigory.us - Homepage
Title
Cited by
Cited by
Year
Private analysis of graph structure
V Karwa, S Raskhodnikova, A Smith, G Yaroslavtsev
ACM Transactions on Database Systems (TODS) 39 (3), 1-33, 2014
1712014
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
1132014
Tight bounds for linear sketches of approximate matchings
S Assadi, S Khanna, Y Li, G Yaroslavtsev
arXiv preprint arXiv:1505.01467, 2015
82*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
54*2013
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
482015
Lp-testing
P Berman, S Raskhodnikova, G Yaroslavtsev
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
462014
Accurate and Efficient Private Release of Datacubes and Contingency Tables
G Cormode, CM Procopiuc, D Srivastava, G Yaroslavtsev
arXiv preprint arXiv:1207.6096, 2012
42*2012
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
392014
Finding efficient circuits using SAT-solvers
A Kojevnikov, AS Kulikov, G Yaroslavtsev
International Conference on Theory and Applications of Satisfiability …, 2009
382009
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
362010
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
34*2016
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
342013
Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under Distances
G Yaroslavtsev, A Vadapalli
International Conference on Machine Learning, 5600-5609, 2018
292018
Learning Pseudo-Boolean k-DNF and Submodular Functions
S Raskhodnikova, G Yaroslavtsev
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
262013
Certifying equality with limited interaction
J Brody, A Chakrabarti, R Kondapally, DP Woodruff, G Yaroslavtsev
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
222014
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
212014
Steiner transitive-closure spanners of low-dimensional posets
P Berman, A Bhattacharyya, E Grigorescu, S Raskhodnikova, D Woodruff, ...
Automata, Languages and Programming, 760-772, 2011
12*2011
Linear Sketching over
S Kannan, E Mossel, G Yaroslavtsev
arXiv preprint arXiv:1611.01879, 2016
112016
Primal-dual approximation algorithms for node-weighted network design in planar graphs
P Berman, G Yaroslavtsev
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
112012
Online algorithms for machine minimization
N Devanur, K Makarychev, D Panigrahi, G Yaroslavtsev
arXiv preprint arXiv:1403.0486, 2014
102014
The system can't perform the operation now. Try again later.
Articles 1–20