iweb visitor

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
members:jroland [2016/09/12 10:01]
jroland
members:jroland [2016/11/10 09:39]
jroland [Teaching]
Line 42: Line 42:
   * Compléments de programmation et d'​algorithmique (INFO-H-304)   * Compléments de programmation et d'​algorithmique (INFO-H-304)
   * Quantum information and computation (INFO-H-514) - partim: Quantum computation   * Quantum information and computation (INFO-H-514) - partim: Quantum computation
-  * Information,​ Coding, Computing and Complexity Theory (INFO-H-422) - partim: ​Computing and Complexity Theory+  * Information,​ Coding, Computing and Complexity Theory (INFO-H-422) - partim: Complexity Theory
   * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe   * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe
-  * Analyse complexe ​(MATH-H-201) - partim: Exercices+  * Signaux et Systèmes ​(MATH-H-3001) - partim: Exercices
   * Examen spécial d'​admission en Polytechnique - Géométrie   * Examen spécial d'​admission en Polytechnique - Géométrie
 ==== Research interests ==== ==== Research interests ====
Line 88: Line 88:
   and Gabriel Senno.   and Gabriel Senno.
  ​Robust Bell inequalities from communication complexity.  ​Robust Bell inequalities from communication complexity.
- ​2016. + In <​em>​11th Conference on the Theory of Quantum Computation,​ 
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1606.09514">​arXiv</​a>&​nbsp;​]+  Communication and Cryptography (TQC 2016)</​em>,​ volume&​nbsp;​61 of <​em>​Leibniz 
 +  International Proceedings in Informatics (LIPIcs)</​em>,​ pages 5:​1--5:​24, ​2016. 
 +[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1606.09514">​arXiv</​a>&​nbsp;​|  
 +<a href="​http://​drops.dagstuhl.de/​opus/​volltexte/​2016/​6686">​http</​a>&​nbsp;​]
  
 </td> </td>
 </tr> </tr>
 +