( en | de | ru )

 

Disambiguation of "Marion, Jean-Yves"

Author of the publication

copydeleteadd this publication to your clipboard
Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13).

, , and . NII Shonan Meet. Rep., (2013)

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.

Jean-Yves Caillé

Jean-Yves Guillemaut

Jean-Yves Blaise

Jean-Yves Talon

Jean-Yves Caleca

 

Other publications of authors with the same name

A tier-based typed programming language characterizing Feasible Functionals., , , and . LICS, page 535-549. ACM, (2020)The Light Lexicographic path Ordering, and . CoRR, (2000)The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet, , , , , , , and . Annual Computer Security Applications Conference, page .. Austin, Texas États-Unis, (Dec 6, 2010)Learning Tree Languages from Positive Examples and Membership Queries., and . ALT, volume 3244 of Lecture Notes in Computer Science, page 440-453. Springer, (2004)Complete and tractable machine-independent characterizations of second-order polytime., , , and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 368-388. Springer, (2022)Towards Paving the Way for Large-Scale Windows Malware Analysis: Generic Binary Unpacking with Orders-of-Magnitude Performance Boost., , , , , , and . CCS, page 395-411. ACM, (2018)Declassification Policy for Program Complexity Analysis., , , and . LICS, page 41:1-41:14. ACM, (2024)Theoretical Computer Science: Computational Complexity., , , , , , and . A Guided Tour of Artificial Intelligence Research (3) (III), Springer, (2020)Case Study: Additive Linear Logic and Lattices.. LFCS, volume 1234 of Lecture Notes in Computer Science, page 237-247. Springer, (1997)Implicit complexity via structure transformation., and . CoRR, (2018)