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 [2015/11/04 09:59]
jroland [Teaching] 		members:jroland [2015/11/04 10:06]
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 104: Line 104:
  To appear.  To appear.
 [&​nbsp;<​a href="​http://​arxiv.org/​abs/​1409.3558">​arXiv</​a>&​nbsp;​] [&​nbsp;<​a href="​http://​arxiv.org/​abs/​1409.3558">​arXiv</​a>&​nbsp;​]
 +
 +</td>
 +</tr>
 +
 +<tr valign="​top">​
 +<td align="​right"​ class="​bibtexnumber">​
 +[<a name="​KLL+14">​4</​a>​]
 +</td>
 +<td class="​bibtexitem">​
 +Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, J&​eacute;​r&​eacute;​mie Roland,
 +  and David Xiao.
 + Lower bounds on information complexity via zero-communication
 +  protocols and applications.
 + <​em>​SIAM Journal on Computing</​em>,​ 44(5):​1550--1572,​ 2015.
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1137/​130928273">​DOI</​a>&​nbsp;​| ​
 +<a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​]
  
 </td> </td>