| Publication | Date of Publication | Type |
|---|
| On exact division and divisibility testing for sparse polynomials | 2025-01-20 | Paper |
| Random primes without primality testing | 2025-01-17 | Paper |
| Sparse polynomial interpolation and division in soft-linear time | 2025-01-17 | Paper |
| One (more) line on the most ancient algorithm in history | 2024-05-14 | Paper |
Polynomial modular product verification and its implications
Journal of Symbolic Computation | 2022-11-21 | Paper |
| Random primes in arithmetic progressions | 2022-02-11 | Paper |
Computing the multilinear factors of lacunary polynomials without heights
Journal of Symbolic Computation | 2021-02-18 | Paper |
Essentially optimal sparse polynomial multiplication
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Fast in-place algorithms for polynomial operations
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Generic reductions for in-place polynomial multiplication
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Lacunaryx: computing bounded-degree factors of lacunary polynomials
ACM Communications in Computer Algebra | 2017-06-22 | Paper |
Factoring bivariate lacunary polynomials without heights
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Randomized root finding over finite FFT-fields using tangent Graeffe transforms
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Deterministic root finding over finite fields using Graeffe transforms
Applicable Algebra in Engineering, Communication and Computing | 2016-06-29 | Paper |
Bounded-degree factors of lacunary multivariate polynomials
Journal of Symbolic Computation | 2016-02-11 | Paper |
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Symmetric determinantal representations in characteristic 2
Linear Algebra and its Applications | 2014-02-19 | Paper |
On the complexity of the multivariate resultant
Journal of Complexity | 2013-03-04 | Paper |
The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent
(available as arXiv preprint) | 2012-08-31 | Paper |
| Symmetric Determinantal Representation of Weakly-Skew Circuits | 2012-01-23 | Paper |
| Symmetric determinantal representation of formulas and weakly skew circuits | 2012-01-05 | Paper |
The multivariate resultant is NP-hard in any characteristic
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Acceptable complexity measures of theorems
(available as arXiv preprint) | 2010-08-18 | Paper |
