Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
members:jroland [2013/01/07 14:37] jroland |
members:jroland [2015/03/03 17:33] jroland [Teaching] |
||
---|---|---|---|
Line 1: | Line 1: | ||
+ | ~~NOTOC~~ | ||
====== Jérémie Roland ====== | ====== Jérémie Roland ====== | ||
Line 7: | Line 8: | ||
| style="width:541px;"| jroland (at) ulb.ac.be | | style="width:541px;"| jroland (at) ulb.ac.be | ||
|- | |- | ||
- | ! Phone: | + | ! Phone: |
| +32-2-650-28-75 | | +32-2-650-28-75 | ||
|- | |- | ||
Line 17: | Line 18: | ||
|} | |} | ||
- | === Short biography === | + | ==== Short biography ==== |
* Born in Brussels in 1976. | * Born in Brussels in 1976. | ||
* In 1994, he began to study engineering at the [[http://www.ulb.ac.be/|University of Brussels]] (ULB). | * In 1994, he began to study engineering at the [[http://www.ulb.ac.be/|University of Brussels]] (ULB). | ||
Line 30: | Line 31: | ||
* 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]]. | ||
- | === Research interests === | + | ==== Teaching ==== |
+ | * Compléments de programmation et d'algorithmique (INFO-H-304) | ||
+ | * Quantum information and computation (INFO-H-514) | ||
+ | * Examen spécial d'admission en Polytechnique - partie géométrie | ||
+ | * Analyse complexe - exercices (MATH-H-201) | ||
+ | |||
+ | ==== Research interests ==== | ||
* Quantum algorithms | * Quantum algorithms | ||
* Quantum walks | * Quantum walks | ||
Line 36: | Line 43: | ||
* Quantum non-locality | * Quantum non-locality | ||
* Quantum communication complexity | * Quantum communication complexity | ||
+ | * Quantum cryptography | ||
* Quantum query complexity | * Quantum query complexity | ||
- | === Selected talks === | + | ==== Selected talks ==== |
+ | * 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}}] | ||
* Quantum algorithms based on quantum walks. [[http://www-fourier.ujf-grenoble.fr/~joye/quawag/QuaWaG/|Quantum Walks in Grenoble]] (France), November 13-14, 2012. [{{:members:jroland:quawag-grenoble-presentation-handout.pdf|PDF}}] | * Quantum algorithms based on quantum walks. [[http://www-fourier.ujf-grenoble.fr/~joye/quawag/QuaWaG/|Quantum Walks in Grenoble]] (France), November 13-14, 2012. [{{:members:jroland:quawag-grenoble-presentation-handout.pdf|PDF}}] | ||
* Quantum query complexity: Adversaries, polynomials and direct product theorems. [[http://qa2012.iqc.uwaterloo.ca/|Recent Progress in Quantum Algorithms]] at IQC (Waterloo, Canada), April 11-13, 2012. [{{:members:jroland:talk-iqc-pi-workshop-2012-printout.pdf|PDF}} | [[http://www.youtube.com/watch?v=N9BuArGFqjU|Video]]] | * Quantum query complexity: Adversaries, polynomials and direct product theorems. [[http://qa2012.iqc.uwaterloo.ca/|Recent Progress in Quantum Algorithms]] at IQC (Waterloo, Canada), April 11-13, 2012. [{{:members:jroland:talk-iqc-pi-workshop-2012-printout.pdf|PDF}} | [[http://www.youtube.com/watch?v=N9BuArGFqjU|Video]]] | ||
Line 49: | Line 59: | ||
* 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}}] | * 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}}] | ||
- | === Publications === | + | ==== Publications ==== |
<html> | <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/), | (see http://www.lri.fr/~filliatr/bibtex2html/), | ||
with the following command: | with the following command: | ||
Line 63: | Line 72: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR12">1</a>] | + | [<a name="FJKL+15">1</a>] |
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Mathieu Laurière, Sophie | ||
+ | Laplante, and Jérémie Roland. | ||
+ | Relative Discrepancy does not separate Information and Communication | ||
+ | Complexity. | ||
+ | <em>Electronic Colloquium on Computational Complexity</em>, 28, 2015. | ||
+ | [ <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="BR14">2</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Mathieu Brandeho and Jérémie Roland. | ||
+ | A universal adiabatic quantum query algorithm. | ||
+ | <em>arXiv preprint arXiv:1409.3558</em>, 2014. | ||
+ | [ <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="KLL+14">3</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, | ||
+ | and David Xiao. | ||
+ | Lower bounds on information complexity via zero-communication | ||
+ | protocols and applications. | ||
+ | <em>SIAM Journal on Computing</em>, 2014. | ||
+ | To appear. | ||
+ | [ <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="MR13-IJQI">4</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Loïck Magnin and Jérémie Roland. | ||
+ | Explicit relation between all lower bound techniques for quantum | ||
+ | query complexity. | ||
+ | <em>International Journal of Quantum Information</em>, 2013. | ||
+ | Online ready. | ||
+ | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="ORR13">5</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Maris Ozols, Martin Roetteler, and Jérémie Roland. | ||
+ | Quantum rejection sampling. | ||
+ | <em>ACM Transactions on Computation Theory</em>, 5(3):11:1-11:33, 2013. | ||
+ | [ <a href="http://dx.doi.org/10.1145/2493252.2493256">DOI</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="LR13">6</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Troy Lee and Jérémie Roland. | ||
+ | A strong direct product theorem for quantum query complexity. | ||
+ | <em>Computational Complexity</em>, 22(2):429-462, 2013. | ||
+ | [ <a href="http://dx.doi.org/10.1007/s00037-013-0066-8">DOI</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="MR13">7</a>] | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 69: | Line 169: | ||
Explicit relation between all lower bound techniques for quantum | Explicit relation between all lower bound techniques for quantum | ||
query complexity. | query complexity. | ||
- | In <em> 30th International Symposium on Theoretical Aspects of Computer Science (STACS'13)</em>, 2012. | + | In <em>30th International Symposium on Theoretical Aspects of |
- | To appear. | + | Computer Science (STACS'13)</em>, pages 434-445, 2013. |
- | [ <a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2013.434">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] | ||
</td> | </td> | ||
Line 79: | Line 180: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+12">2</a>] | + | [<a name="KLL+12">8</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 88: | Line 189: | ||
In <em>53rd Annual IEEE Symposium on Foundations of Computer Science | In <em>53rd Annual IEEE Symposium on Foundations of Computer Science | ||
(FOCS'12)</em>, pages 500-509, 2012. | (FOCS'12)</em>, pages 500-509, 2012. | ||
- | [ <a href="http://dx.doi.org/10.1109/FOCS.2012.68">DOI</a> |<a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.1109/FOCS.2012.68">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
</td> | </td> | ||
Line 96: | Line 198: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLR12">3</a>] | + | [<a name="LLR12">9</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 113: | Line 215: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR11">4</a>] | + | [<a name="LR11">10</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 129: | Line 231: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR11">5</a>] | + | [<a name="ORR11">11</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 145: | Line 247: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="GRR11">6</a>] | + | [<a name="GRR11">12</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 162: | Line 264: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="AMRR11">7</a>] | + | [<a name="AMRR11">13</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 179: | Line 281: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr11">8</a>] | + | [<a name="dklr11">14</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 194: | Line 296: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs11-sicomp">9</a>] | + | [<a name="mnrs11-sicomp">15</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 210: | Line 312: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr11">10</a>] | + | [<a name="kklr11">16</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 225: | Line 327: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kor10">11</a>] | + | [<a name="kor10">17</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Hari Krovi, Maris Ozols, and Jérémie Roland. | Hari Krovi, Maris Ozols, and Jérémie Roland. | ||
Adiabatic condition and the quantum hitting time of Markov chains. | 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. |
[ <a href="http://dx.doi.org/10.1103/PhysRevA.82.022333">DOI</a> | | [ <a href="http://dx.doi.org/10.1103/PhysRevA.82.022333">DOI</a> | | ||
<a href="http://arxiv.org/abs/1004.2721">arXiv</a> ] | <a href="http://arxiv.org/abs/1004.2721">arXiv</a> ] | ||
Line 240: | Line 342: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kmor10">12</a>] | + | [<a name="kmor10">18</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 257: | Line 359: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr10-pnas">13</a>] | + | [<a name="akr10-pnas">19</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 273: | Line 375: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr09">14</a>] | + | [<a name="kklr09">20</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 291: | Line 393: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr09-arxiv">15</a>] | + | [<a name="akr09-arxiv">21</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 306: | Line 408: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr09">16</a>] | + | [<a name="dklr09">22</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 323: | Line 425: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rs09">17</a>] | + | [<a name="rs09">23</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 339: | Line 441: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="arc06">18</a>] | + | [<a name="arc06">24</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 354: | Line 456: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr06:qudits">19</a>] | + | [<a name="dlr06:qudits">25</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 370: | Line 472: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs06">20</a>] | + | [<a name="mnrs06">26</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 387: | Line 489: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ir06">21</a>] | + | [<a name="ir06">27</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 402: | Line 504: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pisa">22</a>] | + | [<a name="ccmr05:pisa">28</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 422: | Line 524: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dr05">23</a>] | + | [<a name="dr05">29</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 428: | Line 530: | ||
An intuitive approach for the simulation of quantum correlations. | An intuitive approach for the simulation of quantum correlations. | ||
In <em>26th Symposium on Information Theory in the Benelux</em>, 2005. | In <em>26th Symposium on Information Theory in the Benelux</em>, 2005. | ||
- | [ <a href="/~jroland/publications/2005-Proc-IT05.pdf">.pdf</a> ] | + | [ <a href="/_media/members/jroland/publications/2005-proc-it05.pdf">.pdf</a> ] |
</td> | </td> | ||
Line 436: | Line 538: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr05">24</a>] | + | [<a name="dlr05">30</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 451: | Line 553: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pra">25</a>] | + | [<a name="ccmr05:pra">31</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 468: | Line 570: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc05">26</a>] | + | [<a name="rc05">32</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 484: | Line 586: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="roland04">27</a>] | + | [<a name="roland04">33</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 490: | Line 592: | ||
<em>Adiabatic Quantum Computation</em>. | <em>Adiabatic Quantum Computation</em>. | ||
PhD thesis, Université Libre de Bruxelles, 2004. | PhD thesis, Université Libre de Bruxelles, 2004. | ||
- | [ <a href="/~jroland/publications/2004-Thesis-Adiabatic\_Quantum\_Computation.pdf">.pdf</a> ] | + | [ <a href="/_media/members/jroland/2004-thesis.pdf">.pdf</a> ] |
</td> | </td> | ||
Line 498: | Line 600: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03b">28</a>] | + | [<a name="rc03b">34</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 513: | Line 615: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03a">29</a>] | + | [<a name="rc03a">35</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 528: | Line 630: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mprg02">30</a>] | + | [<a name="mprg02">36</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 543: | Line 645: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc02">31</a>] | + | [<a name="rc02">37</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 558: | Line 660: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="hrb02">32</a>] | + | [<a name="hrb02">38</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 569: | Line 671: | ||
</tr> | </tr> | ||
</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.97.</em></p> |
<!-- Site Meter --> | <!-- Site Meter --> |