Jean-Yves Marion
Affiliations: | Genie Informatique et Genie Logiciel | Ecole Polytechnique, Montreal (Canada) |
Area:
Electronics and Electrical Engineering, Computer Engineering, Criminology and PenologyGoogle:
"Jean-Yves Marion"Children
Sign in to add traineeJoan Calvet | grad student | 2013 | Ecole Polytechnique, Montreal (Canada) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Bonfante G, Kahle R, Marion J, et al. (2016) Two function algebras defining functions in NC k boolean circuits Information & Computation. 248: 82-103 |
Marion JY. (2015) Developments in implicit computational complexity Information and Computation. 241: 1-2 |
Marion JY. (2012) From Turing machines to computer viruses. Philosophical Transactions. Series a, Mathematical, Physical, and Engineering Sciences. 370: 3319-39 |
Gaboardi M, Marion JY, Della Rocca SR. (2012) An implicit characterization of PSPACE Acm Transactions On Computational Logic. 13 |
Marion J, Péchoux R. (2009) Sup-interpretations, a semantic method for static analysis of program resources Acm Transactions On Computational Logic. 10: 27 |
Baillot P, Marion JY, Rocca SRD. (2009) Guest editorial: Special issue on implicit computational complexity Acm Transactions On Computational Logic. 10 |
Bonfante G, Kaczmarek M, Marion J. (2009) Architecture of a Morphological Malware Detector Journal in Computer Virology. 5: 263-270 |
Besombes J, Marion J. (2008) Learning discrete categorial grammars from structures Theoretical Informatics and Applications. 42: 165-182 |
Gaboardi M, Marion JY, Ronchi Della Rocca S. (2008) Soft Linear Logic and Polynomial Complexity Classes Electronic Notes in Theoretical Computer Science. 205: 67-87 |
Bournez O, Cucker F, Naurois PJd, et al. (2006) Implicit complexity over an arbitrary structure: Quantifier alternations Information & Computation. 204: 210-230 |