Differences

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

--- members:jroland [2015/04/15 14:40]
jroland [Short biography]
+++ members:jroland [2020/07/03 15:50]
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: @@
 |}
-==== 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)
+  * Quantum information and computation (INFO-H-514) - partim: Quantum computation
-  * Examen spécial d'admission en Polytechnique - partie géométrie
+  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Complexity Theory
-  * Analyse complexe - exercices (MATH-H-201)
+  * 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
@@ Line 51: / 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 66: / 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 kor09 -e akr09-tr -e MR11 publications.bib  -->
@@ Line 76: / Line 87: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">1</a>]
+[<a name="BAKR20">1</a>]
 </td>
 <td class="bibtexitem">
-Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
+Kishor Bharti, Atul&nbsp;Singh Arora, Leong&nbsp;Chuan Kwek, and J&eacute;r&eacute;mie Roland.
- Quantum walks can find a marked element on any graph.
+ Uniqueness of all fundamental noncontextuality inequalities.
- <em>Algorithmica</em>, 2015.
+ <em>Physical Review Research</em>, 2:033010, 2020.
- Published online.
+[&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevResearch.2.033010">DOI</a>&nbsp;|
-[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1811.05294">arXiv</a>&nbsp;]
-<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
 </td>
@@ Line 92: / Line 102: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">2</a>]
+[<a name="CNR20">2</a>]
 </td>
 <td class="bibtexitem">
-Lila Fontes, Rahul Jain, Iordanis Kerenidis, Mathieu Lauri&egrave;re, Sophie
+Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland.
-  Laplante, and J&eacute;r&eacute;mie Roland.
+ On the optimality of spatial search by continuous-time quantum walk.
- Relative Discrepancy does not separate Information and Communication
+ <em>arXiv e-prints</em>, arXiv:2004.12686, 2020.
-  Complexity.
+[&nbsp;<a href="http://arxiv.org/abs/2004.12686">arXiv</a>&nbsp;]
- <em>Electronic Colloquium on Computational Complexity</em>, 28, 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="CLR20">3</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="ARV19">4</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">5</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Kyle 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">6</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">7</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="CNR18">8</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">9</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">10</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">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.
+ 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>
@@ Line 108: / Line 255: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR14">3</a>]
+[<a name="BR15">12</a>]
 </td>
 <td class="bibtexitem">
 Mathieu Brandeho and J&eacute;r&eacute;mie Roland.
  A universal adiabatic quantum query algorithm.
- <em>arXiv preprint arXiv:1409.3558</em>, 2014.
+ In <em>10th Conference on the Theory of Quantum Computation,
-[&nbsp;<a href="http://arxiv.org/abs/1409.3558">arXiv</a>&nbsp;]
+  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>
@@ Line 122: / Line 272: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">4</a>]
+[<a name="KLL+15">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 129: / Line 279: @@
  Lower bounds on information complexity via zero-communication
   protocols and applications.
- <em>SIAM Journal on Computing</em>, 2014.
+ <em>SIAM Journal on Computing</em>, 44(5):1550-1572, 2015.
- To appear.
+[&nbsp;<a href="http://dx.doi.org/10.1137/130928273">DOI</a>&nbsp;|
-[&nbsp;<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
+<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
 </td>
@@ Line 139: / Line 289: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13-IJQI">5</a>]
+[<a name="FJKL+15">14</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://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>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="KMOR15">15</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">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 145: / Line 329: @@
  Explicit relation between all lower bound techniques for quantum
   query complexity.
- <em>International Journal of Quantum Information</em>, 2013.
+ <em>International Journal of Quantum Information</em>, 13(4):1350059,
- Online ready.
+.
-[&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</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 155: / Line 340: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">6</a>]
+[<a name="ORR13">17</a>]
 </td>
 <td class="bibtexitem">
@@ Line 161: / Line 346: @@
  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 169: / Line 355: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">7</a>]
+[<a name="LR13">18</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 183: / Line 370: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">8</a>]
+[<a name="MR13">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 200: / Line 387: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">9</a>]
+[<a name="KLL+12">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 218: / Line 405: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">10</a>]
+[<a name="LLR12">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 235: / Line 422: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">11</a>]
+[<a name="LR11">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 251: / Line 438: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">12</a>]
+[<a name="ORR11">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 267: / Line 454: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">13</a>]
+[<a name="GRR11">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 284: / Line 471: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">14</a>]
+[<a name="AMRR11">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 301: / Line 488: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">15</a>]
+[<a name="dklr11">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 316: / Line 503: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">16</a>]
+[<a name="mnrs11-sicomp">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 332: / Line 519: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">17</a>]
+[<a name="kklr11">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 347: / Line 534: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">18</a>]
+[<a name="kor10">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 353: / Line 540: @@
  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 362: / Line 550: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">19</a>]
+[<a name="kmor10">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 379: / Line 567: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">20</a>]
+[<a name="akr10-pnas">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 395: / Line 583: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">21</a>]
+[<a name="kklr09">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 413: / Line 601: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">22</a>]
+[<a name="akr09-arxiv">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 428: / Line 616: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">23</a>]
+[<a name="dklr09">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 445: / Line 633: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">24</a>]
+[<a name="rs09">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 461: / Line 649: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">25</a>]
+[<a name="arc06">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 476: / Line 664: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">26</a>]
+[<a name="dlr06:qudits">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 492: / Line 680: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">27</a>]
+[<a name="mnrs06">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 509: / Line 697: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">28</a>]
+[<a name="ir06">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 524: / Line 712: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">29</a>]
+[<a name="ccmr05:pisa">40</a>]
 </td>
 <td class="bibtexitem">
@@ Line 544: / Line 732: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">30</a>]
+[<a name="dr05">41</a>]
 </td>
 <td class="bibtexitem">
@@ Line 558: / Line 746: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">31</a>]
+[<a name="dlr05">42</a>]
 </td>
 <td class="bibtexitem">
@@ Line 573: / Line 761: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">32</a>]
+[<a name="ccmr05:pra">43</a>]
 </td>
 <td class="bibtexitem">
@@ Line 590: / Line 778: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">33</a>]
+[<a name="rc05">44</a>]
 </td>
 <td class="bibtexitem">
@@ Line 606: / Line 794: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">34</a>]
+[<a name="roland04">45</a>]
 </td>
 <td class="bibtexitem">
@@ Line 620: / Line 808: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">35</a>]
+[<a name="rc03b">46</a>]
 </td>
 <td class="bibtexitem">
@@ Line 635: / Line 823: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">36</a>]
+[<a name="rc03a">47</a>]
 </td>
 <td class="bibtexitem">
@@ Line 650: / Line 838: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">37</a>]
+[<a name="mprg02">48</a>]
 </td>
 <td class="bibtexitem">
@@ Line 665: / Line 853: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">38</a>]
+[<a name="rc02">49</a>]
 </td>
 <td class="bibtexitem">
@@ Line 680: / Line 868: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">39</a>]
+[<a name="hrb02">50</a>]
 </td>
 <td class="bibtexitem">
@@ Line 690: / Line 878: @@
 </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>