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 [2015/11/04 09:59] jroland [Teaching] |
members:jroland [2015/11/04 10:07] jroland [Publications] |
||
|---|---|---|---|
| Line 41: | Line 41: | ||
| * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Computing and Complexity Theory | * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Computing and 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 | + | * Analyse complexe (MATH-H-201) - 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 107: | Line 107: | ||
| </td> | </td> | ||
| </tr> | </tr> | ||
| - | |||
| <tr valign="top"> | <tr valign="top"> | ||
| <td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
| - | [<a name="KLL+14">3</a>] | + | [<a name="KLL+14">4</a>] |
| </td> | </td> | ||
| <td class="bibtexitem"> | <td class="bibtexitem"> | ||
| Line 118: | Line 117: | ||
| Lower bounds on information complexity via zero-communication | Lower bounds on information complexity via zero-communication | ||
| protocols and applications. | protocols and applications. | ||
| - | <em>SIAM Journal on Computing</em>, 2015. | + | <em>SIAM Journal on Computing</em>, 44(5):1550--1572, 2015. |
| - | To appear. | + | [ <a href="http://dx.doi.org/10.1137/130928273">DOI</a> | |
| - | [ <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | + | <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] |
| </td> | </td> | ||