| Publication | Date of Publication | Type |
|---|
| Lower bounds for circuits with \(\mathrm{MOD}_m\) gates | 2026-05-29 | Paper |
| Heavy-tailed independent component analysis | 2025-08-05 | Paper |
Non-Gaussian component analysis using entropy methods
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Annotations for Sparse Data Streams
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Annotations for Sparse Data Streams
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Better analysis of binary search tree on decomposable sequences
Theoretical Computer Science | 2019-05-29 | Paper |
| Expanders via random spanning trees | 2019-05-06 | Paper |
Near-optimal regret bounds for Thompson sampling
Journal of the ACM | 2018-05-17 | Paper |
Query complexity of sampling and small geometric partitions
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
| scientific article; zbMATH DE number 6678440 (Why is no real title available?) | 2017-01-26 | Paper |
Fourier PCA and robust tensor decomposition
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
| Rounds vs queries trade-off in noisy computation | 2014-10-13 | Paper |
Lower bounds for the average and smoothed number of Pareto-optima
Theory of Computing | 2014-10-06 | Paper |
Expanders via Random Spanning Trees
SIAM Journal on Computing | 2014-07-30 | Paper |
| Deterministic algorithms for the Lovász local lemma | 2014-05-22 | Paper |
Deterministic algorithms for the Lovász local lemma
SIAM Journal on Computing | 2014-04-11 | Paper |
The VPN conjecture is true
Journal of the ACM | 2014-02-17 | Paper |
Dynamic vs. oblivious routing in network design
Algorithmica | 2011-08-16 | Paper |
scientific article; zbMATH DE number 5899292 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
Dynamic vs. oblivious routing in network design
Lecture Notes in Computer Science | 2009-10-29 | Paper |
| scientific article; zbMATH DE number 5485556 (Why is no real title available?) | 2009-01-05 | Paper |
Lower Bounds for the Noisy Broadcast Problem
SIAM Journal on Computing | 2008-12-22 | Paper |
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
An algorithmic approach to the identification of rigid domains in proteins
Algorithmica | 2007-09-10 | Paper |
A parallel search game
Random Structures & Algorithms | 2005-09-22 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
