Sagraloff, Michael Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Sagraloff, M. (2014). A Near-optimal Algorithm for Computing Real Roots of Sparse Polynomials. In K. Nabeshima (Ed.), ISSAC 2014 (pp. 359-366). New York, NY: ACM. doi:10.1145/2608628.2608632.