Differences

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

--- members:jroland [2016/09/12 10:01]
jroland
+++ members:jroland [2022/10/17 09:11]
jroland [Publications]
@@ Line 4: / Line 4: @@
 {| class="portrait"
 |-
-| style="width:159px;" rowspan="4" | <box w=150px border left>{{members:jroland:jroland.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:541px;"| jroland (at) ulb.ac.be
+| style="width:541px;"| Jeremie.Roland (at) ulb.be
 |-
 ! Phone:
@@ Line 27: / Line 27: @@
   * -->
 </html>
 ==== Short biography ====
   * Born in Brussels in 1976.
@@ Line 40: / Line 42: @@
 ==== 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: Computing and 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
-  * Analyse complexe (MATH-H-201) - 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 ====
   * Quantum algorithms
@@ Line 55: / Line 60: @@
   * Quantum cryptographic primitives
 ==== 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]]]
   * 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}}]
   * Quantum algorithms based on quantum walks. [[https://uwaterloo.ca/institute-for-quantum-computing/|IQC Colloquium at UWaterloo]] (Canada), July 28, 2014. [{{:members:jroland:IQC-colloquium-08-2014-handout.pdf|PDF}}]
@@ Line 72: / Line 80: @@
-<!-- This document was automatically generated with bibtex2html 1.98
+<!-- This document was automatically generated with bibtex2html 1.99
      (see http://www.lri.fr/~filliatr/bibtex2html/),
      with the following command:
-     bibtex2html --no-abstract --nobibsource --nodoc -e dklr10 -e mnrs10-sicomp -e kor09 -e akr09-tr publications.bib  -->
+     bibtex2html --no-abstract --nobibsource --nodoc -e kor09 -e akr09-tr -e MR11 publications.bib  -->
@@ Line 82: / Line 92: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLN+16">1</a>]
+[<a name="HXA+22">1</a>]
+</td>
+<td class="bibtexitem">
+Xiao-Min Hu, Yi&nbsp;Xie, Atul&nbsp;Singh Arora, Ming-Zhong Ai, Kishor Bharti, Jie Zhang,
+  Wei Wu, Ping-Xing Chen, Jin-Ming Cui, Bi-Heng Liu, Yun-Feng Huang, Chuan-Feng
+  Li, Guang-Can Guo, Jérémie Roland, Adán Cabello, and Leong-Chuan Kwek.
+ Self-testing of a single quantum system: Theory and experiment.
+ <em>arXiv e-prints</em>, arXiv:2203.09003, 2022.
+[&nbsp;<a href="http://dx.doi.org/10.48550/ARXIV.2203.09003">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/2203.09003">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="ACNL22">2</a>]
+</td>
+<td class="bibtexitem">
+Simon Apers, Shantanav Chakraborty, Leonardo Novo, and J&eacute;r&eacute;mie Roland.
+ Quadratic speedup for spatial search by continuous-time quantum walk.
+ <em>Phys. Rev. Lett.</em>, 129:160502, 2022.
+[&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevLett.129.160502">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/2112.12746">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="ARV21">3</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">4</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">5</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">6</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">7</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">8</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">9</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">10</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
+--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">11</a>]
+</td>
+<td class="bibtexitem">
+Sophie Laplante, Mathieu Lauri&egrave;re, Alexandre Nolin, J&eacute;r&eacute;mie
+  Roland, and Gabriel Senno.
+ Robust Bell inequalities from communication complexity.
+ <em>Quantum</em>, 2:72, 2018.
+[&nbsp;<a href="http://dx.doi.org/10.22331/q-2018-06-07-72">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1606.09514">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="FJKL+16">12</a>]
+</td>
+<td class="bibtexitem">
+Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu
+  Lauri&egrave;re, and J&eacute;r&eacute;mie Roland.
+ Relative discrepancy does not separate information and communication
+  complexity.
+ <em>ACM Transactions on Computation Theory</em>, 9(1):4:1--4:15, 2016.
+ Best of 2016 award.
+[&nbsp;<a href="http://dx.doi.org/10.1145/2967605">DOI</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="LLN+16">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 88: / Line 284: @@
   and Gabriel Senno.
  Robust Bell inequalities from communication complexity.
-.
+ 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>
@@ Line 97: / Line 296: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR14">2</a>]
+[<a name="BR15">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 114: / Line 313: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">3</a>]
+[<a name="KLL+15">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 131: / Line 330: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">4</a>]
+[<a name="FJKL+15">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 141: / Line 340: @@
   Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer
   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>
@@ Line 149: / Line 349: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR15-IJQI">5</a>]
+[<a name="KMOR15">17</a>]
 </td>
 <td class="bibtexitem">
-Lo&iuml;ck Magnin and J&eacute;r&eacute;mie Roland.
+Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
- Explicit relation between all lower bound techniques for quantum
+ Quantum walks can find a marked element on any graph.
-  query complexity.
+ <em>Algorithmica</em>, 74(2):851--907, 2015.
- <em>International Journal of Quantum Information</em>, 13(4):1350059,
+[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
-.
+<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
- Online ready.
-[&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;]
 </td>
@@ Line 166: / Line 364: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">6</a>]
+[<a name="MR15-IJQI">18</a>]
 </td>
 <td class="bibtexitem">
-Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
+Lo&iuml;ck Magnin and J&eacute;r&eacute;mie Roland.
- Quantum walks can find a marked element on any graph.
+ Explicit relation between all lower bound techniques for quantum
- <em>Algorithmica</em>, 74(2):851--907, 2015.
+  query complexity.
-[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
+ <em>International Journal of Quantum Information</em>, 13(4):1350059,
-<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
+.
+[&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1209.2713">arXiv</a>&nbsp;]
 </td>
@@ Line 181: / Line 381: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">7</a>]
+[<a name="ORR13">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 187: / Line 387: @@
  Quantum rejection sampling.
  <em>ACM Transactions on Computation Theory</em>, 5(3):11:1--11:33, 2013.
-[&nbsp;<a href="http://dx.doi.org/10.1145/2493252.2493256">DOI</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.1145/2493252.2493256">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1103.2774">arXiv</a>&nbsp;]
 </td>
@@ Line 195: / Line 396: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">8</a>]
+[<a name="LR13">20</a>]
 </td>
 <td class="bibtexitem">
-Troy Lee and Jérémie Roland.
+Troy Lee and J&eacute;r&eacute;mie Roland.
  A strong direct product theorem for quantum query complexity.
  <em>Computational Complexity</em>, 22(2):429--462, 2013.
-[&nbsp;<a href="http://dx.doi.org/10.1007/s00037-013-0066-8">DOI</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.1007/s00037-013-0066-8">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1104.4468">arXiv</a>&nbsp;]
 </td>
@@ Line 209: / Line 411: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">9</a>]
+[<a name="MR13">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 226: / Line 428: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">10</a>]
+[<a name="KLL+12">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 244: / Line 446: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">11</a>]
+[<a name="LLR12">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 261: / Line 463: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">12</a>]
+[<a name="LR11">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 277: / Line 479: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">13</a>]
+[<a name="ORR11">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 293: / Line 495: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">14</a>]
+[<a name="GRR11">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 310: / Line 512: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">15</a>]
+[<a name="AMRR11">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 327: / Line 529: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">16</a>]
+[<a name="dklr11">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 342: / Line 544: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">17</a>]
+[<a name="mnrs11-sicomp">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 358: / Line 560: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">18</a>]
+[<a name="kklr11">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 373: / Line 575: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">19</a>]
+[<a name="kor10">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 379: / Line 581: @@
  Adiabatic condition and the quantum hitting time of Markov chains.
  <em>Physical Review A</em>, 82(2):022333, 2010.
+ Highlighted in the online APS Journal <em>Physics</em>.
 [&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevA.82.022333">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/1004.2721">arXiv</a>&nbsp;]
@@ Line 388: / Line 591: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">20</a>]
+[<a name="kmor10">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 405: / Line 608: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">21</a>]
+[<a name="akr10-pnas">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 421: / Line 624: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">22</a>]
+[<a name="kklr09">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 439: / Line 642: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">23</a>]
+[<a name="akr09-arxiv">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 454: / Line 657: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">24</a>]
+[<a name="dklr09">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 471: / Line 674: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">25</a>]
+[<a name="rs09">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 487: / Line 690: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">26</a>]
+[<a name="arc06">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 502: / Line 705: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">27</a>]
+[<a name="dlr06:qudits">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 518: / Line 721: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">28</a>]
+[<a name="mnrs06">40</a>]
 </td>
 <td class="bibtexitem">
@@ Line 535: / Line 738: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">29</a>]
+[<a name="ir06">41</a>]
 </td>
 <td class="bibtexitem">
@@ Line 550: / Line 753: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">30</a>]
+[<a name="ccmr05:pisa">42</a>]
 </td>
 <td class="bibtexitem">
@@ Line 570: / Line 773: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">31</a>]
+[<a name="dr05">43</a>]
 </td>
 <td class="bibtexitem">
@@ Line 584: / Line 787: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">32</a>]
+[<a name="dlr05">44</a>]
 </td>
 <td class="bibtexitem">
@@ Line 599: / Line 802: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">33</a>]
+[<a name="ccmr05:pra">45</a>]
 </td>
 <td class="bibtexitem">
@@ Line 616: / Line 819: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">34</a>]
+[<a name="rc05">46</a>]
 </td>
 <td class="bibtexitem">
@@ Line 632: / Line 835: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">35</a>]
+[<a name="roland04">47</a>]
 </td>
 <td class="bibtexitem">
@@ Line 646: / Line 849: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">36</a>]
+[<a name="rc03b">48</a>]
 </td>
 <td class="bibtexitem">
@@ Line 661: / Line 864: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">37</a>]
+[<a name="rc03a">49</a>]
 </td>
 <td class="bibtexitem">
@@ Line 676: / Line 879: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">38</a>]
+[<a name="mprg02">50</a>]
 </td>
 <td class="bibtexitem">
@@ Line 691: / Line 894: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">39</a>]
+[<a name="rc02">51</a>]
 </td>
 <td class="bibtexitem">
@@ Line 706: / Line 909: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">40</a>]
+[<a name="hrb02">52</a>]
 </td>
 <td class="bibtexitem">
@@ Line 717: / Line 920: @@
 </tr>
 </table><hr><p><em>This file was generated by
-<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.98.</em></p>
+<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.99.</em></p>
 <!-- Site Meter -->