| Publication | Date of Publication | Type |
|---|
Improved local testing for multiplicity codes
| 2024-08-22 | Paper |
Unbalanced expanders from multiplicity codes
| 2024-08-22 | Paper |
The plane test is a local tester for multiplicity codes
| 2024-07-05 | Paper |
Expander random walks: the general case and limitations
| 2024-06-24 | Paper |
Approximating iterated multiplication of stochastic matrices in small space
| 2024-05-08 | Paper |
Expander random walks: a Fourier-analytic approach
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
On hitting-set generators for polynomials that vanish rarely
| 2023-10-31 | Paper |
Error reduction for weighted PRGs against read once branching programs
| 2023-07-12 | Paper |
scientific article; zbMATH DE number 7650110 (Why is no real title available?)
| 2023-02-03 | Paper |
On hitting-set generators for polynomials that vanish rarely
Computational Complexity | 2022-11-24 | Paper |
scientific article; zbMATH DE number 7561729 (Why is no real title available?)
| 2022-07-21 | Paper |
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
SIAM Journal on Computing | 2022-05-03 | Paper |
Probabilistic logarithmic-space algorithms for Laplacian solvers
| 2021-07-28 | Paper |
List-Decoding with Double Samplers
SIAM Journal on Computing | 2021-03-24 | Paper |
scientific article; zbMATH DE number 7250143 (Why is no real title available?)
| 2020-09-22 | Paper |
On the Entropy Loss and Gap of Condensers
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
List decoding with double samplers
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On approximating the eigenvalues of stochastic matrices in probabilistic logspace
Computational Complexity | 2017-10-18 | Paper |
Explicit, almost optimal, epsilon-balanced codes
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Approximate Quantum Error Correction for Correlated Noise
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent
| 2017-04-25 | Paper |
Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
ACM Transactions on Algorithms | 2016-04-11 | Paper |
Dense quantum coding and quantum finite automata
Journal of the ACM | 2015-12-07 | Paper |
On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace
Automata, Languages, and Programming | 2015-10-27 | Paper |
Provable unlinkability against traffic analysis with low message overhead
Journal of Cryptology | 2015-08-03 | Paper |
On the de-randomization of space-bounded approximate counting problems
Information Processing Letters | 2015-06-15 | Paper |
Interaction in quantum communication and the complexity of \textsc{Set Disjointness}
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Loss-less condensers, unbalanced expanders, and extractors
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Extractor codes
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Short seed extractors against quantum storage
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
| 2014-12-18 | Paper |
Constructing small-bias sets from algebraic-geometric codes
Theory of Computing | 2014-10-06 | Paper |
Quantum bit escrow
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Normal subgroup reconstruction and quantum computation using group representations
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Inverting well conditioned matrices in quantum logspace
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Constructing small-bias sets from algebraic-geometric codes
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Better short-seed quantum-proof extractors
Theoretical Computer Science | 2012-03-13 | Paper |
Short seed extractors against quantum storage
SIAM Journal on Computing | 2011-10-18 | Paper |
A combinatorial construction of almost-Ramanujan graphs using the zig-zag product
SIAM Journal on Computing | 2011-07-29 | Paper |
scientific article; zbMATH DE number 5899289 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
On the hardness of satisfiability with bounded occurrences in the polynomial-time hierarchy
Theory of Computing | 2011-05-24 | Paper |
Adiabatic quantum state generation and statistical zero knowledge
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the complexity of approximating the diamond norm
| 2010-02-05 | Paper |
Non-interactive timestamping in the bounded-storage model
Journal of Cryptology | 2009-05-08 | Paper |
Worst-Case to Average-Case Reductions Revisited
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
A combinatorial construction of almost-Ramanujan graphs using the zig-zag product
| 2009-01-05 | Paper |
Extractor Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Interaction in Quantum Communication
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Improving the Alphabet-Size in Expander-Based Code Constructions
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
An O (log( n ) 4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs
Journal of the ACM | 2008-05-05 | Paper |
Adiabatic Quantum State Generation
SIAM Journal on Computing | 2008-03-28 | Paper |
If NP languages are hard on the worst-case, then it is easy to find their hard instances
Computational Complexity | 2008-03-11 | Paper |
On the power of quantum, one round, two prover interactive proof systems
Quantum Information Processing | 2008-01-21 | Paper |
Lossless condensers, unbalanced expanders, and extractors
Combinatorica | 2007-11-12 | Paper |
Extractors from Reed-Muller codes
Journal of Computer and System Sciences | 2006-07-12 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Financial Cryptography
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity | 2005-02-11 | Paper |
scientific article; zbMATH DE number 2102672 (Why is no real title available?)
| 2004-09-24 | Paper |
The Quantum Communication Complexity of Sampling
SIAM Journal on Computing | 2004-01-08 | Paper |
The Hidden Subgroup Problem and Quantum Computation Using Group Representations
SIAM Journal on Computing | 2003-06-19 | Paper |
Storing information with extractors.
Information Processing Letters | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1759347 (Why is no real title available?)
| 2002-11-28 | Paper |
scientific article; zbMATH DE number 1775404 (Why is no real title available?)
| 2002-08-01 | Paper |
Almost optimal dispersers
Combinatorica | 2002-06-25 | Paper |
scientific article; zbMATH DE number 1408372 (Why is no real title available?)
| 2002-02-21 | Paper |
scientific article; zbMATH DE number 1559538 (Why is no real title available?)
| 2001-02-28 | Paper |
scientific article; zbMATH DE number 1418317 (Why is no real title available?)
| 2000-07-19 | Paper |
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics | 2000-03-19 | Paper |
Extracting randomness: A survey and new constructions
Journal of Computer and System Sciences | 2000-02-17 | Paper |
scientific article; zbMATH DE number 1332655 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-09-07 | Paper |
scientific article; zbMATH DE number 1263189 (Why is no real title available?)
| 1999-06-29 | Paper |
scientific article; zbMATH DE number 1256744 (Why is no real title available?)
| 1999-05-18 | Paper |
A note on PCP vs. MIP
Information Processing Letters | 1997-02-27 | Paper |
