( en | de | ru )

 

Disambiguation of "Baillot, Patrick"

Author of the publication

copydeleteadd this publication to your clipboard
Light Logics and Optimal Reduction: Completeness and Complexity.

, , and . LICS, page 421-430. IEEE Computer Society, (2007)

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.

Gunther Baillot

Armin Baillot

Patrick Pfeffer

Optimiertes Design kombinatorischer Verbindungsbibliotheken durch genetische Algorithmen und deren Bewertung anhand wissensbasierter Protein-Ligand-Bindungsprofile. Uni Marburg, (2009)

Patrick Hansen

Entwicklung eines energetischen Sanierungsmodells für den europäischen Wohngebäudesektor unter dem Aspekt der Erstellung von Szenarien für Energie- und Co_1tn2-Einsparpotenziale bis 2030. Uni Siegen, (2009)

Patrick Mainka

 

Other publications of authors with the same name

Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus., , and . IFIP TCS, volume 8705 of Lecture Notes in Computer Science, page 151-163. Springer, (2014)Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic., , and . CSL, volume 4207 of Lecture Notes in Computer Science, page 150-166. Springer, (2006)Timeless Games., , , and . CSL, volume 1414 of Lecture Notes in Computer Science, page 56-77. Springer, (1997)Type inference in intuitionistic linear logic., and . PPDP, page 219-230. ACM, (2010)On Quasi-Interpretations, Blind Abstractions and Implicit Complexity, , and . CoRR, (2006)Elementary Complexity and Geometry of Interaction., and . TLCA, volume 1581 of Lecture Notes in Computer Science, page 25-39. Springer, (1999)Light Logics and Optimal Reduction: Completeness and Complexity., , and . LICS, page 421-430. IEEE Computer Society, (2007)Higher-Order Interpretations and Program Complexity., and . CSL, volume 16 of LIPIcs, page 62-76. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus, and . CoRR, (2006)Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs., , and . J. Autom. Reason., 63 (4): 813-855 (2019)