| 2026 | ISSAC | Fast Decomposition of Sparse Polynomials. | Mark Giesbrecht, Pascal Koiran, Saiyue Lyu, Daniel S. Roche |
| 2025 | SODA | An Efficient Uniqueness Theorem for Overcomplete Tensor Decomposition. | Pascal Koiran |
| 2023 | CIAC | Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision. | Pascal Koiran, Subhayan Saha |
| 2018 | ISSAC | Polynomial Equivalence Problems for Sum of Affine Powers. | Ignacio Garca-Marco, Pascal Koiran, Timothe Pecatte |
| 2017 | ISSAC | Reconstruction Algorithms for Sums of Affine Powers. | Ignacio Garca-Marco, Pascal Koiran, Timothe Pecatte |
| 2017 | STACS | On the Complexity of Partial Derivatives. | Ignacio Garca-Marco, Pascal Koiran, Timothe Pecatte, Stphan Thomass |
| 2015 | ICALP | Lower Bounds for Sums of Powers of Low Degree Univariates. | Neeraj Kayal, Pascal Koiran, Timothe Pecatte, Chandan Saha |
| 2015 | MFCS | Log-Concavity and Lower Bounds for Arithmetic Circuits. | Ignacio Garca-Marco, Pascal Koiran, Sbastien Tavenas |
| 2013 | ISSAC | Factoring bivariate lacunary polynomials without heights. | Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki |
| 2012 | ISSAC | Upper bounds on real roots and lower bounds for the permanent. | Pascal Koiran |
| 2011 | STACS | Symmetric Determinantal Representation of Weakly-Skew Circuits. | Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier |
| 2010 | MFCS | The Multivariate Resultant Is NP-hard in Any Characteristic. | Bruno Grenet, Pascal Koiran, Natacha Portier |
| 2009 | MFCS | A Dichotomy Theorem for Polynomial Evaluation. | Irne Briquel, Pascal Koiran |
| 2008 | ISSAC | Expressing a fraction of two determinants as a determinant. | Erich L. Kaltofen, Pascal Koiran |
| 2008 | WG | On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. | Pascal Koiran, Klaus Meer |
| 2008 | WoLLIC | Adversary Lower Bounds for Nonadaptive Quantum Algorithms. | Pascal Koiran, Jrgen Landes, Natacha Portier, Penghui Yao |
| 2007 | ISAAC | On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices. | Uffe Flarup, Pascal Koiran, Laurent Lyaudet |
| 2007 | MCU | Decision Versus Evaluation in Algebraic Complexity. | Pascal Koiran |
| 2007 | MFCS | VPSPACE and a Transfer Theorem over the Complex Field. | Pascal Koiran, Sylvain Perifel |
| 2007 | STACS | VPSPACE and a Transfer Theorem over the Reals. | Pascal Koiran, Sylvain Perifel |
| 2006 | ISSAC | Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. | Erich L. Kaltofen, Pascal Koiran |
| 2006 | MFCS | Valiant's Model: From Exponential Sums to Exponential Products. | Pascal Koiran, Sylvain Perifel |
| 2005 | ICALP | A Quantum Lower Bound for the Query Complexity of Simon's Problem. | Pascal Koiran, Vincent Nesme, Natacha Portier |
| 2005 | ISSAC | On the complexity of factoring bivariate supersparse (Lacunary) polynomials. | Erich L. Kaltofen, Pascal Koiran |
| 2000 | ICALP | Lower Bounds Are Not Easier over the Reals: Inside PH. | Herv Fournier, Pascal Koiran |
| 2000 | STACS | The Stability of Saturated Linear Dynamical Systems Is Undecidable. | Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis |
| 2000 | STACS | Circuits versus Trees in Algebraic Complexity. | Pascal Koiran |
| 1998 | STOC | Are Lower Bounds Easier over the Reals? | Herv Fournier, Pascal Koiran |
| 1997 | FOCS | Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties. | Pascal Koiran |
| 1995 | FOCS | Approximating the Volume of Definable Sets. | Pascal Koiran |
| 1995 | STOC | On real Turing machines that toss coins. | Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther |
| 1994 | COLT | Efficient Learning of Continuous Neural Networks. | Pascal Koiran |
| 1993 | FOCS | A Weak Version of the Blum, Shub & Smale model | Pascal Koiran |
| 1993 | STACS | Computability Properties of Low-dimensional Dynamical Systems. | Michel Cosnard, Max H. Garzon, Pascal Koiran |
| 1992 | LATIN | Complexity Issues in Neural Network Computations. | Michel Cosnard, Pascal Koiran, Hlne Paugam-Moisy |