Curriculum Vitae for Benoît Valiron

Personal Details

Electronic Address:
benoit (dot) valiron (at) monoidal (dot) net
Official academic Address:
CentraleSupélec
Département Informatique
Plateau de Moulon
3 rue Joliot-Curie
91192 Gif sur Yvette Cedex
Birthdate:
October 1st, 1980
Citizenship:
French

Education

2004 - 2008.
Ph.D. in Mathematics, University of Ottawa, Canada.
Supervisor: Peter Selinger.
Title: Semantics for a higher-order functional programming language for quantum computation.
The defense took place on September 25, 2008
2002 - 2004.
Master of Science, Mathematics, University of Ottawa.
Supervisor: Peter Selinger.
Title: A functional programming language for quantum computation with classical control.
2001 - 2002.
French maîtrise (fourth year of university), Mathematics, Université Joseph Fourier, Grenoble, France. Exchange program, done at the University of Ottawa. With best honors ("mention très bien").
2000 - 2001.
French licence (third year of university), Mathematics, Université Joseph Fourier, Grenoble. With best honors ("mention très bien").
1998 - 2000.
Classes préparatoires aux Grandes Ecoles, Champollion, Grenoble.

Employment

Since Feb 2015
Assistant professor. Full time position at CentraleSupélec. Duties: teaching at CentraleSupélec (an engineering school), and research withing the “Laboratoire Méthodes Formelles” (LMF) of Université Paris Saclay.
Sep 2013 - Feb 2015
Post-doc position in the laboratory PPS of Université Paris Diderot, in France, funded by the ANR LoGoI, then the ANR CoQuas.
Mar 2011 - Aug 2013
Post-doc position at the Department of Computer and Information Science, University of Pennsylvania, under the supervision of Jonathan M. Smith. The main project attached to this job is to develop a programming language and an optimized compiler for a quantum computer.
Sep 2010 - Feb 2011
"Assistant Temporaire d'éducation et de recherche (ATER)" at Université Paris 13, Villetaneuse, France. One year contract, combining research and teaching duties. Research within at the computer science laboratory LIPN and teaching at "IUT Villetaneuse".
Oct 2009 - Aug 2010.
"Assistant Temporaire d'éducation et de recherche (ATER)" at Université Joseph Fourier, Grenoble, France. One year contract, combining research and teaching duties. Research within the research group CAPP at the Laboratoire d'informatique de Grenoble (LIG).
Oct 2008 - Sep 2009.
Post-doc position funded by INRIA, located in the computer science lab of the "Ecole Polytechnique" (LIX), Palaiseau, France, within the research group TYPICAL.

Grants, Awards and Funding Sources

2021-...
European project HPCQS: High Performance Computer and Quantum Simulator hybrid
2020-...
.
Inria internal Project Eqip: Engineering for Quantum Information Processors
2021-2023
SticAmSud Qapla’ (Quantum aspects of programming languages. Collaborative grant between France, Argentina and Brasil.
2018 - 2020
Project QuCa funded by ECOS-Sud Argentine. The funding covers several trips between France and Argentina.
2018 - 2021
Quantex research grant, with a national funding from BPI/GDN, from Ministère de l’Economie et des Finances. Partnership with LORIA (Nancy) and Atos/Bull. The project originally obtained a European Itea3 label, but the countries'partners pulled out.
2017 - 2021
ANR SoftQPro - National grant for a project partnered with LORIA (Nancy), CEA-NanoInnov and Atos/Bull.
2016 - 2017
Local research grant from the lab (LRI). Collaboration with the VALS research team: FreeReg, Regularity for Free.
2015 - 2017
CORAC research grant, Thales Velizy. Collaborative grant within the Modhel team.
2015 - 2017
SticAmSud research grant: Foundations of Quantum Computation: Syntax and Semantics (FoQCoSS). Collaborative grant between France, Argentina and Brasil.
2015 - 2017
Uruguayan research grant: Proyecto de investigación Fundamental Fondo Clemente Estable. In collaboration with the logic group in Montevideo.
2008 - 2009.
INRIA Saclay postdoctoral grant.
2007 - 2008.
Graduate Scholarship, Provincial Government of Ontario.
2007 - 2008.
Excellence Scholarship, University of Ottawa.
2004 - 2007.
Ph.D. International Admission Scholarship, University of Ottawa.
2002 - 2003.
M.Sc. International Admission Scholarship, University of Ottawa.
2001 - 2002
Exchange Scholarship, Région Rhône Alpes. For an exchange program between the Université Joseph Fourier and the University of Ottawa.

Academic Responsabilities

Externally
  • Program committee. QPL 2021 (18th International Conference on Quantum Physics and Logic).
  • PC and OC co-chair. QPL 2020 (17th International Conference on Quantum Physics and Logic).
  • Program committee. TTCS 2020 (Third IFIP International Conference on Topics in Theoretical Computer Science)
  • Program committee. FoSSACS 2020 (23rd International Conference on Foundations of Software Science and Computation Structures)
  • Extended review committee. ICFP 2019 (24th ACM SIGPLAN International Conference on Functional Programming).
  • Program committee. RC 2019 (11th Conference on Reversible Computation).
  • Program committee. QPL and MFPS 2018 in Halifax (15th International Conference on Quantum Physics and Logic and 34th Conference on the Mathematical Foundations of Programming Semantics).
  • Program committee. QPL 2017 (14th International Conference on Quantum Physics and Logic, The Netherlands, 2017).
  • Organising committee. POPL 2017 (44th ACM SIGPLAN Symposium on Principles of Programming Languages, Paris, France, 2017).
  • Program committee. RC 2016 (8th Conference on Reversible Computation, Bologna, Italy, 2016).
  • Program committee. DCM 2014 (10th International Workshop on Developments in Computational Models. Vienna, Austria, 2014).
  • Program committee. MFPS 2010 (26th Conference on Mathematical Foundations of Programming Semantics. Ottawa, Canada, 2010).
Internally
  • 2018-.... On the « Conseil d'Administration » of CentraleSupélec
  • 2015-2019. On the « Conseil de laboratoire » and the « Commission matériel » at LRI.
  • Since 2015. In charge of the seminar of the team Modhel at LRI.
  • 2011. Responsible of the Smithgroup seminar of the DSL lab, at the University of Pennsylvania.
  • 2009. Briefly on the « Conseil de laboratoire » of the computer science lab of cole Polytechnique (LIX, Palaiseau).
  • Summers 2006 and 2007. Helper, CMS Math Camps. The CMS Camps are ”mathematics enrich- ment camps designed primarily for Canadian students in grades 9 through 11”.
  • Fall 2005. Organizer, Graduate Student Seminar in Mathematics, University of Ottawa, Fall 2005. The seminar was joint with Carleton University.
  • From Fall 2003 to Fall 2005. Treasurer, Executive Committee of the Graduate Student Association of the Department of Mathematics and Statistic of the University of Ottawa.
  • Academic Year 2003-2004. Graduate Student Representative, University Senate (Science Section).

Graduate Supervision

In progress
  • Louis Lemonnier. Ph.D student since 2021. Co-supervision with Pablo Arrighi (LMF). Topic of the research: categorical semantics of quantum control.
  • Kostia Chardonnet. Ph.D. student since 2019. Co-supervision with Alexis Saurin (IRIF). Topic of the research: reversible and quantum control flow, linear logic.
  • Agustin Borgna, Ph.D. student since 2019. Co-supervision with Simon Perdrix (LORIA). Topic of the research: ZX calculus and compilation of quantum programs.
  • Dong-Ho Lee, Ph.D. student since 2018. Co-supervision with Valentin Perrelle (CEA-LIST). Topic of the research: semantics of quantum programming languages.
Completed
  • 2017-2019. Timothée Goubault de Brugière, Ph.D. Co-supervision with Marc Baboulin. Topic of the research: Optimization and emulation of quantum circuits.
  • 2014-2018. Yann Hamdaoui, Ph.D. Co-supervision with Claudia Faggian. Topic of the research: Geometry of interaction and concurrency.
  • 2018. Skander Kazdaghli, student from CentraleSupelec. 4-month Summer internship. Co-supervised with Marc Baboulin at LRI. Topic of the research: implementation and study of the QSVE algorithm.
  • 2018. Alexandre Clément, Master internship (stage M2 LMFI). Co-supervised with Michele Pagani at IRIF (Paris 7). Subject: denotational model of recursion in completely positive maps.
  • 2018. Baptiste Colin, Final internship of engineering school Mines-ParisTech. Subject: compilation of a functional programming language into reversible circuits.
  • 2015. Nicolas Blanco, Master internship (stage M2 LMFI). The research subject was the denotational semantics of probabilistic lambda-calculi.

Publications

Journal Articles.
  • Timothée Goubault De Brugière, Marc Baboulin, Benoît Valiron, Simon Martiel, and Cyril Allouche. Gaussian elimination versus greedy methods for the synthesis of linear reversible circuits. ACM Transactions on Quantum Computing, 2(3) :1–26, 2021.
  • Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron, Simon Martiel, and Cyril Allouche. Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures. Science of Computer Programming, page 102726, 2021.
  • Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron, Simon Martiel, and Cyril Allouche. Reducing the depth of linear reversible quantum circuits. IEEE Transactions on Quantum Engineering, 2 :1–22, 2021.
  • Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron, Cyril Allouche: Quantum circuits synthesis using Householder transformations. Comput. Phys. Commun. 248: 107001 (2020)
  • Pablo Arrighi, Alejandro Díaz-Caro and Benoît Valiron. The Vectorial Lambda-Calculus. Information and Computation, 254(1):105-139, June 2017.
  • A. Scherer, B. Valiron, S.-C. Mau, Scott Alexander, E. van den Berg and T. E. Chapuran. Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target. Quantum Information Processing 16:60, 2017
  • B. Valiron, N. J. Ross, P. Selinger, D. S. Alexander and Jonathan M. Smith. Programming the Quantum Future. Communications of the ACM, Vol. 58 No. 8, pp. 52-61, 2015.
  • B. Valiron and S. Zdancewic. Modeling simply-typed lambda-calculus in the category of finite vector spaces. Scientific Annals of Computer Science, 24(2):325-368, 2014.
  • A. Assaf, A. Díaz-Caro, S. Perdrix, C. Tasson and B. Valiron. Call-by-value, call-by-name and the vectorial behaviour of the algebraic lambda-calculus. Logical Methods in Computer Science, 10(4:8), 2014.
  • G. Chiribella, G. M. D'Ariano, P. Perinotti and B. Valiron. Quantum computations without definite causal structure. Physical Review A, 88:022318, 2013.
  • B. Valiron. A Typed, Algebraic, Computational Lambda-Calculus. Mathematical Structures in Computer Science, 23(2):504-554, 2013.
  • B. Valiron. Quantum Computation : from a Programmer's Perspective. New Generation Computing, 31(1):1-26, January 2013. (invited paper)
  • B. Valiron. Quantum Computation : a Tutorial. New Generation Computing, 30(4):271-296, 2012. (invited paper)
  • P. Selinger and B. Valiron. A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science, 16(3):527-552, 2006.
Proceeding (editor).
  • Benoît Valiron, Shane Mansfield, Pablo Arrighi, and Prakash Panangaden, editors. Proceedings of the 17th International Conference on Quantum Physics and Logic (QPL 2020), volume 340 of EPTCS, 2021.
Book Chapter.
  • P. Selinger and B. Valiron. Quantum Lambda Calculus. Book chapter in S. Gay and I. Mackie (Editors), Semantic Techniques in Quantum Computation, Cambridge University Press, pp. 135-172, 2009.
Refereed Conference and Workshop Proceedings.
  • Kostia Chardonnet, Louis Lemonnier, and Benoît Valiron. Categorical semantics of reversible pattern-matching. In Pre-proceedings of MFPS 2021, 2021.
  • Kostia Chardonnet, Benoît Valiron, and Renaud Vilmart. Geometry of interaction for ZX-diagrams. In Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, volume 202 of LIPIcs, pages 30 :1–30 :16, 2021.
  • Dongho Lee, Valentin Perrelle, Benoît Valiron, and Zhaowei Xu. Concrete categorical model of a quantum circuit description language with measurement. In Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), 2021. To appear.
  • Agustín Borgna, Simon Perdrix, and Benoît Valiron. Hybrid quantum-classical circuit simplification with the ZX-calculus. In Asian Symposium on Programming Languages and Systems (APLAS 2021), pages 121–139, 2021.
  • Christophe Chareton, Sébastien Bardin, François Bobot, Valentin Perrelle, and Benoît Valiron. An automated deductive verification framework for circuit-building quantum programs. In Nobuko Yoshida, editor, Programming Languages and Systems - 30th European Symposium on Programming, ESOP 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, volume 12648 of Lecture Notes in Computer Science, pages 148–177. Springer, 2021.
  • Hai Nguyen Van, Thibaut Balabonski, Frédéric Boulanger, Chantal Keller, Benoît Valiron, and Burkhart Wolff. On the semantics of polychronous polytimed specifications. In International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2020), pages 23–40. Springer, Cham, 2020.
  • Kostia Chardonnet, Alexis Saurin, and Benoît Valiron. Toward a curry-howard equivalence for linear, reversible computation. In International Conference on Reversible Computation (RC 2020), pages 144–152. Springer, Cham, 2020.
  • Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron, Simon Martiel, and Cyril Allouche. Quantum CNOT circuits synthesis for NISQ architectures using the syndrome decoding problem. In International Conference on Reversible Computation (RC 2020), pages 189–205. Springer, Cham, 2020.
  • Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron, Cyril Allouche: Synthesizing Quantum Circuits via Numerical Optimization. ICCS (2) 2019: 3-16
  • Alejandro Díaz-Caro, Mauricio Guillermo, Alexandre Miquel and Benoît Valiron. Realizability in the Unitary Sphere. Proceedings of the 24th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'19).
  • Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron and Cyril Allouche. Synthesizing quantum circuits via numerical optimization. Accepted for publication in the the Proceedings of International Conference on Computational Science (ICCS'19).
  • Amr Sabry, Juliana Vizzotto and Benoît Valiron. From Symmetric Pattern-Matching to Quantum Control. In Proceedings of the 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'18), 2018.
  • Cyril Allouche, Marc Baboulin, Timothée Goubault de Brugière (main author) and Benoît Valiron. Reuse method for quantum circuit synthesis. In Proceedings of the International Conference: Applied Mathematics, Modeling and Computational Science (AMMCS 2017).
  • Hai Nguyen Van (main author), Thibaut Balabonski, Frédéric Boulanger, Chantal Keller, Benoît Valiron and Burkhart Wolff. A Symbolic Operational Semantics for TESL with an Application to Heterogeneous System Testing. Proceedings of the 15th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'17), LNCS vol. 10419, pp. 318-334, 2017.
  • U. Dal Lago, C. Faggian, B.Valiron and Akira Yoshimizu. The Geometry of Parallelism: Classical, Probabilistic, and Quantum Effects. Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL'17), pp. 833--845, 2017.
  • B. Valiron. Generating reversible circuits from higher-order functional programs. Proceedings of the 8th International Conference on Reversible Computation (RC'16), LNCS vol. 9720, pp. 289-306, 2016.
  • U. Dal Lago, C. Faggian, B. Valiron and A. Yoshimizu. Parallelism and Synchronization in an Infinitary Context. Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015), pp. 559-572, 2015.
  • B. Valiron and S. Zdancewic. Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi. In Proceedings of the 11th International Colloquium on Theoretical Aspects of Computing (ICTAC 2014), Volume 8687 of Lecture Notes in Computer Science, pp 442-459, 2014.
  • M. Pagani, P. Selinger, B. Valiron. Applying quantitative semantics to higher-order quantum computing. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2014), ACM SIGPLAN Notices, Volume 49 Issue 1, January 2014.
  • A.S. Green, P.L. Lumsdaine, N.J. Ross, P. Selinger, B. Valiron. An Introduction to Quantum Programming in Quipper. In Proceedings of the 5th Conference on Reversible Computation (RC 2013), Victoria, Canada, Volume 7948 of Lecture Notes in Computer Science, pp. 110-124, 2013.
  • A. S. Green, P. L. Lumsdaine, N. J. Ross, P. Selinger and B. Valiron. Quipper: A Scalable Quantum Programming Language. In Proceedings of the 34th annual ACM SIGPLAN conference on Programming Language Design and Implementation (PLDI 2013). ACM SIGPLAN Notices, Volume 48 Issue 6, pp. 333-342. June 2013.
  • P. Arrighi, A. Díaz-Caro and B. Valiron. A type system for the vectorial aspects of the linear-algebraic lambda-calculus. In Elham Kashefi, Jean Krivine and Femke van Raamsdonk: Proceedings of the 7th workshop on Developments in Computational Models (DCM 2011). Electronic Proceedings in Theoretical Computer Science 88, pp. 1–15, 2012
  • B. Valiron. Semantics of a typed algebraic lambda-calculus. In S. B. Cooper, P. Panangaden and E. Kashefi, Proceedings of the 6th workshop on Developments in Computational Models, Edinburgh, 9 – 10 July 2010. Volume 26 of Electronic Proceedings in Theoretical Computer Science, pages 147-158.
  • B. Valiron. On quantum and probabilistic linear lambda-calculi (extended abstract). In Proceedings of the Joint 5th International Workshop on Quantum Physics and Logic and 4th Workshop on Developments in Computational Models (QPL/DCM 2008), Reykjavik, Iceland, 12-13 July 2008. Volume 270, Issue 1 of Electronic Notes in Theoretical Computer Science, pages 121-128. Elsevier, 2011.
  • P. Selinger and B. Valiron. A linear-non-linear model for a computational call-by-value lambda-calculus (extended abstract). Proceedings of the 11th International Conference on Foundation of Software Science and Computation Structures (FoSSaCS'08), Budapest, Hungary, March 29 - April 6, 2008. Volume 4962 of Lecture Notes in Computer Science, pages 81-96. Springer, 2008.
  • P. Selinger and B. Valiron. On a fully abstract model for a quantum linear functional language. Proceedings of the 4th International Workshop on Quantum Programming Languages, Oxford, July 17-19, 2006. Volume 210 of Electronic Notes in Theoretical Computer Science, pages 123-137. Elsevier, 2008.
  • P. Selinger and B. Valiron. A lambda calculus for quantum computation with classical control. In P. Urzyczyn, editor, Proceedings of the Seventh International Conference on Typed Lambda Calculi and Applications (TLCA'05), Nara, Japan, April 2005, volume 3461 of Lecture Notes in Computer Science, pages 354-368. Springer-Verlag, 2005.
Other Proceedings.
  • ostia Chardonnet, Alexis Saurin, and Benoît Valiron. Towards a curry-howard correspondence for linear, reversible computation. In 5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), 2021.
  • Frederic Boulanger, Dominique Marcadet, Safouan Taha and Benoit Valiron and Martin Rayrole. A time synchronization protocol for A664-P7. In Proceedings of the 37th IEEE/AIAA Digital Avionics Systems Conference (DASC 2018), London, Sep 2018.
  • Thibault Balabonski, Marco Gaboardi, Chantal Keller and Benoît Valiron. Regularity for Free. In Book of Abstract of TYPES 2017, Budapest, Hungary, May 2017.
  • A. Polonsky, M. Pagani and B. Valiron. Toward analytic rewriting theory. Informal electronic proceedings of the 8th International Workshop on Higher-Order Rewriting (HOR'16), Porto, Portugal, June 2016.
  • H. Nguyen Van, T. Balabonski, F. Boulanger, S. Taha, B. Valiron, B. Wolff, L. Ye. Towards a Formal Semantics of the TESL Specification Language. Proceedings of GEMOC+MPM@MoDELS 2015, pp. 14-19, 2015.
  • M. Pagani, B. Valiron. Work in Progress: Algebraic Abstract Reduction Systems. Proceedings of the Workshop on Infinitary Rewriting (WIR'14). Vienna, July 2014.
  • J. Ross, P. Selinger, J. M. Smith and B. Valiron. Quipper: Concrete Resource Estimation in Quantum Algorithms. Informal proceedings of QAPL'14, Grenoble, April 2014.
  • A. Díaz-Caro, S. Perdrix, C. Tasson and B. Valiron. Equivalence of algebraic lambda-calculi (work in progress). Pre-Proceedings of the 5th International Workshop on Higher-Order Rewriting (HOR'10), Edinburgh, 14 juillet 2010, pages 6-11.
  • B. Valiron. Orthogonality and algebraic lambda-calculus (extended abstract). Proceedings of the 7th QPL workshop, Oxford, 29 – 30 mai 2010.
  • B. Valiron. Quantum typing. In Proceedings of the 2nd International Workshop on Quantum Programming Languages, editor Peter Selinger, TUCS General Publication No 33, Turku Center for Computer Science, 2004.
Posters
  • Cyril Allouche, Marc Baboulin, Timothée Goubault de Brugière (main author and presenter) and Benoît Valiron. Quantum Circuit synthesis with Householder Transformations. Presented at QTech 2018 in Paris.
  • Cyril Allouche, Marc Baboulin, Timothée Goubault de Brugière (main author and presenter) and Benoît Valiron. Quantum Circuit synthesis with Householder Matrices. Presented at Journées annuelles du GdR Informatique-Mathématique 2018.
  • Amr Sabry, Juliana Vizzotto and Benoît Valiron. From Symmetric Pattern-Matching to Quantum Control. Presented at QPL'17 in Nijmegen.
  • B. Valiron. Bell Inequalities for (almost) Free. Presented at TQC'17 in Paris.
Reports
  • A. S. Green, P. L. Lumsdaine, N. J. Ross, P. Selinger and B. Valiron. Report on the Quipper language, version 0.3, with GFI algorithm implementations (Updated for revision 0.3-4). 178 pages. July 2012. Report to IARPA, for official use only.
Drafts.
  • R. Eisenberg, B. Valiron and S. Zdancewic. Typechecking Linear Data: Quantum Computation in Haskell. June 2012.
  • B. Valiron. Sums and Triangular Stacks of Integers. January 2010.

Invited talks

Popularization

Teaching Experience

Since Feb 2015.
Assistant professor at the engineering school CentraleSupélec.

Lecturer for the following courses.

  • « Applications web » (Web technologies).
    2nd-year course in the curriculum
    Presentation of (some of) the main technologies to build Ajax web application, with a presentation of the event-driven web-programming model: HTML, CSS, Javascript and jQuery, XML and JSON. On the server side: Node.js.
    21 hours of courses for about 20 students
  • « Traitement des langages » (Language processing).
    3rd-year course (equiv. Master)
    Serve as the compilation course in the CS curriculum. Main emphasis on the lexing and parsing aspect, with discussion of the LL and LR methods for parser generation.
    15 hours of courses, for about 25 students.
  • « Logique et modèles » (Logic and models).
    3rd-year course (equiv. Master)
    Logical systems, theories, lambda-calculus and functional programming, link with type systems.
    24 hours of courses, for about 25 students.
  • « Preuve » (Proof).
    3rd-year course (equiv. Master)
    Spécifying with inductive types ; internal of proof assistants (study of Isabelle/HOL) ; proof of programs with Hoare logic.
    24 hours of courses, for about 25 students.

I also teach within the broader context of Université Paris Saclay:

  • « Beginner's course on quantum algorithms and programming »
    21 hours of teaching in the Computer Science Master of the university, in the parcours QDCS(“Quantum and Distributed Computer Science”).(Proof).
  • « Regards croisés »
    Teaching duties within ARTeQ – Interdisciplinary training in quantum technologies.
    Course shared with Romain Alleaume.
Jan-May 2015.
Lecturer, 3rd year of University, course on the Ocaml and Java vitual machines. Responsible for lecturing, producing the course material, the exercises, the project and the exam for a class of 47 students.
Sep-Dec 2010.
Various responsabilities at IUT Villetaneuse for 1st year students, as follows:
  • Lecturer, introductory course on Unix for one class of 6 students.
  • Lecturer, introductory course on Java for a class of 6 students and a class of 21 students.
  • Teaching assistant, course on networks, with a focus on the OSI model, layers 1, 2 and 3.
Sep-Dec 2009.
Lecturer, 3rd year of university, course on XML technologies (INF356).
Responsible for lecturing, producing the course material, the exercices and the exams, for a class of 40 students. Computer lab sessions were coordinated with a course assistant.
Jan-May 2009.
Computer Lab Teaching Assistant, INF431 (Foundations of Computer Science, 2nd year), Ecole Polytechnique.
Directed computer lab sessions of two groups of 20-25 students, marked corresponding homework, helped in designing lab session.
May-Jul 2007.
Lecturer, Mat 1322 (first-year calculus, in English), University of Ottawa.
Responsible for lecturing, producing the course material, the exercises, the homeworks and the exams for a class of 45 students. Supervised two teaching assistants for the recitations and marking. Coordinated course materials with a parallel French language section of the same course taught by another teacher.
2005.
Award for "Teaching Assistant of the Year 2003-2004", Faculty of Science, University of Ottawa.
2002 - 2005.
Teaching Assistant in Mathematics, University of Ottawa.
Directed exercise sessions, marked homework, and proctored and marked exams for first and second year level courses, in French and in English. The number of students ranged from 10 to 60. List of courses:
Fall 2005.
Mat 1720. 1st year course: Calculus, Part II. In French.
Fall 2004.
Mat 1723. 1st year course: Calculus for Earth Science. In French.
Fall 2004.
Mat 1719. 1st year course: Pre-Calculus. In French.
Winter 2004.
Mat 2761. 2nd year course: Logic for Computing. In French.
Fall 2003
Mat 1700. 1st year course: Mathematical Methods. In French.
Summer 2003.
Mat 2377. 2nd year course: Probability and Statistics. In English.
Winter 2003.
Mat 2761. 2nd year course: Logic for Computing. In French.
Fall 2002.
Mat 1722. 1st year course: Calculus, Part II. In French.