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 [2019/12/12 10:33] jroland [Publications] |
members:jroland [2022/06/24 15:56] jroland [Publications] |
||
---|---|---|---|
Line 6: | Line 6: | ||
| style="width:159px;" rowspan="4" | <box w=150px border left>{{members:jroland-quic.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 42: | 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 78: | Line 81: | ||
- | <!-- This document was automatically generated with bibtex2html 1.96 | + | |
+ | <!-- This document was automatically generated with bibtex2html 1.99 | ||
(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 -e MR11 publications.bib --> | + | bibtex2html --no-abstract --nobibsource --nodoc -e kor09 -e akr09-tr -e MR11 publications.bib --> |
<table> | <table> | ||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="HXA+22">1</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Xiao-Min Hu, Yi Xie, Atul Singh Arora, Ming-Zhong Ai, Kishor Bharti, Jie Zhang, | ||
+ | Wei Wu, Ping-Xing Chen, Jin-Ming Cui, Bi-Heng Liu, Yun-Feng Huang, Chuan-Feng | ||
+ | Li, Guang-Can Guo, Jérémie Roland, Adán Cabello, and Leong-Chuan Kwek. | ||
+ | Self-testing of a single quantum system: Theory and experiment. | ||
+ | <em>arXiv e-prints</em>, arXiv:2203.09003, 2022. | ||
+ | [ <a href="http://dx.doi.org/10.48550/ARXIV.2203.09003">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/2203.09003">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ARV19">1</a>] | + | [<a name="ACNL21">2</a>] |
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Simon Apers, Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. | ||
+ | Quadratic speedup for spatial search by continuous-time quantum walk. | ||
+ | <em>arXiv e-prints</em>, arXiv:2112.12746, 2021. | ||
+ | [ <a href="http://dx.doi.org/10.48550/ARXIV.2112.12746">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/2112.12746">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="ARV21">3</a>] | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Atul Singh Arora, Jérémie Roland, and Chrysoula Vlachou. | Atul Singh Arora, Jérémie Roland, and Chrysoula Vlachou. | ||
- | Explicit quantum weak coin flipping protocols with arbitrarily small | + | Analytic quantum weak coin flipping protocols with arbitrarily small |
bias. | bias. | ||
- | <em>arXiv e-prints</em>, arXiv:1911.13283, 2019. | + | In <em>Proceedings of the 2021 ACM-SIAM Symposium on Discrete |
- | [ <a href="http://arxiv.org/abs/1911.13283">arXiv</a> ] | + | 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> | </td> | ||
Line 104: | Line 141: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="CLR19">1</a>] | + | [<a name="CNR20b">4</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Shantanav Chakraborty, Kyle Luh and Jérémie Roland. | + | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. |
- | On analog quantum algorithms for the mixing of markov chains. | + | Optimality of spatial search via continuous-time quantum walks. |
- | <em>arXiv e-prints</em>, arXiv:1904.11895, 2019. | + | <em>Phys. Rev. A</em>, 102:032214, 2020. |
- | [ <a href="http://arxiv.org/abs/1904.11895">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.032214">DOI</a> | |
+ | <a href="http://arxiv.org/abs/2004.12686">arXiv</a> ] | ||
</td> | </td> | ||
Line 118: | Line 156: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="CJR19">2</a>] | + | [<a name="CNR20a">5</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Jean Cardinal, Gwenaël Joret and Jérémie Roland. | + | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. |
- | Information-theoretic lower bounds for quantum sorting. | + | Finding a marked node on any graph via continuous-time quantum walks. |
- | <em>arXiv e-prints</em>, arXiv:1902.06473, 2019. | + | <em>Phys. Rev. A</em>, 102:022227, 2020. |
- | [ <a href="http://arxiv.org/abs/1902.06473">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.022227">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1807.05957">arXiv</a> ] | ||
</td> | </td> | ||
Line 132: | Line 171: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ARW19">3</a>] | + | [<a name="CLR20a">6</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Atul Singh Arora, Jérémie Roland, and Stephan Weis. | + | Shantanav Chakraborty, Kyle Luh, and Jérémie Roland. |
- | Quantum weak coin flipping. | + | Analog quantum algorithms for the mixing of markov chains. |
- | In <em>51st ACM Symposium on Theory of Computing (STOC'19)</em>, pages | + | <em>Physical Review A</em>, 102:022423, 2020. |
- | 205-216, 2019. | + | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.022423">DOI</a> | |
- | [ <a href="http://dx.doi.org/10.1145/3313276.3316306">DOI</a> | | + | <a href="http://arxiv.org/abs/1904.11895">arXiv</a> ] |
- | <a href="http://arxiv.org/abs/1811.02984">arXiv</a> ] | + | |
</td> | </td> | ||
Line 148: | Line 186: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="BAKR18">4</a>] | + | [<a name="BAKR20">7</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Kishor Bharti, Atul Singh Arora, Leong Chuan Kwek, and Jérémie Roland. | Kishor Bharti, Atul Singh Arora, Leong Chuan Kwek, and Jérémie Roland. | ||
- | A simple proof of uniqueness of the KCBS inequality. | + | Uniqueness of all fundamental noncontextuality inequalities. |
- | <em>arXiv e-prints</em>, arXiv:1811.05294, 2018. | + | <em>Physical Review Research</em>, 2:033010, 2020. |
- | [ <a href="http://arxiv.org/abs/1811.05294">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.1103/PhysRevResearch.2.033010">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1811.05294">arXiv</a> ] | ||
</td> | </td> | ||
Line 162: | Line 201: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="CNR18">5</a>] | + | [<a name="CLR20b">8</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. | + | Shantanav Chakraborty, Kyle Luh, and Jérémie Roland. |
- | Finding a marked node on any graph by continuous time quantum walk. | + | How fast do quantum walks mix? |
- | <em>arXiv e-prints</em>, arXiv:1807.05957, 2018. | + | <em>Physical Review Letters</em>, 124(5):050501, 2020. |
- | [ <a href="http://arxiv.org/abs/1807.05957">arXiv</a> ] | + | [ <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">9</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">10</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> | </td> | ||
Line 176: | Line 246: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLN+18">6</a>] | + | [<a name="LLN+18">11</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 192: | Line 262: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="FJKL+16">7</a>] | + | [<a name="FJKL+16">12</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 199: | Line 269: | ||
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. | 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 209: | Line 279: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLN+16">8</a>] | + | [<a name="LLN+16">13</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 217: | Line 287: | ||
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 227: | Line 297: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="BR15">9</a>] | + | [<a name="BR15">14</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 234: | Line 304: | ||
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 244: | Line 314: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+15">10</a>] | + | [<a name="KLL+15">15</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 251: | Line 321: | ||
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 261: | Line 331: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="FJKL+15">11</a>] | + | [<a name="FJKL+15">16</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 270: | Line 340: | ||
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://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</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> ] | <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | ||
Line 280: | Line 350: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KMOR15">12</a>] | + | [<a name="KMOR15">17</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | ||
Quantum walks can find a marked element on any graph. | Quantum walks can find a marked element on any graph. | ||
- | <em>Algorithmica</em>, 74(2):851-907, 2015. | + | <em>Algorithmica</em>, 74(2):851--907, 2015. |
[ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | ||
<a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | ||
Line 295: | Line 365: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR15-IJQI">13</a>] | + | [<a name="MR15-IJQI">18</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 312: | Line 382: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR13">14</a>] | + | [<a name="ORR13">19</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> ] | <a href="http://arxiv.org/abs/1103.2774">arXiv</a> ] | ||
Line 327: | Line 397: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR13">15</a>] | + | [<a name="LR13">20</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> ] | <a href="http://arxiv.org/abs/1104.4468">arXiv</a> ] | ||
Line 342: | Line 412: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR13">16</a>] | + | [<a name="MR13">21</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 349: | Line 419: | ||
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 359: | Line 429: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+12">17</a>] | + | [<a name="KLL+12">22</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 367: | Line 437: | ||
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 377: | Line 447: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLR12">18</a>] | + | [<a name="LLR12">23</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 384: | Line 454: | ||
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 394: | Line 464: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR11">19</a>] | + | [<a name="LR11">24</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 400: | Line 470: | ||
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 410: | Line 480: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR11">20</a>] | + | [<a name="ORR11">25</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 416: | Line 486: | ||
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 426: | Line 496: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="GRR11">21</a>] | + | [<a name="GRR11">26</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 433: | Line 503: | ||
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 443: | Line 513: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="AMRR11">22</a>] | + | [<a name="AMRR11">27</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 450: | Line 520: | ||
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 460: | Line 530: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr11">23</a>] | + | [<a name="dklr11">28</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 475: | Line 545: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs11-sicomp">24</a>] | + | [<a name="mnrs11-sicomp">29</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 481: | Line 551: | ||
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 491: | Line 561: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr11">25</a>] | + | [<a name="kklr11">30</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 506: | Line 576: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kor10">26</a>] | + | [<a name="kor10">31</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 522: | Line 592: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kmor10">27</a>] | + | [<a name="kmor10">32</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 529: | Line 599: | ||
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 539: | Line 609: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr10-pnas">28</a>] | + | [<a name="akr10-pnas">33</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 545: | Line 615: | ||
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 555: | Line 625: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr09">29</a>] | + | [<a name="kklr09">34</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 562: | Line 632: | ||
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 573: | Line 643: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr09-arxiv">30</a>] | + | [<a name="akr09-arxiv">35</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 588: | Line 658: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr09">31</a>] | + | [<a name="dklr09">36</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 595: | Line 665: | ||
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 605: | Line 675: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rs09">32</a>] | + | [<a name="rs09">37</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 612: | Line 682: | ||
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 621: | Line 691: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="arc06">33</a>] | + | [<a name="arc06">38</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 636: | Line 706: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr06:qudits">34</a>] | + | [<a name="dlr06:qudits">39</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 652: | Line 722: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs06">35</a>] | + | [<a name="mnrs06">40</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 659: | Line 729: | ||
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 669: | Line 739: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ir06">36</a>] | + | [<a name="ir06">41</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 684: | Line 754: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pisa">37</a>] | + | [<a name="ccmr05:pisa">42</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 691: | Line 761: | ||
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 704: | Line 774: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dr05">38</a>] | + | [<a name="dr05">43</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 718: | Line 788: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr05">39</a>] | + | [<a name="dlr05">44</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 733: | Line 803: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pra">40</a>] | + | [<a name="ccmr05:pra">45</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 750: | Line 820: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc05">41</a>] | + | [<a name="rc05">46</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 766: | Line 836: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="roland04">42</a>] | + | [<a name="roland04">47</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 780: | Line 850: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03b">43</a>] | + | [<a name="rc03b">48</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 795: | Line 865: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03a">44</a>] | + | [<a name="rc03a">49</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 810: | Line 880: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mprg02">45</a>] | + | [<a name="mprg02">50</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 825: | Line 895: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc02">46</a>] | + | [<a name="rc02">51</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 840: | Line 910: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="hrb02">47</a>] | + | [<a name="hrb02">52</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 851: | Line 921: | ||
</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.99.</em></p> |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
<!-- Site Meter --> | <!-- Site Meter --> |