☰

Grigory Yaroslavtsev, Ph.D. - Publications

Affiliations: 
2014 Computer Science and Engineering Pennsylvania State University, State College, PA, United States 
Area:
Computer Science, Theoretical Mathematics
Tree Info Similar researchers PubMed Report error

19 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Hosseini K, Lovett S, Yaroslavtsev G. Optimality of Linear Sketching Under Modular Updates. Electronic Colloquium On Computational Complexity. 25: 17. DOI: 10.4230/Lipics.Ccc.2019.13  0.422
2019 Avdiukhin D, Pupyrev S, Yaroslavtsev G. Multi-dimensional balanced graph partitioning via projected gradient descent Proceedings of the Vldb Endowment. 12: 906-919. DOI: 10.14778/3324301.3324307  0.404
2016 Kearns M, Roth A, Wu ZS, Yaroslavtsev G. Private algorithms for the protected in social network search. Proceedings of the National Academy of Sciences of the United States of America. PMID 26755606 DOI: 10.1073/Pnas.1510612113  0.374
2016 Brody J, Chakrabarti A, Kondapally R, Woodruff DP, Yaroslavtsev G. Certifying Equality With Limited Interaction Algorithmica. 1-50. DOI: 10.1007/S00453-016-0163-6  0.368
2016 Assadi S, Khanna S, Li Y, Yaroslavtsev G. Maximum matchings in dynamic graph streams and the simultaneous communication model Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2: 1345-1364.  0.471
2015 Chawla S, Makarychev K, Schramm T, Yaroslavtsev G. Near optimal LP rounding algorithm for correlation clustering on complete and complete k-partite graphs Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 219-228. DOI: 10.1145/2746539.2746604  0.431
2014 Brody J, Chakrabarti A, Kondapally R, Woodruff DP, Yaroslavtsev G. Beyond set disjointness: The communication complexity of finding the intersection Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 106-113. DOI: 10.1145/2611462.2611501  0.371
2014 Berman P, Raskhodnikova S, Yaroslavtsev G. Lp-testing Proceedings of the Annual Acm Symposium On Theory of Computing. 164-173. DOI: 10.1145/2591796.2591887  0.65
2014 Andoni A, Nikolov A, Onak K, Yaroslavtsev G. Parallel algorithms for geometric graph problems Proceedings of the Annual Acm Symposium On Theory of Computing. 574-583. DOI: 10.1145/2591796.2591805  0.407
2014 Blais E, Raskhodnikova S, Yaroslavtsev G. Lower bounds for testing properties of functions over hypergrid domains Proceedings of the Annual Ieee Conference On Computational Complexity. 309-320. DOI: 10.1109/CCC.2014.38  0.63
2014 Berman P, Bhattacharyya A, Grigorescu E, Raskhodnikova S, Woodruff DP, Yaroslavtsev G. Steiner transitive-closure spanners of low-dimensional posets Combinatorica. 34: 255-277. DOI: 10.1007/S00493-014-2833-9  0.712
2013 Berman P, Bhattacharyya A, Makarychev K, Raskhodnikova S, Yaroslavtsev G. Approximation algorithms for spanner problems and Directed Steiner Forest Information and Computation. 222: 93-107. DOI: 10.1016/J.Ic.2012.10.007  0.712
2013 Molinaro M, Woodruff DP, Yaroslavtsev G. Beating the direct sum theorem in communication complexity with implications for sketching Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1738-1756.  0.363
2013 Raskhodnikova S, Yaroslavtsev G. Learning pseudo-Boolean k-DNF and submodular functions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1356-1368.  0.678
2012 Berman P, Yaroslavtsev G. Primal-dual approximation algorithms for node-weighted network design in planar graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7408: 50-60. DOI: 10.1007/978-3-642-32512-0_5  0.326
2011 Karwa V, Raskhodnikova S, Smith A, Yaroslavtsev G. Private analysis of graph structure Proceedings of the Vldb Endowment. 4: 1146-1157. DOI: 10.1145/2611523  0.721
2011 Berman P, Bhattacharyya A, Grigorescu E, Raskhodnikova S, Woodruff DP, Yaroslavtsev G. Steiner transitive-closure spanners of low-dimensional posets Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6755: 760-772. DOI: 10.1007/978-3-642-22006-7_64  0.71
2011 Berman P, Bhattacharyya A, Makarychev K, Raskhodnikova S, Yaroslavtsev G. Improved approximation for the directed spanner problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6755: 1-12. DOI: 10.1007/978-3-642-22006-7_1  0.733
2010 Demenkov E, Kojevnikov A, Kulikov A, Yaroslavtsev G. New upper bounds on the Boolean circuit complexity of symmetric functions Information Processing Letters. 110: 264-267. DOI: 10.1016/J.Ipl.2010.01.007  0.346
Show low-probability matches.