| Publication | Date of Publication | Type |
|---|
Quantum worst-case to average-case reductions for all linear problems
| 2024-11-28 | Paper |
Erratum to: ``Multitasking capacity: hardness results and improved constructions
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Derandomization of cell sampling
| 2024-05-14 | Paper |
Worst-case to average-case reductions via additive combinatorics
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
SIAM Journal on Computing | 2023-04-04 | Paper |
On mappings on the hypercube with small average stretch
Combinatorics, Probability and Computing | 2023-04-03 | Paper |
scientific article; zbMATH DE number 7650374 (Why is no real title available?)
| 2023-02-03 | Paper |
String Matching: Communication, Circuits, and Learning.
| 2023-02-03 | Paper |
Testing linearity against non-signaling strategies
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Probabilistic checking against non-signaling strategies from linearity testing
| 2022-07-18 | Paper |
Meyniel extremal families of abelian Cayley graphs
Graphs and Combinatorics | 2022-03-21 | Paper |
On axis-parallel tests for tensor product codes
| 2021-07-28 | Paper |
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On axis-parallel tests for tensor product codes
Theory of Computing | 2020-12-17 | Paper |
Sorting networks on restricted topologies
| 2020-10-22 | Paper |
An Entropy Lower Bound for Non-Malleable Extractors
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
scientific article; zbMATH DE number 7250157 (Why is no real title available?)
| 2020-09-22 | Paper |
Multitasking capacity: hardness results and improved constructions
SIAM Journal on Discrete Mathematics | 2020-03-26 | Paper |
On Mappings on the Hypercube with Small Average Stretch
| 2019-05-27 | Paper |
On percolation and \(\mathcal{NP}\)-hardness
Random Structures & Algorithms | 2019-05-02 | Paper |
On Lipschitz bijections between Boolean functions
Combinatorics, Probability and Computing | 2018-04-23 | Paper |
An \(\widetilde O(n)\) queries adaptive tester for unateness
| 2018-04-19 | Paper |
On percolation and NP-hardness
| 2017-12-19 | Paper |
Direct sum testing
SIAM Journal on Computing | 2017-08-16 | Paper |
Direct sum testing (extended abstract)
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
On Coloring Random Subgraphs of a Fixed Graph
| 2016-12-13 | Paper |
A tight upper bound on acquaintance time of graphs
Graphs and Combinatorics | 2016-11-29 | Paper |
Excited random walk with periodic cookies
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2016-10-26 | Paper |
Bi-Lipschitz bijection between the Boolean cube and the Hamming ball
Israel Journal of Mathematics | 2016-07-25 | Paper |
A counterexample to monotonicity of relative mass in random walks
Electronic Communications in Probability | 2016-05-23 | Paper |
On hardness of approximating the parameterized clique problem
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
The complexity of DNF of parities
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Two-sided error proximity oblivious testing
Random Structures & Algorithms | 2016-03-22 | Paper |
Zero-fixing extractors for sub-logarithmic entropy
Automata, Languages, and Programming | 2015-10-27 | Paper |
A note on subspace evasive sets
Chicago Journal of Theoretical Computer Science | 2015-02-09 | Paper |
Acquaintance time of a graph
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Greedy Random Walk
Combinatorics, Probability and Computing | 2014-04-16 | Paper |
Two-sided error proximity oblivious testing (extended abstract)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
