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 [2018/06/11 09:20]
jroland [Publications]
members:jroland [2021/09/22 14:27]
jroland [Teaching]
Line 6: Line 6:
 | style="​width:​159px;"​ rowspan="​4"​ | <box w=150px border left>​{{members:​jroland-quic.jpg?​nolink&​150}}</​box> ​ | style="​width:​159px;"​ rowspan="​4"​ | <box w=150px border left>​{{members:​jroland-quic.jpg?​nolink&​150}}</​box> ​
 ! style="​width:​50px;"​| Email: ! style="​width:​50px;"​| Email:
-| style="​width:​541px;"​| ​jroland ​(at) ulb.ac.be+| style="​width:​541px;"​| ​Jeremie.Roland ​(at) ulb.be
 |- |-
 ! Phone: ! Phone:
Line 27: Line 27:
   * -->   * -->
 </​html>​ </​html>​
 +
 +
 ==== Short biography ==== ==== Short biography ====
   * Born in Brussels in 1976.   * Born in Brussels in 1976.
Line 40: Line 42:
  
 ==== Teaching ==== ==== Teaching ====
-  * Compléments de programmation et d'​algorithmique (INFO-H-304) +  * Since 2021 Analyse II (MATH-H-2000) - partim: part b 
-  * Quantum information and computation (INFO-H-514) - partim: Quantum computation +  * Since 2015 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 +  * Since 2013 Compléments de programmation et d'​algorithmique (INFO-H-304) 
-  * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe +  * Since 2012 Quantum information and computation (INFO-H-514) - partim: Quantum computation 
-  * Signaux et Systèmes (MATH-H-3001) - partim: Exercices +  * Since 2012 Examen spécial d'​admission en Polytechnique - Géométrie 
-  * Examen spécial d'​admission en Polytechnique - Géométrie+  * 2016-2021 Signaux et Systèmes ​(MATH-H-3001) - partim: ​Exercices 
 +  * 2015-2021 ​Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe 
 + 
 ==== Research interests ==== ==== Research interests ====
   * Quantum algorithms   * Quantum algorithms
Line 55: Line 60:
   * Quantum cryptographic primitives   * Quantum cryptographic primitives
 ==== Selected talks ==== ==== Selected talks ====
 +  * Finding a marked node on any graph by continuous time quantum walk. [[https://​www.birs.ca/​events/​2019/​5-day-workshops/​19w5146|Quantum Walks and Information Tasks]] in Banff (Canada), April 24, 2019. [{{ :​members:​jroland:​ctqw_search_any_graph-handout.pdf |PDF}} | [[https://​www.birs.ca/​events/​2019/​5-day-workshops/​19w5146/​videos/​watch/​201904241020-Roland.html|Video]]]
 +  * Quantum weak coin flipping. [[https://​uwaterloo.ca/​institute-for-quantum-computing/​|IQC Colloquium at UWaterloo]] (Canada), April 22, 2019. [{{ :​members:​jroland:​iqc-colloquium-04-19-handout.pdf |PDF}} | [[https://​youtu.be/​2tfUBa0eHuU|Video]]]
   * The quantum query complexity of sorting under partial information. [[https://​sites.google.com/​site/​analysisqit2017/​main-events/​conference-on-quantum-information-theory|Conference on "​Quantum Information Theory"​]] at Institut Henri Poincaré (Paris, France), December 11-15,2017. [{{:​members:​jroland:​ihp-quantum-sorting-12-17.pdf |PDF}} | [[https://​youtu.be/​MjKl80JO2wU|Video]]]   * The quantum query complexity of sorting under partial information. [[https://​sites.google.com/​site/​analysisqit2017/​main-events/​conference-on-quantum-information-theory|Conference on "​Quantum Information Theory"​]] at Institut Henri Poincaré (Paris, France), December 11-15,2017. [{{:​members:​jroland:​ihp-quantum-sorting-12-17.pdf |PDF}} | [[https://​youtu.be/​MjKl80JO2wU|Video]]]
   * A universal adiabatic quantum query algorithm. [[http://​www.lorentzcenter.nl/​lc/​web/​2015/​724/​info.php3?​wsid=724&​venue=Snellius|Quantum Random Walks and Quantum Algorithms]],​ Lorentz Center, Leiden (Netherlands),​ December 11, 2015. [{{:​members:​jroland:​qwalks-leiden-2015-handout.pdf|PDF}}]   * A universal adiabatic quantum query algorithm. [[http://​www.lorentzcenter.nl/​lc/​web/​2015/​724/​info.php3?​wsid=724&​venue=Snellius|Quantum Random Walks and Quantum Algorithms]],​ Lorentz Center, Leiden (Netherlands),​ December 11, 2015. [{{:​members:​jroland:​qwalks-leiden-2015-handout.pdf|PDF}}]
Line 71: Line 78:
 ==== Publications ==== ==== Publications ====
 <​html>​ <​html>​
- 
  
  
Line 78: Line 84:
      (see http://​www.lri.fr/​~filliatr/​bibtex2html/​),​      (see http://​www.lri.fr/​~filliatr/​bibtex2html/​),​
      with the following command:      with the following command:
-     ​bibtex2html --no-abstract --nobibsource --nodoc ​-e dklr10 -e mnrs10-sicomp ​-e kor09 -e akr09-tr -e MR11 publications.bib ​ -->+     ​bibtex2html --no-abstract --nobibsource --nodoc -e kor09 -e akr09-tr -e MR11 publications.bib ​ -->
  
  
Line 85: Line 91:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLN+18">​1</a>]+[<a name="​ARV21">​1</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Atul&​nbsp;​Singh Arora, J&​eacute;​r&​eacute;​mie Roland, and Chrysoula Vlachou. 
 + ​Analytic quantum weak coin flipping protocols with arbitrarily small 
 +  bias. 
 + In <​em>​Proceedings of the 2021 ACM-SIAM Symposium on Discrete 
 +  Algorithms (SODA)</​em>,​ pages 919-938, 2021. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1137/​1.9781611976465.58">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1911.13283">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​CNR20b">​2</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Shantanav Chakraborty,​ Leonardo Novo, and J&​eacute;​r&​eacute;​mie Roland. 
 + ​Optimality of spatial search via continuous-time quantum walks. 
 + <​em>​Phys. Rev. A</​em>,​ 102:032214, 2020. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/​PhysRevA.102.032214">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​2004.12686">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​CNR20a">​3</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Shantanav Chakraborty,​ Leonardo Novo, and J&​eacute;​r&​eacute;​mie Roland. 
 + ​Finding a marked node on any graph via continuous-time quantum walks. 
 + <​em>​Phys. Rev. A</​em>,​ 102:022227, 2020. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/​PhysRevA.102.022227">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1807.05957">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​CLR20a">​4</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Shantanav Chakraborty,​ Kyle Luh, and J&​eacute;​r&​eacute;​mie Roland. 
 + ​Analog quantum algorithms for the mixing of markov chains. 
 + <​em>​Physical Review A</​em>,​ 102:022423, 2020. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/​PhysRevA.102.022423">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1904.11895">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​BAKR20">​5</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Kishor Bharti, Atul&​nbsp;​Singh Arora, Leong&​nbsp;​Chuan Kwek, and J&​eacute;​r&​eacute;​mie Roland. 
 + ​Uniqueness of all fundamental noncontextuality inequalities. 
 + <​em>​Physical Review Research</​em>,​ 2:033010, 2020. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/​PhysRevResearch.2.033010">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1811.05294">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​CLR20b">​6</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Shantanav Chakraborty,​ Kyle Luh, and Jérémie Roland. 
 + How fast do quantum walks mix? 
 + <​em>​Physical Review Letters</​em>,​ 124(5):​050501,​ 2020. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1103/​physrevlett.124.050501">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​2001.06305">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​CJR19">​7</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Jean Cardinal, Gwena&​euml;​l Joret, and J&​eacute;​r&​eacute;​mie Roland. 
 + ​Information-theoretic lower bounds for quantum sorting. 
 + <​em>​arXiv e-prints</​em>,​ arXiv:​1902.06473,​ 2019. 
 +[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1902.06473">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​ARW19">​8</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Atul&​nbsp;​Singh Arora, J&​eacute;​r&​eacute;​mie Roland, and Stephan Weis. 
 + ​Quantum weak coin flipping. 
 + In <​em>​51st ACM Symposium on Theory of Computing (STOC'​19)</​em>,​ pages 
 +  205-216, 2019. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​3313276.3316306">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1811.02984">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​LLN+18">​9</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 101: Line 229:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​FJKL+16">​2</a>]+[<a name="​FJKL+16">​10</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 118: Line 246:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLN+16">​3</a>]+[<a name="​LLN+16">​11</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 136: Line 264:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​BR15">​4</a>]+[<a name="​BR15">​12</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 153: Line 281:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KLL+15">​5</a>]+[<a name="​KLL+15">​13</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 170: Line 298:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​FJKL+15">​6</a>]+[<a name="​FJKL+15">​14</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 180: Line 308:
   Programming (ICALP'​15)</​em>,​ volume 9134 of <​em>​Lecture Notes in Computer   Programming (ICALP'​15)</​em>,​ volume 9134 of <​em>​Lecture Notes in Computer
   Science</​em>,​ pages 506-516. Springer, 2015.   Science</​em>,​ pages 506-516. Springer, 2015.
-[&​nbsp;<​a href="​http://​eccc.hpi-web.de/​report/​2015/​028/">​http</​a>&​nbsp;​]+[&nbsp;<a href="​http://​dx.doi.org/​10.1007/​978-3-662-47672-7_41">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​eccc.hpi-web.de/​report/​2015/​028/">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 188: Line 317:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KMOR15">​7</a>]+[<a name="​KMOR15">​15</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 203: Line 332:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​MR15-IJQI">​8</a>]+[<a name="​MR15-IJQI">​16</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 220: Line 349:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ORR13">​9</a>]+[<a name="​ORR13">​17</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 235: Line 364:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LR13">​10</a>]+[<a name="​LR13">​18</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 250: Line 379:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​MR13">​11</a>]+[<a name="​MR13">​19</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 267: Line 396:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KLL+12">​12</a>]+[<a name="​KLL+12">​20</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 285: Line 414:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLR12">​13</a>]+[<a name="​LLR12">​21</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 302: Line 431:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LR11">​14</a>]+[<a name="​LR11">​22</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 318: Line 447:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ORR11">​15</a>]+[<a name="​ORR11">​23</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 334: Line 463:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​GRR11">​16</a>]+[<a name="​GRR11">​24</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 351: Line 480:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​AMRR11">​17</a>]+[<a name="​AMRR11">​25</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 368: Line 497:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr11">​18</a>]+[<a name="​dklr11">​26</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 383: Line 512:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs11-sicomp">​19</a>]+[<a name="​mnrs11-sicomp">​27</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 399: Line 528:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr11">​20</a>]+[<a name="​kklr11">​28</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 414: Line 543:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kor10">​21</a>]+[<a name="​kor10">​29</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 430: Line 559:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kmor10">​22</a>]+[<a name="​kmor10">​30</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 447: Line 576:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr10-pnas">​23</a>]+[<a name="​akr10-pnas">​31</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 463: Line 592:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr09">​24</a>]+[<a name="​kklr09">​32</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 481: Line 610:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr09-arxiv">​25</a>]+[<a name="​akr09-arxiv">​33</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 496: Line 625:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr09">​26</a>]+[<a name="​dklr09">​34</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 513: Line 642:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rs09">​27</a>]+[<a name="​rs09">​35</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 529: Line 658:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​arc06">​28</a>]+[<a name="​arc06">​36</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 544: Line 673:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr06:​qudits">​29</a>]+[<a name="​dlr06:​qudits">​37</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 560: Line 689:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs06">​30</a>]+[<a name="​mnrs06">​38</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 577: Line 706:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ir06">​31</a>]+[<a name="​ir06">​39</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 592: Line 721:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pisa">​32</a>]+[<a name="​ccmr05:​pisa">​40</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 612: Line 741:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dr05">​33</a>]+[<a name="​dr05">​41</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 626: Line 755:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr05">​34</a>]+[<a name="​dlr05">​42</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 641: Line 770:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pra">​35</a>]+[<a name="​ccmr05:​pra">​43</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 658: Line 787:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc05">​36</a>]+[<a name="​rc05">​44</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 674: Line 803:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​roland04">​37</a>]+[<a name="​roland04">​45</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 688: Line 817:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03b">​38</a>]+[<a name="​rc03b">​46</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 703: Line 832:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03a">​39</a>]+[<a name="​rc03a">​47</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 718: Line 847:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mprg02">​40</a>]+[<a name="​mprg02">​48</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 733: Line 862:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc02">​41</a>]+[<a name="​rc02">​49</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 748: Line 877:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​hrb02">​42</a>]+[<a name="​hrb02">​50</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 760: Line 889:
 </​table><​hr><​p><​em>​This file was generated by </​table><​hr><​p><​em>​This file was generated by
 <a href="​http://​www.lri.fr/​~filliatr/​bibtex2html/">​bibtex2html</​a>​ 1.96.</​em></​p>​ <a href="​http://​www.lri.fr/​~filliatr/​bibtex2html/">​bibtex2html</​a>​ 1.96.</​em></​p>​
- 
- 
- 
  
 <!-- Site Meter --> <!-- Site Meter -->