@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",
    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",
    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",
    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"
}