| Publication | Date of Publication | Type |
|---|
Fast matrix multiplication using coherent configurations
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
On the power of quantum Fourier sampling
| 2017-07-19 | Paper |
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Journal of the ACM | 2015-11-11 | Paper |
Loss-less condensers, unbalanced expanders, and extractors
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
scientific article; zbMATH DE number 6351503 (Why is no real title available?)
Theory of Computing | 2014-10-06 | Paper |
The complexity of rationalizing network formation
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
On sunflowers and matrix multiplication
Computational Complexity | 2013-07-19 | Paper |
Fast polynomial factorization and modular composition
SIAM Journal on Computing | 2012-03-15 | Paper |
The complexity of Boolean formula minimization
Journal of Computer and System Sciences | 2011-01-18 | Paper |
Pseudo-random generators for all hardnesses
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Low-End Uniform Hardness versus Randomness Tradeoffs for AM
SIAM Journal on Computing | 2010-07-07 | Paper |
Reconstructive dispersers and hitting set generators
Algorithmica | 2009-07-24 | Paper |
On the complexity of succinct zero-sum games
Computational Complexity | 2009-06-17 | Paper |
The complexity of the matroid-greedoid partition problem
Theoretical Computer Science | 2009-03-17 | Paper |
The Complexity of Rationalizing Matchings
Algorithms and Computation | 2009-01-29 | Paper |
scientific article; zbMATH DE number 5485560 (Why is no real title available?)
| 2009-01-05 | Paper |
scientific article; zbMATH DE number 5485478 (Why is no real title available?)
| 2009-01-05 | Paper |
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM | 2008-12-21 | Paper |
Algorithms for Playing Games with Limited Randomness
Algorithms – ESA 2007 | 2008-09-25 | Paper |
The Complexity of Boolean Formula Minimization
Automata, Languages and Programming | 2008-08-28 | Paper |
On Obtaining Pseudorandomness from Error-Correcting Codes
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Pseudorandomness for approximate counting and sampling
Computational Complexity | 2007-11-14 | Paper |
Lossless condensers, unbalanced expanders, and extractors
Combinatorica | 2007-11-12 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Group-theoretic algorithms for matrix multiplication
| 2005-11-17 | Paper |
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences | 2004-11-18 | Paper |
A group-theoretic approach to fast matrix multiplication
| 2003-07-24 | Paper |
On the complexity of approximating the VC dimension.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
The minimum equivalent DNF problem and shortest implicants
Journal of Computer and System Sciences | 2002-07-04 | Paper |
scientific article; zbMATH DE number 1405672 (Why is no real title available?)
| 2000-02-23 | Paper |
