List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Random primes without primality testing | 2025-01-17 | Paper |
| Sparse polynomial interpolation and division in soft-linear time | 2025-01-17 | Paper |
| Random primes in arithmetic progressions | 2022-02-11 | Paper |
| Verification protocols with sub-linear communication for polynomial matrix operations Journal of Symbolic Computation | 2021-02-18 | 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 |
| LU factorization with errors Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
| Error correction in fast matrix multiplication and inverse Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
| What can (and can't) we do with sparse polynomials? Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
| Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic SIAM Journal on Matrix Analysis and Applications | 2019-12-09 | Paper |
| New instantiations of the CRYPTO 2017 masking schemes (available as arXiv preprint) | 2019-01-23 | Paper |
| Sparse polynomials in FLINT ACM Communications in Computer Algebra | 2017-06-22 | Paper |
| Output-sensitive algorithms for sumset and sparse polynomial multiplication Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
| Faster sparse multivariate polynomial interpolation of straight-line programs Journal of Symbolic Computation | 2016-02-11 | Paper |
| Sparse interpolation over finite fields via low-order roots of unity Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
| Multivariate sparse interpolation using randomized Kronecker substitutions Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
| An in-place truncated Fourier transform and applications to polynomial multiplication Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
| Diversification improves interpolation Proceedings of the 36th international symposium on Symbolic and algebraic computation | 2015-06-09 | Paper |
| Faster sparse interpolation of straight-line programs Computer Algebra in Scientific Computing | 2014-07-07 | Paper |
| Computing sparse multiples of polynomials Algorithmica | 2013-01-28 | Paper |
| Space- and time-efficient polynomial multiplication Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
| Detecting lacunary perfect powers and computing their roots Journal of Symbolic Computation | 2011-12-07 | Paper |
| Chunky and equal-spaced polynomial multiplication Journal of Symbolic Computation | 2011-06-01 | Paper |
| Interpolation of shifted-lacunary polynomials Computational Complexity | 2011-02-18 | Paper |
| Computing sparse multiples of polynomials Algorithms and Computation | 2010-12-09 | Paper |
| On lacunary polynomial perfect powers Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
Research outcomes over time
This page was built for person: Daniel S. Roche
