Grigory Yaroslavtsev

Available identifiers

Publication	Date of Publication	Type
Fast Fourier sparsity testing	2024-05-14	Paper
Approximate F_2-Sketching of Valuation Functions	2023-02-03	Paper
Optimality of linear sketching under modular updates	2022-07-27	Paper
https://portal.mardi4nfdi.de/entity/Q5121896	2020-09-22	Paper
Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching	2019-05-15	Paper
Learning Pseudo-Boolean k-DNF and Submodular Functions	2019-05-15	Paper
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model	2018-07-16	Paper
Certifying Equality With Limited Interaction.	2017-03-22	Paper
Certifying equality with limited interaction	2016-11-29	Paper
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity	2015-10-27	Paper
Beyond set disjointness	2015-09-03	Paper
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs	2015-08-21	Paper
L _p -testing	2015-06-26	Paper
Parallel algorithms for geometric graph problems	2015-06-26	Paper
Steiner transitive-closure spanners of low-dimensional posets	2014-08-14	Paper
Approximation algorithms for spanner problems and directed Steiner forest	2013-06-06	Paper
Primal-dual approximation algorithms for node-weighted network design in planar graphs	2012-11-02	Paper
Improved approximation for the directed spanner problem	2011-07-06	Paper
Steiner transitive-closure spanners of low-dimensional posets	2011-07-06	Paper
New upper bounds on the Boolean circuit complexity of symmetric functions	2010-09-07	Paper

This page was built for person: Grigory Yaroslavtsev