Differences

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

--- members:jroland [2015/11/04 10:11]
jroland [Publications]
+++ members:jroland [2020/03/27 16:46]
jroland [Short biography]
@@ 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
@@ Line 18: / Line 18: @@
 |}
-==== News ====
+<html>
-  * From May 20 to 22, 2015, Stefano Pironio and I organize the 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015) in Brussels. More information [[http://tqc2015.ulb.ac.be|here]].
+<!--
+* From May 20 to 22, 2015, Stefano Pironio and I organize the 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015) in Brussels. More information [[http://tqc2015.ulb.ac.be|here]].
   * On May 31, 2015, I will run the 20km of Brussels for [[http://www.medecinsdumonde.be/|Doctors of the World]]. Help me support their action by [[http://www.medecinsdumonde.be/events/20-km-de-bruxelles/j-r-mie_roland|sponsoring my race]].
   * How to separate information and communication complexity? My joint paper with (too many coauthors to list!), which was accepted at [[http://www.kurims.kyoto-u.ac.jp/icalp2015/|ICALP 2015]], takes a fresh look at this problem: [ [[http://eccc.hpi-web.de/report/2015/028/|http]] ]
   * Any query problem can be solved optimally with bounded error by an adiabatic quantum algorithm, as shown in the article I coauthored with my PhD student Mathieu Brandeho, which was accepted at [[http://tqc2015.ulb.ac.be|TQC 2015]]. Congratulations to Mathieu for his first accepted article! [ [[http://arxiv.org/abs/1409.3558|arXiv]] ]
   * Quantum walks can find a marked element on any graph! The original result was obtained in 2010 with my coauthors Hari Krovi, Frédéric Magniez and Maris Ozols, but the full journal article is finally available in Algorithmica: [ [[http://dx.doi.org/10.1007/s00453-015-9979-8|DOI]] | [[http://arxiv.org/abs/1002.2419|arXiv]] ]
+  * -->
+</html>
 ==== Short biography ====
   * Born in Brussels in 1976.
@@ Line 32: / Line 37: @@
   * From 2000 to 2004, he did a PhD thesis at QuIC, where he also worked as a teaching assistant for courses of information theory and quantum physics.
   * From 2004 to 2006, he held a postdoctoral position at the [[http://www.lri.fr/algo/|Laboratoire de Recherche en Informatique]] in Orsay, France.
-  * From January to December 2007, he was a Postdoctoral Researcher of the [[http://www.berkeley.edu/|University of California, Berkeley]].
+  * From January to December 2007, he was a Postdoctoral Researcher of the [[http://www.berkeley.edu/|University of California, Berkeley]], USA.
   * From January to May 2008, he was a Postdoctoral Researcher of the Belgian [[http://www.frs-fnrs.be/|FNRS]], based at the University of Brussels.
-  * From May 2008 to August 2011, he was a Research Staff Member at [[http://www.nec-labs.com/|NEC Laboratories America]].
+  * From May 2008 to August 2011, he was a Research Staff Member at [[http://www.nec-labs.com/|NEC Laboratories America]] in Princeton, USA.
 ==== Teaching ====
   * Compléments de programmation et d'algorithmique (INFO-H-304)
   * 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 (MATH-H-201) - partim: Exercices
+  * Signaux et Systèmes (MATH-H-3001) - partim: Exercices
   * Examen spécial d'admission en Polytechnique - Géométrie
 ==== Research interests ====
@@ Line 52: / Line 57: @@
   * 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}}]
   * Quantum query complexity: Adversaries, polynomials and direct product theorems. [[http://www.maths.bris.ac.uk/~maowg/q-alg-2013/q-alg-2013.html|The 3rd Heilbronn Quantum Algorithms Day]] in Bristol (UK), April 25, 2013. [{{:members:jroland:bristol-algorithm-day-2013-handout.pdf|PDF}}]
@@ Line 67: / Line 76: @@
 <html>
-<!-- This document was automatically generated with bibtex2html 1.97
+<!-- This document was automatically generated with bibtex2html 1.96
      (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 dklr10 -e mnrs10-sicomp -e kor09 -e akr09-tr -e MR11 publications.bib  -->
 <table>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="ARV19">1</a>]
+</td>
+<td class="bibtexitem">
+Atul&nbsp;Singh Arora, J&eacute;r&eacute;mie Roland, and Chrysoula Vlachou.
+ Explicit quantum weak coin flipping protocols with arbitrarily small
+  bias.
+ <em>arXiv e-prints</em>, arXiv:1911.13283, 2019.
+[&nbsp;<a href="http://arxiv.org/abs/1911.13283">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CLR19">1</a>]
+</td>
+<td class="bibtexitem">
+Shantanav&nbsp;Chakraborty, Kyle&nbsp;Luh and J&eacute;r&eacute;mie Roland.
+ On analog quantum algorithms for the mixing of markov chains.
+ <em>arXiv e-prints</em>, arXiv:1904.11895, 2019.
+[&nbsp;<a href="http://arxiv.org/abs/1904.11895">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CJR19">2</a>]
+</td>
+<td class="bibtexitem">
+ Jean&nbsp;Cardinal, Gwena&euml;l&nbsp;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">3</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="BAKR18">4</a>]
+</td>
+<td class="bibtexitem">
+Kishor Bharti, Atul&nbsp;Singh Arora, Leong&nbsp;Chuan Kwek, and J&eacute;r&eacute;mie Roland.
+ A simple proof of uniqueness of the KCBS inequality.
+ <em>arXiv e-prints</em>, arXiv:1811.05294, 2018.
+[&nbsp;<a href="http://arxiv.org/abs/1811.05294">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CNR18">5</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Leonardo Novo, and J&eacute;r&eacute;mie Roland.
+ Finding a marked node on any graph by continuous time quantum walk.
+ <em>arXiv e-prints</em>, arXiv:1807.05957, 2018.
+[&nbsp;<a href="http://arxiv.org/abs/1807.05957">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="LLN+18">6</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">7</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">8</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.
+ In <em>11th Conference on the Theory of Quantum Computation,
+  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>
+</tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR14">1</a>]
+[<a name="BR15">9</a>]
 </td>
 <td class="bibtexitem">
@@ Line 83: / Line 233: @@
  A universal adiabatic quantum query algorithm.
  In <em>10th Conference on the Theory of Quantum Computation,
-  Communication and Cryptography (TQC'15)</em>, 2015.
+  Communication and Cryptography (TQC'15)</em>, volume&nbsp;44 of <em>Leibniz
- To appear.
+  International Proceedings in Informatics (LIPIcs)</em>, pages 163-179, 2015.
-[&nbsp;<a href="http://arxiv.org/abs/1409.3558">arXiv</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.4230/LIPIcs.TQC.2015.163">DOI</a>&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">2</a>]
+[<a name="KLL+15">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 99: / Line 251: @@
  Lower bounds on information complexity via zero-communication
   protocols and applications.
- <em>SIAM Journal on Computing</em>, 44(5):1550--1572, 2015.
+ <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;]
@@ Line 105: / Line 257: @@
 </td>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">3</a>]
+[<a name="FJKL+15">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 118: / Line 271: @@
   Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer
   Science</em>, pages 506-516. Springer, 2015.
-[&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;]
+[&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 126: / Line 280: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13-IJQI">4</a>]
+[<a name="KMOR15">12</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, 2015.
+[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
-[&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;]
+<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
 </td>
@@ Line 141: / Line 295: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">5</a>]
+[<a name="MR15-IJQI">13</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>, 2015.
+  query complexity.
- Published online.
+ <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;]
+[&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>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">6</a>]
+[<a name="ORR13">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 162: / Line 318: @@
  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 170: / Line 327: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">7</a>]
+[<a name="LR13">15</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 184: / Line 342: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">8</a>]
+[<a name="MR13">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 201: / Line 359: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">9</a>]
+[<a name="KLL+12">17</a>]
 </td>
 <td class="bibtexitem">
@@ Line 219: / Line 377: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">10</a>]
+[<a name="LLR12">18</a>]
 </td>
 <td class="bibtexitem">
@@ Line 236: / Line 394: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">11</a>]
+[<a name="LR11">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 252: / Line 410: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">12</a>]
+[<a name="ORR11">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 268: / Line 426: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">13</a>]
+[<a name="GRR11">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 285: / Line 443: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">14</a>]
+[<a name="AMRR11">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 302: / Line 460: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">15</a>]
+[<a name="dklr11">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 317: / Line 475: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">16</a>]
+[<a name="mnrs11-sicomp">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 333: / Line 491: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">17</a>]
+[<a name="kklr11">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 348: / Line 506: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">18</a>]
+[<a name="kor10">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 354: / Line 512: @@
  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 363: / Line 522: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">19</a>]
+[<a name="kmor10">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 380: / Line 539: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">20</a>]
+[<a name="akr10-pnas">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 396: / Line 555: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">21</a>]
+[<a name="kklr09">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 414: / Line 573: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">22</a>]
+[<a name="akr09-arxiv">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 429: / Line 588: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">23</a>]
+[<a name="dklr09">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 446: / Line 605: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">24</a>]
+[<a name="rs09">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 462: / Line 621: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">25</a>]
+[<a name="arc06">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 477: / Line 636: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">26</a>]
+[<a name="dlr06:qudits">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 493: / Line 652: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">27</a>]
+[<a name="mnrs06">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 510: / Line 669: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">28</a>]
+[<a name="ir06">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 525: / Line 684: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">29</a>]
+[<a name="ccmr05:pisa">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 545: / Line 704: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">30</a>]
+[<a name="dr05">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 559: / Line 718: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">31</a>]
+[<a name="dlr05">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 574: / Line 733: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">32</a>]
+[<a name="ccmr05:pra">40</a>]
 </td>
 <td class="bibtexitem">
@@ Line 591: / Line 750: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">33</a>]
+[<a name="rc05">41</a>]
 </td>
 <td class="bibtexitem">
@@ Line 607: / Line 766: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">34</a>]
+[<a name="roland04">42</a>]
 </td>
 <td class="bibtexitem">
@@ Line 621: / Line 780: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">35</a>]
+[<a name="rc03b">43</a>]
 </td>
 <td class="bibtexitem">
@@ Line 636: / Line 795: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">36</a>]
+[<a name="rc03a">44</a>]
 </td>
 <td class="bibtexitem">
@@ Line 651: / Line 810: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">37</a>]
+[<a name="mprg02">45</a>]
 </td>
 <td class="bibtexitem">
@@ Line 666: / Line 825: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">38</a>]
+[<a name="rc02">46</a>]
 </td>
 <td class="bibtexitem">
@@ Line 681: / Line 840: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">39</a>]
+[<a name="hrb02">47</a>]
 </td>
 <td class="bibtexitem">
@@ Line 691: / Line 850: @@
 </td>
 </tr>
-</table>
+</table><hr><p><em>This file was generated by
+<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.96.</em></p>
-<hr><p><em>This file was generated by
-<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p>