iweb visitor

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision 		Previous revision
Next revision Both sides next revision
members:jroland [2021/01/26 18:10]
jroland [Publications] 		members:jroland [2022/05/20 09:16]
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:
Line 88: Line 92:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="ARV21">​1</​a>​]+[<a name="HXA+22">1</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Simon Apers, Shantanav Chakraborty,​ Leonardo Novo, and Jérémie Roland. 
 + ​Self-testing of a single quantum system: Theory and experiment. 
 + <​em>​arXiv e-prints</​em>,​ arXiv:​2203.09003,​ 2022. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.48550/​ARXIV.2203.09003">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​2203.09003">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<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. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.48550/​ARXIV.2112.12746">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​2112.12746">​arXiv</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​ARV21">​3</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 95: Line 129:
   bias.   bias.
  In <​em>​Proceedings of the 2021 ACM-SIAM Symposium on Discrete  In <​em>​Proceedings of the 2021 ACM-SIAM Symposium on Discrete
-  Algorithms (SODA)</​em>,​ pages 919-938, 2021.+  Algorithms (SODA)</​em>,​ pages 919--938, 2021.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1137/​1.9781611976465.58">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1137/​1.9781611976465.58">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1911.13283">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1911.13283">​arXiv</​a>&​nbsp;​]
Line 105: Line 139:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​CNR20b">​2</a>]+[<a name="​CNR20b">​4</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 120: Line 154:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​CNR20a">​3</a>]+[<a name="​CNR20a">​5</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 135: Line 169:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​CLR20a">​4</a>]+[<a name="​CLR20a">​6</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 150: Line 184:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​BAKR20">​5</a>]+[<a name="​BAKR20">​7</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 165: Line 199:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​CLR20b">​6</a>]+[<a name="​CLR20b">​8</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 180: Line 214:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​CJR19">​7</a>]+[<a name="​CJR19">​9</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 194: Line 228:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ARW19">​8</a>]+[<a name="​ARW19">​10</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 200: Line 234:
  ​Quantum weak coin flipping.  ​Quantum weak coin flipping.
  In <​em>​51st ACM Symposium on Theory of Computing (STOC'​19)</​em>,​ pages  In <​em>​51st ACM Symposium on Theory of Computing (STOC'​19)</​em>,​ pages
-  205-216, 2019.+  205--216, 2019.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​3313276.3316306">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​3313276.3316306">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1811.02984">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1811.02984">​arXiv</​a>&​nbsp;​]
Line 210: Line 244:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLN+18">​9</a>]+[<a name="​LLN+18">​11</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 226: Line 260:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​FJKL+16">​10</a>]+[<a name="​FJKL+16">​12</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 233: Line 267:
  ​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​2967605">​DOI</​a>&​nbsp;​] [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​2967605">​DOI</​a>&​nbsp;​]
Line 243: Line 277:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLN+16">​11</a>]+[<a name="​LLN+16">​13</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 251: Line 285:
  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&​nbsp;​61 of <​em>​Leibniz   Communication and Cryptography (TQC 2016)</​em>,​ volume&​nbsp;​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.
 [&​nbsp;<​a href="​http://​arxiv.org/​abs/​1606.09514">​arXiv</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​arxiv.org/​abs/​1606.09514">​arXiv</​a>&​nbsp;​| ​
 <a href="​http://​drops.dagstuhl.de/​opus/​volltexte/​2016/​6686">​http</​a>&​nbsp;​] <a href="​http://​drops.dagstuhl.de/​opus/​volltexte/​2016/​6686">​http</​a>&​nbsp;​]
Line 261: Line 295:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​BR15">​12</a>]+[<a name="​BR15">​14</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 268: Line 302:
  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&​nbsp;​44 of <​em>​Leibniz   Communication and Cryptography (TQC'​15)</​em>,​ volume&​nbsp;​44 of <​em>​Leibniz
-  International Proceedings in Informatics (LIPIcs)</​em>,​ pages 163-179, 2015.+  International Proceedings in Informatics (LIPIcs)</​em>,​ pages 163--179, 2015.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.4230/​LIPIcs.TQC.2015.163">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.4230/​LIPIcs.TQC.2015.163">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1409.3558">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1409.3558">​arXiv</​a>&​nbsp;​]
Line 278: Line 312:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KLL+15">​13</a>]+[<a name="​KLL+15">​15</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 285: Line 319:
  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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1137/​130928273">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1137/​130928273">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​]
Line 295: Line 329:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​FJKL+15">​14</a>]+[<a name="​FJKL+15">​16</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 304: Line 338:
  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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-662-47672-7_41">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-662-47672-7_41">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​eccc.hpi-web.de/​report/​2015/​028/">​http</​a>&​nbsp;​] <a href="​http://​eccc.hpi-web.de/​report/​2015/​028/">​http</​a>&​nbsp;​]
Line 314: Line 348:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KMOR15">​15</a>]+[<a name="​KMOR15">​17</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Hari Krovi, Fr&​eacute;​d&​eacute;​ric Magniez, Maris Ozols, and J&​eacute;​r&​eacute;​mie Roland. Hari Krovi, Fr&​eacute;​d&​eacute;​ric Magniez, Maris Ozols, and J&​eacute;​r&​eacute;​mie Roland.
  ​Quantum walks can find a marked element on any graph.  ​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​s00453-015-9979-8">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​s00453-015-9979-8">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1002.2419">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1002.2419">​arXiv</​a>&​nbsp;​]
Line 329: Line 363:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​MR15-IJQI">​16</a>]+[<a name="​MR15-IJQI">​18</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 346: Line 380:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ORR13">​17</a>]+[<a name="​ORR13">​19</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Maris Ozols, Martin Roetteler, and J&​eacute;​r&​eacute;​mie Roland. Maris Ozols, Martin Roetteler, and J&​eacute;​r&​eacute;​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​2493252.2493256">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​2493252.2493256">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1103.2774">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1103.2774">​arXiv</​a>&​nbsp;​]
Line 361: Line 395:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LR13">​18</a>]+[<a name="​LR13">​20</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Troy Lee and J&​eacute;​r&​eacute;​mie Roland. Troy Lee and J&​eacute;​r&​eacute;​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​s00037-013-0066-8">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​s00037-013-0066-8">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1104.4468">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1104.4468">​arXiv</​a>&​nbsp;​]
Line 376: Line 410:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​MR13">​19</a>]+[<a name="​MR13">​21</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 383: Line 417:
   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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.4230/​LIPIcs.STACS.2013.434">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.4230/​LIPIcs.STACS.2013.434">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1209.2713">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1209.2713">​arXiv</​a>&​nbsp;​]
Line 393: Line 427:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KLL+12">​20</a>]+[<a name="​KLL+12">​22</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 401: Line 435:
   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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1109/​FOCS.2012.68">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1109/​FOCS.2012.68">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​]
Line 411: Line 445:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLR12">​21</a>]+[<a name="​LLR12">​23</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 418: Line 452:
  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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-31594-7_52">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-31594-7_52">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1203.4155">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1203.4155">​arXiv</​a>&​nbsp;​]
Line 428: Line 462:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LR11">​22</a>]+[<a name="​LR11">​24</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 434: Line 468:
  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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1109/​CCC.2012.17">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1109/​CCC.2012.17">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1104.4468">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1104.4468">​arXiv</​a>&​nbsp;​]
Line 444: Line 478:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ORR11">​23</a>]+[<a name="​ORR11">​25</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 450: Line 484:
  ​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​2090236.2090261">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​2090236.2090261">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1103.2774">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1103.2774">​arXiv</​a>&​nbsp;​]
Line 460: Line 494:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​GRR11">​24</a>]+[<a name="​GRR11">​26</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 467: Line 501:
  In <​em>​17th International Computing &amp; Combinatorics Conference  In <​em>​17th International Computing &amp; 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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-22685-4_14">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-22685-4_14">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1103.3017">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1103.3017">​arXiv</​a>&​nbsp;​]
Line 477: Line 511:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​AMRR11">​25</a>]+[<a name="​AMRR11">​27</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 484: Line 518:
  ​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1109/​CCC.2011.24">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1109/​CCC.2011.24">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1012.2112">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1012.2112">​arXiv</​a>&​nbsp;​]
Line 494: Line 528:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr11">​26</a>]+[<a name="​dklr11">​28</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Julien Degorre, Marc Kaplan, Sophie Laplante, and J&​eacute;​r&​eacute;​mie Roland. Julien Degorre, Marc Kaplan, Sophie Laplante, and J&​eacute;​r&​eacute;​mie Roland.
  The communication complexity of non-signaling distributions.  The communication complexity of non-signaling distributions.
- <​em>​Quantum Information &amp; Computation</​em>,​ 11(7&​amp;​8):​649-676,​ 2011.+ <​em>​Quantum Information &amp; Computation</​em>,​ 11(7&​amp;​8):​649--676, 2011.
 [&​nbsp;<​a href="​http://​arxiv.org/​abs/​0804.4859">​arXiv</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​arxiv.org/​abs/​0804.4859">​arXiv</​a>&​nbsp;​| ​
 <a href="​http://​www.rintonpress.com/​journals/​qiconline.html#​v11n78">​http</​a>&​nbsp;​] <a href="​http://​www.rintonpress.com/​journals/​qiconline.html#​v11n78">​http</​a>&​nbsp;​]
Line 509: Line 543:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs11-sicomp">​27</a>]+[<a name="​mnrs11-sicomp">​29</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 515: Line 549:
   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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1137/​090745854">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1137/​090745854">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​quant-ph/​0608026">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​quant-ph/​0608026">​arXiv</​a>&​nbsp;​]
Line 525: Line 559:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr11">​28</a>]+[<a name="​kklr11">​30</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and J&​eacute;​r&​eacute;​mie Roland. Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and J&​eacute;​r&​eacute;​mie Roland.
  ​Non-local box complexity and secure function evaluation.  ​Non-local box complexity and secure function evaluation.
- <​em>​Quantum Information &amp; Computation</​em>,​ 11(1&​amp;​2):​40-69,​ 2011.+ <​em>​Quantum Information &amp; Computation</​em>,​ 11(1&​amp;​2):​40--69, 2011.
 [&​nbsp;<​a href="​http://​arxiv.org/​abs/​0903.2179">​arXiv</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​arxiv.org/​abs/​0903.2179">​arXiv</​a>&​nbsp;​| ​
 <a href="​http://​www.rintonpress.com/​journals/​qiconline.html#​v11n12">​http</​a>&​nbsp;​] <a href="​http://​www.rintonpress.com/​journals/​qiconline.html#​v11n12">​http</​a>&​nbsp;​]
Line 540: Line 574:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kor10">​29</a>]+[<a name="​kor10">​31</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 556: Line 590:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kmor10">​30</a>]+[<a name="​kmor10">​32</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 563: Line 597:
  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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-14165-2_46">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-14165-2_46">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1002.2419">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1002.2419">​arXiv</​a>&​nbsp;​]
Line 573: Line 607:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr10-pnas">​31</a>]+[<a name="​akr10-pnas">​33</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 579: Line 613:
  ​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1073/​pnas.1002116107">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1073/​pnas.1002116107">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​0912.0746">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​0912.0746">​arXiv</​a>&​nbsp;​]
Line 589: Line 623:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr09">​32</a>]+[<a name="​kklr09">​34</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 596: Line 630:
  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&​nbsp;​4 of <​em>​Leibniz   and Theoretical Computer Science (FSTTCS'​09)</​em>,​ volume&​nbsp;​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.4230/​LIPIcs.FSTTCS.2009.2322">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.4230/​LIPIcs.FSTTCS.2009.2322">​DOI</​a>&​nbsp;​| ​
Line 607: Line 641:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr09-arxiv">​33</a>]+[<a name="​akr09-arxiv">​35</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 622: Line 656:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr09">​34</a>]+[<a name="​dklr09">​36</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 629: Line 663:
  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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-03816-7_24">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-03816-7_24">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​0804.4859">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​0804.4859">​arXiv</​a>&​nbsp;​]
Line 639: Line 673:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rs09">​35</a>]+[<a name="​rs09">​37</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 646: Line 680:
  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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-02927-1_61">​DOI</​a>&​nbsp;​] [&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-02927-1_61">​DOI</​a>&​nbsp;​]
  
Line 655: Line 689:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​arc06">​36</a>]+[<a name="​arc06">​38</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Olga&​nbsp;​Lopez Acevedo, J&​eacute;​r&​eacute;​mie Roland, and Nicolas&​nbsp;​J. Cerf. Olga&​nbsp;​Lopez Acevedo, J&​eacute;​r&​eacute;​mie Roland, and Nicolas&​nbsp;​J. Cerf.
  ​Exploring scalar quantum walks on Cayley graphs.  ​Exploring scalar quantum walks on Cayley graphs.
- <​em>​Quantum Information &amp; Computation</​em>,​ 8(1&​amp;​2):​68-81,​ 2008.+ <​em>​Quantum Information &amp; Computation</​em>,​ 8(1&​amp;​2):​68--81, 2008.
 [&​nbsp;<​a href="​http://​arxiv.org/​abs/​quant-ph/​0609234">​arXiv</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​arxiv.org/​abs/​quant-ph/​0609234">​arXiv</​a>&​nbsp;​| ​
 <a href="​http://​www.rintonpress.com/​journals/​qiconline.html#​v8n12">​http</​a>&​nbsp;​] <a href="​http://​www.rintonpress.com/​journals/​qiconline.html#​v8n12">​http</​a>&​nbsp;​]
Line 670: Line 704:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr06:​qudits">​37</a>]+[<a name="​dlr06:​qudits">​39</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 686: Line 720:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs06">​38</a>]+[<a name="​mnrs06">​40</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 693: Line 727:
  ​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​1250790.1250874">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1145/​1250790.1250874">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​quant-ph/​0608026">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​quant-ph/​0608026">​arXiv</​a>&​nbsp;​]
Line 703: Line 737:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ir06">​39</a>]+[<a name="​ir06">​41</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Sofyan Iblisdir and J&​eacute;​r&​eacute;​mie Roland. Sofyan Iblisdir and J&​eacute;​r&​eacute;​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.
 [&​nbsp;<​a href="​http://​dx.doi.org/​doi:​10.1016/​j.physleta.2006.05.045">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​doi:​10.1016/​j.physleta.2006.05.045">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​quant-ph/​0410237">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​quant-ph/​0410237">​arXiv</​a>&​nbsp;​]
Line 718: Line 752:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pisa">​40</a>]+[<a name="​ccmr05:​pisa">​42</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 725: Line 759:
  ​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 &​ldquo;​Quantum Entanglement in  ​Proceedings of the International Workshop &​ldquo;​Quantum Entanglement in
-  Physical and Information Sciences&​rdquo;​ (December 14-18, 2004, Pisa, Italy).+  Physical and Information Sciences&​rdquo;​ (December 14--18, 2004, Pisa, Italy).
 [&​nbsp;<​a href="​http://​dx.doi.org/​doi:​10.1142/​S021974990600189X">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​doi:​10.1142/​S021974990600189X">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​quant-ph/​0508197">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​quant-ph/​0508197">​arXiv</​a>&​nbsp;​]
Line 738: Line 772:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dr05">​41</a>]+[<a name="​dr05">​43</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 752: Line 786:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr05">​42</a>]+[<a name="​dlr05">​44</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 767: Line 801:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pra">​43</a>]+[<a name="​ccmr05:​pra">​45</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 784: Line 818:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc05">​44</a>]+[<a name="​rc05">​46</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 800: Line 834:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​roland04">​45</a>]+[<a name="​roland04">​47</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 814: Line 848:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03b">​46</a>]+[<a name="​rc03b">​48</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 829: Line 863:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03a">​47</a>]+[<a name="​rc03a">​49</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 844: Line 878:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mprg02">​48</a>]+[<a name="​mprg02">​50</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 859: Line 893:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc02">​49</a>]+[<a name="​rc02">​51</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 874: Line 908:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​hrb02">​50</a>]+[<a name="​hrb02">​52</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Michel Hesse, J&​eacute;​r&​eacute;​mie Roland, and Daniel Baye. Michel Hesse, J&​eacute;​r&​eacute;​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&​nbsp;​A</​em>,​ 709:​184-200,​ 2002.+ <​em>​Nuclear Physics&​nbsp;​A</​em>,​ 709:184--200, 2002.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1016/​S0375-9474(02)01040-0">​DOI</​a>&​nbsp;​] [&​nbsp;<​a href="​http://​dx.doi.org/​10.1016/​S0375-9474(02)01040-0">​DOI</​a>&​nbsp;​]
  
Line 885: Line 919:
 </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 -->