@article{https://authors.library.caltech.edu/records/yyey8-wnc42, title = "Fast Multivariate Multipoint Evaluation Over All Finite Fields", journal = "Journal of the ACM", year = "2024", url = "https://authors.library.caltech.edu/records/yyey8-wnc42", id = "record", issn = "0004-5411", doi = "10.1145/3652025" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190225-133843285, title = "Deterministic polynomial factoring over finite fields: A uniform approach via P-schemes", journal = "Journal of Symbolic Computation", year = "2020", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190225-133843285", id = "record", issn = "0747-7171", doi = "10.1016/j.jsc.2019.02.011", volume = "96" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191118-103356388, title = "41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)", chapter = "Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields", year = "2016", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191118-103356388", id = "record", isbn = "9783959770163", doi = "10.4230/LIPIcs.MFCS.2016.47" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150218-152406896, title = "Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms Proceedings", chapter = "Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading", year = "2015", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150218-152406896", id = "record", isbn = "978-1-61197-374-7", doi = "10.1137/1.9781611973730.29" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200518-105002182, title = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques", chapter = "Randomness-Efficient Curve Samplers", year = "2013", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200518-105002182", id = "record", isbn = "978-3-642-40327-9", doi = "10.1007/978-3-642-40328-6\_40" }