| Publication | Date of Publication | Type |
|---|
Variety evasive subspace families
Computational Complexity | 2024-09-06 | Paper |
Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
SIAM Journal on Computing | 2024-04-04 | Paper |
Efficient list-decoding with constant alphabet and list sizes
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Improved Explicit Hitting-Sets for ROABPs | 2023-10-31 | Paper |
Variety evasive subspace families
(available as arXiv preprint) | 2023-07-12 | Paper |
| Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets | 2023-04-03 | Paper |
| Extractors for Images of Varieties | 2022-11-26 | Paper |
scientific article; zbMATH DE number 7559413 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Efficient list-decoding with constant alphabet and list sizes
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Derandomization from Algebraic Hardness
SIAM Journal on Computing | 2022-05-03 | Paper |
| Improved List-Decodability of Reed--Solomon Codes via Tree Packings | 2020-11-09 | Paper |
scientific article; zbMATH DE number 7250150 (Why is no real title available?)
(available as arXiv preprint) | 2020-09-22 | Paper |
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach
(available as arXiv preprint) | 2020-07-01 | Paper |
Algebraic dependencies and \(\mathsf{PSPACE}\) algorithms in approximative complexity over any field
Theory of Computing | 2020-02-12 | Paper |
Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
Journal of Symbolic Computation | 2019-06-28 | Paper |
Algebraic problems equivalent to beating exponent 3/2 for polynomial factorization over finite fields
(available as arXiv preprint) | 2018-03-21 | Paper |
Minimum Manhattan network is NP-complete
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Gossip vs. Markov chains, and randomness-efficient rumor spreading
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| $\mathcal{P}$-schemes and Deterministic Polynomial Factoring over Finite Fields | 2017-06-30 | Paper |
Randomness-efficient curve samplers
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Randomness-efficient curve samplers
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Greedy construction of 2-approximate minimum Manhattan networks
International Journal of Computational Geometry & Applications | 2011-08-23 | Paper |
Minimum Manhattan network is NP-complete
Discrete & Computational Geometry | 2011-06-03 | Paper |
Greedy Construction of 2-Approximation Minimum Manhattan Network
Algorithms and Computation | 2009-01-29 | Paper |
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
(available as arXiv preprint) | N/A | Paper |
