Differences

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

--- members:jroland [2014/08/11 22:39]
zizhu
+++ members:jroland [2018/06/11 09:20]
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
@@ Line 18: / Line 18: @@
 |}
+<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]].
+  * 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 26: / Line 35: @@
   * 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 2006, he was a Postdoctoral Researcher of the Belgian [[http://www.frs-fnrs.be/|FNRS]], based at the University of Brussels.
+  * From January to December 2007, he was a Postdoctoral Researcher of the [[http://www.berkeley.edu/|University of California, Berkeley]], USA.
-  * From January to December 2007, he was a Postdoctoral Researcher of the [[http://www.berkeley.edu/|University of California, Berkeley]].
   * 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)
+  * Quantum information and computation (INFO-H-514) - partim: Quantum computation
+  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Complexity Theory
+  * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe
+  * Signaux et Systèmes (MATH-H-3001) - partim: Exercices
+  * Examen spécial d'admission en Polytechnique - Géométrie
 ==== Research interests ====
   * Quantum algorithms
   * Quantum walks
   * Adiabatic quantum computation
+  * Quantum query complexity
   * Quantum non-locality
   * Quantum communication complexity
-  * Quantum query complexity
+  * Quantum cryptographic primitives
 ==== Selected talks ====
+  * 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 52: / Line 65: @@
   * Finding is as easy as detecting for quantum walks. [[http://qip2011.quantumlah.org/|14th Workshop on Quantum Information Processing]] (QIP'11) in Singapore, January 8-9, 2011. [{{:members:jroland:walks-qip-presentation-printout.pdf|PDF}} | [[http://qip2011.quantumlah.org/scientificprogramme/movie.php?id=1002.2419|Video]]]
   * Anderson localization and adiabatic quantum optimization. [[http://pctp.princeton.edu/pcts/rareevents/rareevents.html|Workshop on Rare Events in Computational, Financial and Physical Sciences]] at Princeton University (USA), October 21-22, 2010. [{{:members:jroland:talk-rare-events-handout.pdf|PDF}}]
-  * Anderson localization and adiabatic quantum optimization. [[http://www.perimeterinstitute.ca/en/Events/Random_Matrix_Techniques_in_Quantum_Information/Random_Matrix_Techniques_in_Quantum_Information_Theory/|Workshop on Random Matrix Techniques in Quantum Information Theory ]] at Perimeter Institute (Waterloo, Canada), July 4-6, 2010. [ [[http://pirsa.org/10070006/|Video]] ]
+  * Anderson localization and adiabatic quantum optimization. [[http://www.perimeterinstitute.ca/conferences/random-matrix-techniques-quantum-information-theory|Workshop on Random Matrix Techniques in Quantum Information Theory ]] at Perimeter Institute (Waterloo, Canada), July 4-6, 2010. [ [[http://pirsa.org/10070006/|Video]] ]
   * The communication complexity of non-signaling distributions. [[http://membres-liglab.imag.fr/degorre/FounQi/|Workshop on Foundational Principles in Quantum Information]] (FounQI'09) in Grenoble (France), June 15-17, 2009. [{{:members:jroland:non-signalling-seminar-handout.pdf|PDF}}]
   * Search via quantum walk. [[http://www2.research.att.com/~dsj/stoc07.html|39th ACM Symposium on Theory of Computing]] (STOC'07) in San Diego (USA), June 11-13, 2007. [{{:members:jroland:stoc-presentation.pdf|PDF}}]
@@ Line 58: / Line 71: @@
 ==== Publications ====
 <html>
@@ Line 63: / Line 78: @@
      (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  -->
@@ Line 70: / Line 85: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">1</a>]
+[<a name="LLN+18">1</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">2</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">3</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="BR15">4</a>]
+</td>
+<td class="bibtexitem">
+Mathieu Brandeho and J&eacute;r&eacute;mie Roland.
+ A universal adiabatic quantum query algorithm.
+ In <em>10th Conference on the Theory of Quantum Computation,
+  Communication and Cryptography (TQC'15)</em>, volume&nbsp;44 of <em>Leibniz
+  International Proceedings in Informatics (LIPIcs)</em>, pages 163-179, 2015.
+[&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+15">5</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>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="FJKL+15">6</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.
+ In <em>42nd International Colloquium on Automata, Languages and
+  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;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="KMOR15">7</a>]
+</td>
+<td class="bibtexitem">
+Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
+ Quantum walks can find a marked element on any graph.
+ <em>Algorithmica</em>, 74(2):851-907, 2015.
+[&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;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="MR15-IJQI">8</a>]
+</td>
+<td class="bibtexitem">
+Lo&iuml;ck Magnin and J&eacute;r&eacute;mie Roland.
+ Explicit relation between all lower bound techniques for quantum
+  query complexity.
+ <em>International Journal of Quantum Information</em>, 13(4):1350059,
+.
+[&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">9</a>]
 </td>
 <td class="bibtexitem">
@@ Line 76: / Line 226: @@
  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 84: / Line 235: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">2</a>]
+[<a name="LR13">10</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 98: / Line 250: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">3</a>]
+[<a name="MR13">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 105: / Line 257: @@
   query complexity.
  In <em>30th International Symposium on Theoretical Aspects of
-  Computer Science (STACS'13)</em>, number arXiv:1209.2713, pages 434-445, 2013.
+  Computer Science (STACS'13)</em>, pages 434-445, 2013.
 [&nbsp;<a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2013.434">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/1209.2713">arXiv</a>&nbsp;]
@@ Line 115: / Line 267: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">4</a>]
+[<a name="KLL+12">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 133: / Line 285: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">5</a>]
+[<a name="LLR12">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 150: / Line 302: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">6</a>]
+[<a name="LR11">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 166: / Line 318: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">7</a>]
+[<a name="ORR11">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 182: / Line 334: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">8</a>]
+[<a name="GRR11">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 199: / Line 351: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">9</a>]
+[<a name="AMRR11">17</a>]
 </td>
 <td class="bibtexitem">
@@ Line 216: / Line 368: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">10</a>]
+[<a name="dklr11">18</a>]
 </td>
 <td class="bibtexitem">
@@ Line 231: / Line 383: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">11</a>]
+[<a name="mnrs11-sicomp">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 247: / Line 399: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">12</a>]
+[<a name="kklr11">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 262: / Line 414: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">13</a>]
+[<a name="kor10">21</a>]
 </td>
 <td class="bibtexitem">
 Hari Krovi, Maris Ozols, and J&eacute;r&eacute;mie Roland.
  Adiabatic condition and the quantum hitting time of Markov chains.
- <em><em>Physical Review A</em></em>, 82(2):022333, 2010.
+ <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 277: / Line 430: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">14</a>]
+[<a name="kmor10">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 294: / Line 447: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">15</a>]
+[<a name="akr10-pnas">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 310: / Line 463: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">16</a>]
+[<a name="kklr09">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 328: / Line 481: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">17</a>]
+[<a name="akr09-arxiv">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 343: / Line 496: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">18</a>]
+[<a name="dklr09">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 360: / Line 513: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">19</a>]
+[<a name="rs09">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 376: / Line 529: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">20</a>]
+[<a name="arc06">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 391: / Line 544: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">21</a>]
+[<a name="dlr06:qudits">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 407: / Line 560: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">22</a>]
+[<a name="mnrs06">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 424: / Line 577: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">23</a>]
+[<a name="ir06">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 439: / Line 592: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">24</a>]
+[<a name="ccmr05:pisa">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 459: / Line 612: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">25</a>]
+[<a name="dr05">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 465: / Line 618: @@
  An intuitive approach for the simulation of quantum correlations.
  In <em>26th Symposium on Information Theory in the Benelux</em>, 2005.
-[&nbsp;<a href="/~jroland/publications/2005-Proc-IT05.pdf">.pdf</a>&nbsp;]
+[&nbsp;<a href="/_media/members/jroland/publications/2005-proc-it05.pdf">.pdf</a>&nbsp;]
 </td>
@@ Line 473: / Line 626: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">26</a>]
+[<a name="dlr05">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 488: / Line 641: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">27</a>]
+[<a name="ccmr05:pra">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 505: / Line 658: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">28</a>]
+[<a name="rc05">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 521: / Line 674: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">29</a>]
+[<a name="roland04">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 527: / Line 680: @@
  <em>Adiabatic Quantum Computation</em>.
  PhD thesis, Universit&eacute; Libre de Bruxelles, 2004.
-[&nbsp;<a href="/~jroland/publications/2004-Thesis-Adiabatic\_Quantum\_Computation.pdf">.pdf</a>&nbsp;]
+[&nbsp;<a href="/_media/members/jroland/2004-thesis.pdf">.pdf</a>&nbsp;]
 </td>
@@ Line 535: / Line 688: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">30</a>]
+[<a name="rc03b">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 550: / Line 703: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">31</a>]
+[<a name="rc03a">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 565: / Line 718: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">32</a>]
+[<a name="mprg02">40</a>]
 </td>
 <td class="bibtexitem">
@@ Line 580: / Line 733: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">33</a>]
+[<a name="rc02">41</a>]
 </td>
 <td class="bibtexitem">
@@ Line 595: / Line 748: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">34</a>]
+[<a name="hrb02">42</a>]
 </td>
 <td class="bibtexitem">
@@ Line 607: / Line 760: @@
 </table><hr><p><em>This file was generated by
 <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.96.</em></p>