Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
members:jroland [2016/07/02 16:30] jroland [Publications] |
members:jroland [2016/11/10 09:39] jroland [Teaching] |
||
|---|---|---|---|
| Line 17: | Line 17: | ||
| | QuIC - Ecole Polytechnique de Bruxelles \\ Université Libre de Bruxelles \\ 50 av. F. D. Roosevelt - CP 165/59 \\ B-1050 Bruxelles \\ Belgique | | QuIC - Ecole Polytechnique de Bruxelles \\ Université Libre de Bruxelles \\ 50 av. F. D. Roosevelt - CP 165/59 \\ B-1050 Bruxelles \\ Belgique | ||
| |} | |} | ||
| - | |||
| - | ==== Grant offers ==== | ||
| - | As part of a new project on quantum communication complexity and quantum cryptographic primitives (such as weak coin flipping), I am looking for one postdoctoral researcher (2-year grant) and one PhD student (1-year grant, with possibility of extension). | ||
| - | |||
| - | Interested applicants can send an email with their resume to jroland (at) ulb.ac.be and are encouraged to have at least 2 letters of recommendation sent to the same address. | ||
| - | |||
| - | Consideration of candidates will be effective immediately and will continue until the positions are filled. | ||
| <html> | <html> | ||
| Line 49: | 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 95: | 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, |
| - | [ <a href="http://arxiv.org/abs/1606.09514">arXiv</a> ] | + | Communication and Cryptography (TQC 2016)</em>, volume 61 of <em>Leibniz |
| + | International Proceedings in Informatics (LIPIcs)</em>, pages 5:1--5:24, 2016. | ||
| + | [ <a href="http://arxiv.org/abs/1606.09514">arXiv</a> | | ||
| + | <a href="http://drops.dagstuhl.de/opus/volltexte/2016/6686">http</a> ] | ||
| </td> | </td> | ||
| </tr> | </tr> | ||
| + | |||