| 2026 | FSCD | Resource-Aware Quantum Programming with General Recursion and Quantum Control. | Kostia Chardonnet, Emmanuel Hainry, Romain Pchoux, Thomas Vinet |
| 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 | 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 |
| 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 | 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 |
| 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 |
| 2010 | MFCS | Robust Computations with Dynamical Systems. | Olivier Bournez, Daniel Silva Graa, Emmanuel Hainry |
| 2008 | CiE | Reachability in Linear Dynamical Systems. | Emmanuel Hainry |
| 2008 | UC | Computing Omega-Limit Sets in Linear Dynamical Systems. | Emmanuel Hainry |
| 2007 | MCU | On the Computational Capabilities of Several Models. | Olivier Bournez, Emmanuel Hainry |
| 2006 | TAMC | The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. | Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graa, Emmanuel Hainry |
| 2004 | ICALP | An Analog Characterization of Elementarily Computable Functions over the Real Numbers. | Olivier Bournez, Emmanuel Hainry |
| 2004 | MCU | Real Recursive Functions and Real Extensions of Recursive Functions. | Olivier Bournez, Emmanuel Hainry |