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 [2018/01/18 17:00] jroland [Selected talks] |
members:jroland [2021/09/22 14:27] jroland [Teaching] |
||
---|---|---|---|
Line 4: | Line 4: | ||
{| class="portrait" | {| 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:50px;"| Email: | ||
- | | style="width:541px;"| jroland (at) ulb.ac.be | + | | style="width:541px;"| Jeremie.Roland (at) ulb.be |
|- | |- | ||
! Phone: | ! Phone: | ||
Line 27: | Line 27: | ||
* --> | * --> | ||
</html> | </html> | ||
+ | |||
+ | |||
==== Short biography ==== | ==== Short biography ==== | ||
* Born in Brussels in 1976. | * Born in Brussels in 1976. | ||
Line 40: | Line 42: | ||
==== Teaching ==== | ==== Teaching ==== | ||
- | * Compléments de programmation et d'algorithmique (INFO-H-304) | + | * Since 2021 Analyse II (MATH-H-2000) - partim: part b |
- | * Quantum information and computation (INFO-H-514) - partim: Quantum computation | + | * Since 2015 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 | + | * Since 2013 Compléments de programmation et d'algorithmique (INFO-H-304) |
- | * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe | + | * Since 2012 Quantum information and computation (INFO-H-514) - partim: Quantum computation |
- | * Signaux et Systèmes (MATH-H-3001) - partim: Exercices | + | * Since 2012 Examen spécial d'admission en Polytechnique - Géométrie |
- | * Examen spécial d'admission en Polytechnique - Géométrie | + | * 2016-2021 Signaux et Systèmes (MATH-H-3001) - partim: Exercices |
+ | * 2015-2021 Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe | ||
+ | |||
==== Research interests ==== | ==== Research interests ==== | ||
* Quantum algorithms | * Quantum algorithms | ||
Line 55: | Line 60: | ||
* Quantum cryptographic primitives | * Quantum cryptographic primitives | ||
==== Selected talks ==== | ==== 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]]] | * 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}}] | * 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}}] | ||
Line 74: | Line 81: | ||
- | <!-- This document was automatically generated with bibtex2html 1.98 | + | <!-- 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: | ||
- | 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 84: | Line 91: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="FJKL+16">1</a>] | + | [<a name="ARV21">1</a>] |
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Atul Singh Arora, Jérémie Roland, and Chrysoula Vlachou. | ||
+ | Analytic quantum weak coin flipping protocols with arbitrarily small | ||
+ | bias. | ||
+ | In <em>Proceedings of the 2021 ACM-SIAM Symposium on Discrete | ||
+ | Algorithms (SODA)</em>, pages 919-938, 2021. | ||
+ | [ <a href="http://dx.doi.org/10.1137/1.9781611976465.58">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1911.13283">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CNR20b">2</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. | ||
+ | Optimality of spatial search via continuous-time quantum walks. | ||
+ | <em>Phys. Rev. A</em>, 102:032214, 2020. | ||
+ | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.032214">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/2004.12686">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CNR20a">3</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. | ||
+ | Finding a marked node on any graph via continuous-time quantum walks. | ||
+ | <em>Phys. Rev. A</em>, 102:022227, 2020. | ||
+ | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.022227">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1807.05957">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CLR20a">4</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Shantanav Chakraborty, Kyle Luh, and Jérémie Roland. | ||
+ | Analog quantum algorithms for the mixing of markov chains. | ||
+ | <em>Physical Review A</em>, 102:022423, 2020. | ||
+ | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.022423">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1904.11895">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="BAKR20">5</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Kishor Bharti, Atul Singh Arora, Leong Chuan Kwek, and Jérémie Roland. | ||
+ | Uniqueness of all fundamental noncontextuality inequalities. | ||
+ | <em>Physical Review Research</em>, 2:033010, 2020. | ||
+ | [ <a href="http://dx.doi.org/10.1103/PhysRevResearch.2.033010">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1811.05294">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CLR20b">6</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. | ||
+ | [ <a href="http://dx.doi.org/10.1103/physrevlett.124.050501">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/2001.06305">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CJR19">7</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Jean Cardinal, Gwenaël Joret, and Jérémie Roland. | ||
+ | Information-theoretic lower bounds for quantum sorting. | ||
+ | <em>arXiv e-prints</em>, arXiv:1902.06473, 2019. | ||
+ | [ <a href="http://arxiv.org/abs/1902.06473">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="ARW19">8</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Atul Singh Arora, Jérémie Roland, and Stephan Weis. | ||
+ | Quantum weak coin flipping. | ||
+ | In <em>51st ACM Symposium on Theory of Computing (STOC'19)</em>, pages | ||
+ | 205-216, 2019. | ||
+ | [ <a href="http://dx.doi.org/10.1145/3313276.3316306">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1811.02984">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="LLN+18">9</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie | ||
+ | Roland, and Gabriel Senno. | ||
+ | Robust Bell inequalities from communication complexity. | ||
+ | <em>Quantum</em>, 2:72, 2018. | ||
+ | [ <a href="http://dx.doi.org/10.22331/q-2018-06-07-72">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1606.09514">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="FJKL+16">10</a>] | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 91: | Line 236: | ||
Relative discrepancy does not separate information and communication | Relative discrepancy does not separate information and communication | ||
complexity. | complexity. | ||
- | <em>ACM Transactions on Computation Theory</em>, 9(1):4:1--4:15, 2016. | + | <em>ACM Transactions on Computation Theory</em>, 9(1):4:1-4:15, 2016. |
+ | Best of 2016 award. | ||
[ <a href="http://dx.doi.org/10.1145/2967605">DOI</a> ] | [ <a href="http://dx.doi.org/10.1145/2967605">DOI</a> ] | ||
Line 100: | Line 246: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLN+16">2</a>] | + | [<a name="LLN+16">11</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 108: | Line 254: | ||
In <em>11th Conference on the Theory of Quantum Computation, | In <em>11th Conference on the Theory of Quantum Computation, | ||
Communication and Cryptography (TQC 2016)</em>, volume 61 of <em>Leibniz | Communication and Cryptography (TQC 2016)</em>, volume 61 of <em>Leibniz | ||
- | International Proceedings in Informatics (LIPIcs)</em>, pages 5:1--5:24, 2016. | + | International Proceedings in Informatics (LIPIcs)</em>, pages 5:1-5:24, 2016. |
[ <a href="http://arxiv.org/abs/1606.09514">arXiv</a> | | [ <a href="http://arxiv.org/abs/1606.09514">arXiv</a> | | ||
<a href="http://drops.dagstuhl.de/opus/volltexte/2016/6686">http</a> ] | <a href="http://drops.dagstuhl.de/opus/volltexte/2016/6686">http</a> ] | ||
Line 118: | Line 264: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="BR14">3</a>] | + | [<a name="BR15">12</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 125: | Line 271: | ||
In <em>10th Conference on the Theory of Quantum Computation, | In <em>10th Conference on the Theory of Quantum Computation, | ||
Communication and Cryptography (TQC'15)</em>, volume 44 of <em>Leibniz | Communication and Cryptography (TQC'15)</em>, volume 44 of <em>Leibniz | ||
- | International Proceedings in Informatics (LIPIcs)</em>, pages 163--179, 2015. | + | International Proceedings in Informatics (LIPIcs)</em>, pages 163-179, 2015. |
[ <a href="http://dx.doi.org/10.4230/LIPIcs.TQC.2015.163">DOI</a> | | [ <a href="http://dx.doi.org/10.4230/LIPIcs.TQC.2015.163">DOI</a> | | ||
<a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | ||
Line 135: | Line 281: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+14">4</a>] | + | [<a name="KLL+15">13</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 142: | Line 288: | ||
Lower bounds on information complexity via zero-communication | Lower bounds on information complexity via zero-communication | ||
protocols and applications. | 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. |
[ <a href="http://dx.doi.org/10.1137/130928273">DOI</a> | | [ <a href="http://dx.doi.org/10.1137/130928273">DOI</a> | | ||
<a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
Line 152: | Line 298: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="FJKL+15">5</a>] | + | [<a name="FJKL+15">14</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 161: | Line 307: | ||
In <em>42nd International Colloquium on Automata, Languages and | In <em>42nd International Colloquium on Automata, Languages and | ||
Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer | Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer | ||
- | Science</em>, pages 506--516. Springer, 2015. | + | Science</em>, pages 506-516. Springer, 2015. |
- | [ <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | + | [ <a href="http://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</a> | |
+ | <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | ||
</td> | </td> | ||
Line 170: | Line 317: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR15-IJQI">6</a>] | + | [<a name="KMOR15">15</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Loïck Magnin and Jérémie Roland. | + | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jéré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, | + | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | |
- | 2015. | + | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] |
- | Online ready. | + | |
- | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | + | |
</td> | </td> | ||
Line 187: | Line 332: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KMOR15">7</a>] | + | [<a name="MR15-IJQI">16</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | + | Loïck Magnin and Jérémie Roland. |
- | Quantum walks can find a marked element on any graph. | + | Explicit relation between all lower bound techniques for quantum |
- | <em>Algorithmica</em>, 74(2):851--907, 2015. | + | query complexity. |
- | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | + | <em>International Journal of Quantum Information</em>, 13(4):1350059, |
- | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | + | 2015. |
+ | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] | ||
</td> | </td> | ||
Line 202: | Line 349: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR13">8</a>] | + | [<a name="ORR13">17</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Maris Ozols, Martin Roetteler, and Jérémie Roland. | Maris Ozols, Martin Roetteler, and Jérémie Roland. | ||
Quantum rejection sampling. | Quantum rejection sampling. | ||
- | <em>ACM Transactions on Computation Theory</em>, 5(3):11:1--11:33, 2013. | + | <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> ] | + | [ <a href="http://dx.doi.org/10.1145/2493252.2493256">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1103.2774">arXiv</a> ] | ||
</td> | </td> | ||
Line 216: | Line 364: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR13">9</a>] | + | [<a name="LR13">18</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Troy Lee and Jérémie Roland. | + | Troy Lee and Jérémie Roland. |
A strong direct product theorem for quantum query complexity. | A strong direct product theorem for quantum query complexity. | ||
- | <em>Computational Complexity</em>, 22(2):429--462, 2013. | + | <em>Computational Complexity</em>, 22(2):429-462, 2013. |
- | [ <a href="http://dx.doi.org/10.1007/s00037-013-0066-8">DOI</a> ] | + | [ <a href="http://dx.doi.org/10.1007/s00037-013-0066-8">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1104.4468">arXiv</a> ] | ||
</td> | </td> | ||
Line 230: | Line 379: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR13">10</a>] | + | [<a name="MR13">19</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 237: | Line 386: | ||
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>, 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 247: | Line 396: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+12">11</a>] | + | [<a name="KLL+12">20</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 255: | Line 404: | ||
protocols and applications. | protocols and applications. | ||
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://dx.doi.org/10.1109/FOCS.2012.68">DOI</a> | | ||
<a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
Line 265: | Line 414: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLR12">12</a>] | + | [<a name="LLR12">21</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 272: | Line 421: | ||
In <em>39th International Colloquium on Automata, Languages and | In <em>39th International Colloquium on Automata, Languages and | ||
Programming (ICALP'12)</em>, volume 7391 of <em>Lecture Notes in Computer | Programming (ICALP'12)</em>, volume 7391 of <em>Lecture Notes in Computer | ||
- | Science</em>, pages 617--628. Springer, 2012. | + | Science</em>, pages 617-628. Springer, 2012. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-31594-7_52">DOI</a> | | [ <a href="http://dx.doi.org/10.1007/978-3-642-31594-7_52">DOI</a> | | ||
<a href="http://arxiv.org/abs/1203.4155">arXiv</a> ] | <a href="http://arxiv.org/abs/1203.4155">arXiv</a> ] | ||
Line 282: | Line 431: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR11">13</a>] | + | [<a name="LR11">22</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 288: | Line 437: | ||
A strong direct product theorem for quantum query complexity. | A strong direct product theorem for quantum query complexity. | ||
In <em>27th IEEE Conference on Computational Complexity (CCC'12)</em>, | In <em>27th IEEE Conference on Computational Complexity (CCC'12)</em>, | ||
- | pages 236--246. IEEE, 2012. | + | pages 236-246. IEEE, 2012. |
[ <a href="http://dx.doi.org/10.1109/CCC.2012.17">DOI</a> | | [ <a href="http://dx.doi.org/10.1109/CCC.2012.17">DOI</a> | | ||
<a href="http://arxiv.org/abs/1104.4468">arXiv</a> ] | <a href="http://arxiv.org/abs/1104.4468">arXiv</a> ] | ||
Line 298: | Line 447: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR11">14</a>] | + | [<a name="ORR11">23</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 304: | Line 453: | ||
Quantum rejection sampling. | Quantum rejection sampling. | ||
In <em>3rd Conference on Innovations in Theoretical Computer Science | In <em>3rd Conference on Innovations in Theoretical Computer Science | ||
- | (ITCS'12)</em>, pages 290--308. ACM Press, 2012. | + | (ITCS'12)</em>, pages 290-308. ACM Press, 2012. |
[ <a href="http://dx.doi.org/10.1145/2090236.2090261">DOI</a> | | [ <a href="http://dx.doi.org/10.1145/2090236.2090261">DOI</a> | | ||
<a href="http://arxiv.org/abs/1103.2774">arXiv</a> ] | <a href="http://arxiv.org/abs/1103.2774">arXiv</a> ] | ||
Line 314: | Line 463: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="GRR11">15</a>] | + | [<a name="GRR11">24</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 321: | Line 470: | ||
In <em>17th International Computing & Combinatorics Conference | In <em>17th International Computing & Combinatorics Conference | ||
(COCOON'11)</em>, volume 6842 of <em>Lecture Notes in Computer Science</em>, pages | (COCOON'11)</em>, volume 6842 of <em>Lecture Notes in Computer Science</em>, pages | ||
- | 158--167. Springer, 2011. | + | 158-167. Springer, 2011. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-22685-4_14">DOI</a> | | [ <a href="http://dx.doi.org/10.1007/978-3-642-22685-4_14">DOI</a> | | ||
<a href="http://arxiv.org/abs/1103.3017">arXiv</a> ] | <a href="http://arxiv.org/abs/1103.3017">arXiv</a> ] | ||
Line 331: | Line 480: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="AMRR11">16</a>] | + | [<a name="AMRR11">25</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 338: | Line 487: | ||
Symmetry-assisted adversaries for quantum state generation. | Symmetry-assisted adversaries for quantum state generation. | ||
In <em>26th IEEE Conference on Computational Complexity (CCC'11)</em>, | In <em>26th IEEE Conference on Computational Complexity (CCC'11)</em>, | ||
- | pages 167--177, 2011. | + | pages 167-177, 2011. |
[ <a href="http://dx.doi.org/10.1109/CCC.2011.24">DOI</a> | | [ <a href="http://dx.doi.org/10.1109/CCC.2011.24">DOI</a> | | ||
<a href="http://arxiv.org/abs/1012.2112">arXiv</a> ] | <a href="http://arxiv.org/abs/1012.2112">arXiv</a> ] | ||
Line 348: | Line 497: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr11">17</a>] | + | [<a name="dklr11">26</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Julien Degorre, Marc Kaplan, Sophie Laplante, and Jérémie Roland. | Julien Degorre, Marc Kaplan, Sophie Laplante, and Jérémie Roland. | ||
The communication complexity of non-signaling distributions. | The communication complexity of non-signaling distributions. | ||
- | <em>Quantum Information & Computation</em>, 11(7&8):649--676, 2011. | + | <em>Quantum Information & Computation</em>, 11(7&8):649-676, 2011. |
[ <a href="http://arxiv.org/abs/0804.4859">arXiv</a> | | [ <a href="http://arxiv.org/abs/0804.4859">arXiv</a> | | ||
<a href="http://www.rintonpress.com/journals/qiconline.html#v11n78">http</a> ] | <a href="http://www.rintonpress.com/journals/qiconline.html#v11n78">http</a> ] | ||
Line 363: | Line 512: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs11-sicomp">18</a>] | + | [<a name="mnrs11-sicomp">27</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 369: | Line 518: | ||
Santha. | Santha. | ||
Search via quantum walk. | Search via quantum walk. | ||
- | <em>SIAM Journal on Computing</em>, 40(1):142--164, 2011. | + | <em>SIAM Journal on Computing</em>, 40(1):142-164, 2011. |
[ <a href="http://dx.doi.org/10.1137/090745854">DOI</a> | | [ <a href="http://dx.doi.org/10.1137/090745854">DOI</a> | | ||
<a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a> ] | <a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a> ] | ||
Line 379: | Line 528: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr11">19</a>] | + | [<a name="kklr11">28</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland. | Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland. | ||
Non-local box complexity and secure function evaluation. | Non-local box complexity and secure function evaluation. | ||
- | <em>Quantum Information & Computation</em>, 11(1&2):40--69, 2011. | + | <em>Quantum Information & Computation</em>, 11(1&2):40-69, 2011. |
[ <a href="http://arxiv.org/abs/0903.2179">arXiv</a> | | [ <a href="http://arxiv.org/abs/0903.2179">arXiv</a> | | ||
<a href="http://www.rintonpress.com/journals/qiconline.html#v11n12">http</a> ] | <a href="http://www.rintonpress.com/journals/qiconline.html#v11n12">http</a> ] | ||
Line 394: | Line 543: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kor10">20</a>] | + | [<a name="kor10">29</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 400: | Line 549: | ||
Adiabatic condition and the quantum hitting time of Markov chains. | Adiabatic condition and the quantum hitting time of Markov chains. | ||
<em>Physical Review A</em>, 82(2):022333, 2010. | <em>Physical Review A</em>, 82(2):022333, 2010. | ||
+ | Highlighted in the online APS Journal <em>Physics</em>. | ||
[ <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 409: | Line 559: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kmor10">21</a>] | + | [<a name="kmor10">30</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 416: | Line 566: | ||
In <em>37th International Colloquium on Automata, Languages and | In <em>37th International Colloquium on Automata, Languages and | ||
Programming (ICALP'10)</em>, volume 6198 of <em>Lecture Notes in Computer | Programming (ICALP'10)</em>, volume 6198 of <em>Lecture Notes in Computer | ||
- | Science</em>, pages 540--551. Springer, 2010. | + | Science</em>, pages 540-551. Springer, 2010. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-14165-2_46">DOI</a> | | [ <a href="http://dx.doi.org/10.1007/978-3-642-14165-2_46">DOI</a> | | ||
<a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | ||
Line 426: | Line 576: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr10-pnas">22</a>] | + | [<a name="akr10-pnas">31</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 432: | Line 582: | ||
Anderson localization makes adiabatic quantum optimization fail. | Anderson localization makes adiabatic quantum optimization fail. | ||
<em><em>Proceedings of the National Academy of Sciences of the | <em><em>Proceedings of the National Academy of Sciences of the | ||
- | United States of America</em></em>, 107(28):12446--12450, 2010. | + | United States of America</em></em>, 107(28):12446-12450, 2010. |
[ <a href="http://dx.doi.org/10.1073/pnas.1002116107">DOI</a> | | [ <a href="http://dx.doi.org/10.1073/pnas.1002116107">DOI</a> | | ||
<a href="http://arxiv.org/abs/0912.0746">arXiv</a> ] | <a href="http://arxiv.org/abs/0912.0746">arXiv</a> ] | ||
Line 442: | Line 592: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr09">23</a>] | + | [<a name="kklr09">32</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 449: | Line 599: | ||
In <em>IARCS Annual Conference on Foundations of Software Technology | In <em>IARCS Annual Conference on Foundations of Software Technology | ||
and Theoretical Computer Science (FSTTCS'09)</em>, volume 4 of <em>Leibniz | and Theoretical Computer Science (FSTTCS'09)</em>, volume 4 of <em>Leibniz | ||
- | International Proceedings in Informatics (LIPICs)</em>, pages 239--250. Schloss | + | International Proceedings in Informatics (LIPICs)</em>, pages 239-250. Schloss |
Dagstuhl, 2009. | Dagstuhl, 2009. | ||
[ <a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2009.2322">DOI</a> | | [ <a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2009.2322">DOI</a> | | ||
Line 460: | Line 610: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr09-arxiv">24</a>] | + | [<a name="akr09-arxiv">33</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 475: | Line 625: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr09">25</a>] | + | [<a name="dklr09">34</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 482: | Line 632: | ||
In <em>34th International Symposium on Mathematical Foundations of | In <em>34th International Symposium on Mathematical Foundations of | ||
Computer Science (MFCS'09)</em>, volume 5734 of <em>Lecture Notes in Computer | Computer Science (MFCS'09)</em>, volume 5734 of <em>Lecture Notes in Computer | ||
- | Science</em>, pages 270--281. Springer, 2009. | + | Science</em>, pages 270-281. Springer, 2009. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-03816-7_24">DOI</a> | | [ <a href="http://dx.doi.org/10.1007/978-3-642-03816-7_24">DOI</a> | | ||
<a href="http://arxiv.org/abs/0804.4859">arXiv</a> ] | <a href="http://arxiv.org/abs/0804.4859">arXiv</a> ] | ||
Line 492: | Line 642: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rs09">26</a>] | + | [<a name="rs09">35</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 499: | Line 649: | ||
In <em>36th International Colloquium on Automata, Languages and | In <em>36th International Colloquium on Automata, Languages and | ||
Programming (ICALP'09)</em>, volume 5555 of <em>Lecture Notes in Computer | Programming (ICALP'09)</em>, volume 5555 of <em>Lecture Notes in Computer | ||
- | Science</em>, pages 738--749. Springer, 2009. | + | Science</em>, pages 738-749. Springer, 2009. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-02927-1_61">DOI</a> ] | [ <a href="http://dx.doi.org/10.1007/978-3-642-02927-1_61">DOI</a> ] | ||
Line 508: | Line 658: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="arc06">27</a>] | + | [<a name="arc06">36</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Olga Lopez Acevedo, Jérémie Roland, and Nicolas J. Cerf. | Olga Lopez Acevedo, Jérémie Roland, and Nicolas J. Cerf. | ||
Exploring scalar quantum walks on Cayley graphs. | Exploring scalar quantum walks on Cayley graphs. | ||
- | <em>Quantum Information & Computation</em>, 8(1&2):68--81, 2008. | + | <em>Quantum Information & Computation</em>, 8(1&2):68-81, 2008. |
[ <a href="http://arxiv.org/abs/quant-ph/0609234">arXiv</a> | | [ <a href="http://arxiv.org/abs/quant-ph/0609234">arXiv</a> | | ||
<a href="http://www.rintonpress.com/journals/qiconline.html#v8n12">http</a> ] | <a href="http://www.rintonpress.com/journals/qiconline.html#v8n12">http</a> ] | ||
Line 523: | Line 673: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr06:qudits">28</a>] | + | [<a name="dlr06:qudits">37</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 539: | Line 689: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs06">29</a>] | + | [<a name="mnrs06">38</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 546: | Line 696: | ||
Search via quantum walk. | Search via quantum walk. | ||
In <em>39th ACM Symposium on Theory of Computing (STOC'07)</em>, pages | In <em>39th ACM Symposium on Theory of Computing (STOC'07)</em>, pages | ||
- | 575--584, 2007. | + | 575-584, 2007. |
[ <a href="http://dx.doi.org/10.1145/1250790.1250874">DOI</a> | | [ <a href="http://dx.doi.org/10.1145/1250790.1250874">DOI</a> | | ||
<a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a> ] | <a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a> ] | ||
Line 556: | Line 706: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ir06">30</a>] | + | [<a name="ir06">39</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Sofyan Iblisdir and Jérémie Roland. | Sofyan Iblisdir and Jérémie Roland. | ||
Optimal finite measurements and Gauss quadratures. | Optimal finite measurements and Gauss quadratures. | ||
- | <em>Physics Letters A</em>, 358(5-6):368--372, 2006. | + | <em>Physics Letters A</em>, 358(5-6):368-372, 2006. |
[ <a href="http://dx.doi.org/doi:10.1016/j.physleta.2006.05.045">DOI</a> | | [ <a href="http://dx.doi.org/doi:10.1016/j.physleta.2006.05.045">DOI</a> | | ||
<a href="http://arxiv.org/abs/quant-ph/0410237">arXiv</a> ] | <a href="http://arxiv.org/abs/quant-ph/0410237">arXiv</a> ] | ||
Line 571: | Line 721: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pisa">31</a>] | + | [<a name="ccmr05:pisa">40</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 578: | Line 728: | ||
Information transmission via entangled quantum states in Gaussian | Information transmission via entangled quantum states in Gaussian | ||
channels with memory. | channels with memory. | ||
- | <em>International Journal of Quantum Information</em>, 4(3):439--452, | + | <em>International Journal of Quantum Information</em>, 4(3):439-452, |
2006. | 2006. | ||
Proceedings of the International Workshop “Quantum Entanglement in | Proceedings of the International Workshop “Quantum Entanglement in | ||
- | Physical and Information Sciences” (December 14--18, 2004, Pisa, Italy). | + | Physical and Information Sciences” (December 14-18, 2004, Pisa, Italy). |
[ <a href="http://dx.doi.org/doi:10.1142/S021974990600189X">DOI</a> | | [ <a href="http://dx.doi.org/doi:10.1142/S021974990600189X">DOI</a> | | ||
<a href="http://arxiv.org/abs/quant-ph/0508197">arXiv</a> ] | <a href="http://arxiv.org/abs/quant-ph/0508197">arXiv</a> ] | ||
Line 591: | Line 741: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dr05">32</a>] | + | [<a name="dr05">41</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 605: | Line 755: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr05">33</a>] | + | [<a name="dlr05">42</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 620: | Line 770: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pra">34</a>] | + | [<a name="ccmr05:pra">43</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 637: | Line 787: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc05">35</a>] | + | [<a name="rc05">44</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 653: | Line 803: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="roland04">36</a>] | + | [<a name="roland04">45</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 667: | Line 817: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03b">37</a>] | + | [<a name="rc03b">46</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 682: | Line 832: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03a">38</a>] | + | [<a name="rc03a">47</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 697: | Line 847: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mprg02">39</a>] | + | [<a name="mprg02">48</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 712: | Line 862: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc02">40</a>] | + | [<a name="rc02">49</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 727: | Line 877: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="hrb02">41</a>] | + | [<a name="hrb02">50</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Michel Hesse, Jérémie Roland, and Daniel Baye. | Michel Hesse, Jérémie Roland, and Daniel Baye. | ||
Solving the resonating-group equation on a Lagrange mesh. | Solving the resonating-group equation on a Lagrange mesh. | ||
- | <em>Nuclear Physics A</em>, 709:184--200, 2002. | + | <em>Nuclear Physics A</em>, 709:184-200, 2002. |
[ <a href="http://dx.doi.org/10.1016/S0375-9474(02)01040-0">DOI</a> ] | [ <a href="http://dx.doi.org/10.1016/S0375-9474(02)01040-0">DOI</a> ] | ||
Line 738: | Line 888: | ||
</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.98.</em></p> | + | <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.96.</em></p> |
- | + | ||
<!-- Site Meter --> | <!-- Site Meter --> |