( en | de | ru )

 

Disambiguation of "Péchoux, Romain"

Author of the publication

copydeleteadd this publication to your clipboard
Quantum Expectation Transformers for Cost Analysis.

, , , , and . LICS, page 10:1-10:13. ACM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Romain Péchoux

Romain Schroeder

Romain Brevet

Romain Bourqui

Romain Aïssat

 

Other publications of authors with the same name

A programming language characterizing quantum polynomial time., , and . CoRR, (2022)On the efficiency of normal form systems for representing Boolean functions., , , and . Theor. Comput. Sci., (2020)Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory., , , and . FoSSaCS, volume 12077 of Lecture Notes in Computer Science, page 562-581. Springer, (2020)Polynomial Time over the Reals with Parsimony., , and . FLOPS, volume 12073 of Lecture Notes in Computer Science, page 50-65. Springer, (2020)A General Noninterference Policy for Polynomial Time., and . Proc. ACM Program. Lang., 7 (POPL): 806-832 (January 2023)Quantum Expectation Transformers for Cost Analysis., , , , and . LICS, page 10:1-10:13. ACM, (2022)A tier-based typed programming language characterizing Feasible Functionals., , , and . Log. Methods Comput. Sci., (2022)ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs., , , and . ICTAC, volume 12819 of Lecture Notes in Computer Science, page 357-365. Springer, (2021)A Programming Language Characterizing Quantum Polynomial Time., , and . FoSSaCS, volume 13992 of Lecture Notes in Computer Science, page 156-175. Springer, (2023)On the Complexity of Minimizing Median Normal Forms of Monotone Boolean Functions and Lattice Polynomials., , , and . J. Multiple Valued Log. Soft Comput., 33 (3): 197-218 (2019)