| 2026 | FSCD | Resource-Aware Quantum Programming with General Recursion and Quantum Control. | Kostia Chardonnet, Emmanuel Hainry, Romain Pchoux, Thomas Vinet |
| 2026 | LICS | Quantum Control and General Recursion Beyond the Unitary Case. | Kathleen Barsse, Romain Pchoux, Simon Perdrix |
| 2025 | FOSSACS | Combining quantum and classical control: syntax, semantics and adequacy. | Kinnari Dave, Louis Lemonnier, Romain Pchoux, Vladimir Zamdzhiev |
| 2025 | FSCD | Branch Sequentialization in Quantum Polytime. | Emmanuel Hainry, Romain Pchoux, Mrio Silva |
| 2025 | MFCS | Quantum Programming in Polylogarithmic Time. | Florent Ferrari, Emmanuel Hainry, Romain Pchoux, Mrio Silva |
| 2024 | ESOP | On the Hardness of Analyzing Quantum Programs Quantitatively. | Martin Avanzini, Georg Moser, Romain Pchoux, Simon Perdrix |
| 2024 | LICS | Declassification Policy for Program Complexity Analysis. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2023 | FOSSACS | A Programming Language Characterizing Quantum Polynomial Time. | Emmanuel Hainry, Romain Pchoux, Mrio Silva |
| 2022 | FOSSACS | Complete and tractable machine-independent characterizations of second-order polytime. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2022 | LICS | Quantum Expectation Transformers for Cost Analysis. | Martin Avanzini, Georg Moser, Romain Pchoux, Simon Perdrix, Vladimir Zamdzhiev |
| 2021 | ICTAC | ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs. | Emmanuel Hainry, Emmanuel Jeandel, Romain Pchoux, Olivier Zeyen |
| 2020 | FLOPS | Polynomial Time over the Reals with Parsimony. | Emmanuel Hainry, Damiano Mazza, Romain Pchoux |
| 2020 | FOSSACS | Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. | Romain Pchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev |
| 2020 | LICS | A tier-based typed programming language characterizing Feasible Functionals. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2017 | LPAR | Higher order interpretation for higher order complexity. | Emmanuel Hainry, Romain Pchoux |
| 2015 | APLAS | Objects in Polynomial Time. | Emmanuel Hainry, Romain Pchoux |
| 2015 | ICFP | Algebras and coalgebras in the light affine Lambda calculus. | Marco Gaboardi, Romain Pchoux |
| 2014 | TAMC | Complexity Information Flow in a Multi-threaded Imperative Language. | Jean-Yves Marion, Romain Pchoux |
| 2014 | TAMC | A Categorical Treatment of Malicious Behavioral Obfuscation. | Romain Pchoux, Thanh Dinh Ta |
| 2013 | FOSSACS | Type-Based Complexity Analysis for Fork Processes. | Emmanuel Hainry, Jean-Yves Marion, Romain Pchoux |
| 2010 | ISAAC | Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. | Hugo Fre, Emmanuel Hainry, Mathieu Hoyrup, Romain Pchoux |
| 2009 | CSL | Upper Bounds on Stream I/O Using Semantic Interpretations. | Marco Gaboardi, Romain Pchoux |
| 2008 | PPDP | Characterizations of polynomial complexity classes with a better intensionality. | Jean-Yves Marion, Romain Pchoux |
| 2008 | TAMC | A Characterization of NCk. | Jean-Yves Marion, Romain Pchoux |
| 2007 | ICTAC | Quasi-interpretation Synthesis by Decomposition. | Guillaume Bonfante, Jean-Yves Marion, Romain Pchoux |
| 2006 | FLOPS | Resource Analysis by Sup-interpretation. | Jean-Yves Marion, Romain Pchoux |
| 2006 | LPAR | A Characterization of Alternating Log Time by First Order Functional Programs. | Guillaume Bonfante, Jean-Yves Marion, Romain Pchoux |