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/09/23 10:32] jroland |
members:jroland [2015/03/09 15:33] jroland [Selected talks] |
||
---|---|---|---|
Line 8: | 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 30: | Line 30: | ||
* 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 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]]. | ||
+ | |||
+ | ==== 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 ==== | ==== Research interests ==== | ||
Line 35: | Line 41: | ||
* Quantum walks | * Quantum walks | ||
* Adiabatic quantum computation | * Adiabatic quantum computation | ||
+ | * Quantum query complexity | ||
* Quantum non-locality | * Quantum non-locality | ||
* Quantum communication complexity | * Quantum communication complexity | ||
- | * Quantum query complexity | + | * Quantum cryptographic primitives |
==== 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 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}}] | ||
Line 47: | Line 54: | ||
* 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]]] | * 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://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}}] | * 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}}] | * 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 54: | Line 61: | ||
<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 65: | Line 71: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR13">1</a>] | + | [<a name="KMOR15">1</a>] |
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | ||
+ | Quantum walks can find a marked element on any graph. | ||
+ | <em>Algorithmica</em>, 2015. | ||
+ | Published online. | ||
+ | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="FJKL+15">2</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">3</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">4</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">5</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">6</a>] | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 79: | Line 164: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR13">2</a>] | + | [<a name="LR13">7</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 93: | Line 178: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR13">3</a>] | + | [<a name="MR13">8</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 100: | Line 185: | ||
query complexity. | query complexity. | ||
In <em>30th International Symposium on Theoretical Aspects of | 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. |
[ <a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2013.434">DOI</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> ] | <a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] | ||
Line 110: | Line 195: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+12">4</a>] | + | [<a name="KLL+12">9</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 128: | Line 213: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLR12">5</a>] | + | [<a name="LLR12">10</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 145: | Line 230: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR11">6</a>] | + | [<a name="LR11">11</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 161: | Line 246: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR11">7</a>] | + | [<a name="ORR11">12</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 177: | Line 262: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="GRR11">8</a>] | + | [<a name="GRR11">13</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 194: | Line 279: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="AMRR11">9</a>] | + | [<a name="AMRR11">14</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 211: | Line 296: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr11">10</a>] | + | [<a name="dklr11">15</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 226: | Line 311: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs11-sicomp">11</a>] | + | [<a name="mnrs11-sicomp">16</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 242: | Line 327: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr11">12</a>] | + | [<a name="kklr11">17</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 257: | Line 342: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kor10">13</a>] | + | [<a name="kor10">18</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 272: | Line 357: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kmor10">14</a>] | + | [<a name="kmor10">19</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 289: | Line 374: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr10-pnas">15</a>] | + | [<a name="akr10-pnas">20</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 305: | Line 390: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr09">16</a>] | + | [<a name="kklr09">21</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 323: | Line 408: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr09-arxiv">17</a>] | + | [<a name="akr09-arxiv">22</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 338: | Line 423: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr09">18</a>] | + | [<a name="dklr09">23</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 355: | Line 440: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rs09">19</a>] | + | [<a name="rs09">24</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 371: | Line 456: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="arc06">20</a>] | + | [<a name="arc06">25</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 386: | Line 471: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr06:qudits">21</a>] | + | [<a name="dlr06:qudits">26</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 402: | Line 487: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs06">22</a>] | + | [<a name="mnrs06">27</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 419: | Line 504: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ir06">23</a>] | + | [<a name="ir06">28</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 434: | Line 519: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pisa">24</a>] | + | [<a name="ccmr05:pisa">29</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 454: | Line 539: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dr05">25</a>] | + | [<a name="dr05">30</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 460: | Line 545: | ||
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 468: | Line 553: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr05">26</a>] | + | [<a name="dlr05">31</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 483: | Line 568: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pra">27</a>] | + | [<a name="ccmr05:pra">32</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 500: | Line 585: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc05">28</a>] | + | [<a name="rc05">33</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 516: | Line 601: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="roland04">29</a>] | + | [<a name="roland04">34</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 522: | Line 607: | ||
<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 530: | Line 615: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03b">30</a>] | + | [<a name="rc03b">35</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 545: | Line 630: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03a">31</a>] | + | [<a name="rc03a">36</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 560: | Line 645: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mprg02">32</a>] | + | [<a name="mprg02">37</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 575: | Line 660: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc02">33</a>] | + | [<a name="rc02">38</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 590: | Line 675: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="hrb02">34</a>] | + | [<a name="hrb02">39</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 600: | Line 685: | ||
</td> | </td> | ||
</tr> | </tr> | ||
- | </table><hr><p><em>This file was generated by | + | </table> |
- | <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> | ||