List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Fast Fourier sparsity testing | 2024-05-14 | Paper |
| Approximate F_2-Sketching of Valuation Functions (available as arXiv preprint) | 2023-02-03 | Paper |
| Optimality of linear sketching under modular updates (available as arXiv preprint) | 2022-07-27 | Paper |
| scientific article; zbMATH DE number 7250148 (Why is no real title available?) | 2020-09-22 | Paper |
| Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Learning Pseudo-Boolean k-DNF and Submodular Functions Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Maximum matchings in dynamic graph streams and the simultaneous communication model Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Certifying equality with limited interaction | 2017-03-22 | Paper |
| Certifying equality with limited interaction Algorithmica | 2016-11-29 | Paper |
| Amplification of One-Way Information Complexity via Codes and Noise Sensitivity Automata, Languages, and Programming | 2015-10-27 | Paper |
| Beyond set disjointness Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| \(L_p\)-testing Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
| Parallel algorithms for geometric graph problems Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
| Steiner transitive-closure spanners of low-dimensional posets Combinatorica | 2014-08-14 | Paper |
| Approximation algorithms for spanner problems and directed Steiner forest Information and Computation | 2013-06-06 | Paper |
| Primal-dual approximation algorithms for node-weighted network design in planar graphs Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
| Improved approximation for the directed spanner problem Automata, Languages and Programming | 2011-07-06 | Paper |
| Steiner transitive-closure spanners of low-dimensional posets Automata, Languages and Programming | 2011-07-06 | Paper |
| New upper bounds on the Boolean circuit complexity of symmetric functions Information Processing Letters | 2010-09-07 | Paper |
Research outcomes over time
This page was built for person: Grigory Yaroslavtsev
