| Publication | Date of Publication | Type |
|---|
| Low degree testing over the reals | 2024-05-14 | Paper |
| Model counting meets \(F_0\) estimation | 2023-11-29 | Paper |
| Near-optimal learning of tree-structured distributions by Chow-Liu | 2023-11-14 | Paper |
| Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu | 2023-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875793 | 2023-02-03 | Paper |
| Parameterized Intractability of Even Set and Shortest Vector Problem | 2022-12-08 | Paper |
| Property testing. Problems and techniques | 2022-02-21 | Paper |
| Predicting winner and estimating margin of victory in elections using sampling | 2021-11-02 | Paper |
| Lower bounds for 2-query LCCs over large alphabet | 2021-07-28 | Paper |
| Parameterized intractability of even set and shortest vector problem from Gap-ETH | 2021-07-28 | Paper |
| A formal methods approach to predicting new features of the eukaryotic vesicle traffic system | 2021-04-28 | Paper |
| Improved learning of \(k\)-parities | 2020-09-17 | Paper |
| Lower bounds for constant query affine-invariant LCCs and LTCs | 2019-12-06 | Paper |
| Combinatorial lower bounds for 3-query LDCs | 2019-11-24 | Paper |
| Testing low complexity affine-invariant properties | 2019-05-15 | Paper |
| Testing odd-cycle-freeness in Boolean functions | 2019-05-10 | Paper |
| Transitive-closure spanners | 2019-05-06 | Paper |
| An optimal algorithm for \(\ell_1\)-heavy hitters in insertion streams and related problems | 2019-03-28 | Paper |
| Improved learning of \(k\)-parities | 2018-10-04 | Paper |
| On higher-order Fourier analysis over non-prime fields | 2018-04-19 | Paper |
| On the hardness of learning sparse parities | 2018-03-02 | Paper |
| Lower bounds for constant query affine-invariant LCCs and LTCs | 2017-10-10 | Paper |
| Algorithmic regularity for polynomials and applications | 2017-10-05 | Paper |
| On the convergence of the Hegselmann-Krause system | 2017-05-16 | Paper |
| Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. | 2017-03-31 | Paper |
| Lower bounds for testing triangle-freeness in Boolean functions | 2015-07-08 | Paper |
| Using higher-order Fourier analysis over general fields | 2015-05-04 | Paper |
| A unified framework for testing linear-invariant properties | 2015-04-09 | Paper |
| Polynomial decompositions in polynomial time | 2014-10-08 | Paper |
| A bipartite graph with non-unimodal independent set sequence | 2014-08-14 | Paper |
| Steiner transitive-closure spanners of low-dimensional posets | 2014-08-14 | Paper |
| Every locally characterized affine-invariant property is testable | 2014-08-07 | Paper |
| Tight Lower Bounds for 2-query LCCs over Finite Fields | 2014-07-30 | Paper |
| Lower bounds for testing triangle-freeness in Boolean functions | 2014-05-22 | Paper |
| An algebraic characterization of testable Boolean CSPs | 2013-08-06 | Paper |
| Approximation algorithms for spanner problems and directed Steiner forest | 2013-06-06 | Paper |
| Transitive-closure spanners | 2013-03-19 | Paper |
| Testing permanent oracles -- revisited | 2012-11-02 | Paper |
| Testing Odd-Cycle-Freeness in Boolean Functions | 2012-10-31 | Paper |
| Lower bounds for local monotonicity reconstruction from transitive-closure spanners | 2012-09-12 | Paper |
| Testing linear-invariant non-linear properties | 2012-04-24 | Paper |
| Improved approximation for the directed spanner problem | 2011-07-06 | Paper |
| Steiner transitive-closure spanners of low-dimensional posets | 2011-07-06 | Paper |
| Testing linear-invariant non-linear properties | 2011-05-24 | Paper |
| Optimal testing of Reed-Muller codes | 2010-10-12 | Paper |
| Testing Linear-Invariant Non-linear Properties: A Short Report | 2010-10-12 | Paper |
| Lower bounds for local monotonicity reconstruction from transitive-closure spanners | 2010-09-10 | Paper |
| Learning bounded-degree polytrees with known skeleton | N/A | Paper |
