1. Akritas, A. (1982). Reflections on a pair of theorems by Budan and Fourier. Mathematics Magazine, 55(5), 292–298.
2. Akritas, A. G. (2008). A new look at one of the bisection methods derived from Vincent’s theorem or there is no Descartes’ method. In M. Wester & M. Beaudin (Eds.), Computer algebra in education (pp. 19–35). AullonaPress. http://inf-server.inf.uth.gr/~akritas/articles/71.pdf .
3. Akritas, A. (2009). Linear and quadratic complexity bounds on the values of the positive roots of polynomials. Journal of Universal Computer Science, 15(3), 523–537.
4. Anderson, B., Jackson, J., & Sitharam, M. (1998). Descartes’ rule of signs revisited. American Mathematical Monthly, 105, 447–451.
5. Basu, S., Bhatnagar, N., Gopalan, P., & Lipton, R. (2008). Polynomials that sign represent parity and descartes’ rule of signs. Computational Complexity, 17(3), 377–406.