| 2025 | ISSAC | Optimal Bounds for the Number of Pieces of Real Near-Circuit Hypersurfaces. | Weixun Deng, J. Maurice Rojas, Cordelia Russell |
| 2024 | ISSAC | Feasibility of Circuit Polynomials without Purple Swans: Feasibility without Purple Swans. | Weixun Deng, Alperen Ali Ergr, Grigoris Paouris, J. Maurice Rojas |
| 2021 | ISSAC | A Complexity Chasm for Solving Univariate Sparse Polynomial Equations Over p-adic Fields. | J. Maurice Rojas, Yuyu Zhu |
| 2019 | ISSAC | A Faster Solution to Smale's 17th Problem I: Real Binomial Systems. | Grigoris Paouris, Kaitlyn Phillipson, J. Maurice Rojas |
| 2013 | ISSAC | Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields. | Jingguo Bi, Qi Cheng, J. Maurice Rojas |
| 2010 | ISSAC | Randomized NP-completeness for | Martin E. Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek |
| 2009 | ISSAC | Faster real feasibility via circuit discriminants. | Frdric Bihan, J. Maurice Rojas, Casey E. Stella |
| 1999 | STOC | On the Complexity of Diophantine Geometry in Low Dimensions (Extended Abstract). | J. Maurice Rojas |
| 1998 | ESA | Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting. | J. Maurice Rojas |
| 1991 | ISSAC | An Optimal Condition for Determining the Exact Number of Roots of a Polynomial System. | John F. Canny, J. Maurice Rojas |