Differences

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

--- members:jroland [2015/06/30 15:45]
jroland [Publications]
+++ members:jroland [2015/12/15 17:38]
jroland [Selected talks]
@@ Line 38: / Line 38: @@
 ==== Teaching ====
   * Compléments de programmation et d'algorithmique (INFO-H-304)
-  * Quantum information and computation (INFO-H-514)
+  * Quantum information and computation (INFO-H-514) - partim: Quantum computation
-  * Examen spécial d'admission en Polytechnique - partie géométrie
+  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Computing and Complexity Theory
-  * Analyse complexe - exercices (MATH-H-201)
+  * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe
+  * Analyse complexe (MATH-H-201) - partim: Exercices
+  * Examen spécial d'admission en Polytechnique - Géométrie
 ==== Research interests ====
   * Quantum algorithms
@@ Line 51: / Line 52: @@
   * Quantum cryptographic primitives
 ==== Selected talks ====
+  * 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}}]
   * Quantum algorithms based on quantum walks. [[https://uwaterloo.ca/institute-for-quantum-computing/|IQC Colloquium at UWaterloo]] (Canada), July 28, 2014. [{{:members:jroland:IQC-colloquium-08-2014-handout.pdf|PDF}}]
   * Quantum query complexity: Adversaries, polynomials and direct product theorems. [[http://www.maths.bris.ac.uk/~maowg/q-alg-2013/q-alg-2013.html|The 3rd Heilbronn Quantum Algorithms Day]] in Bristol (UK), April 25, 2013. [{{:members:jroland:bristol-algorithm-day-2013-handout.pdf|PDF}}]
@@ Line 76: / Line 78: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">1</a>]
+[<a name="BR14">1</a>]
-</td>
-<td class="bibtexitem">
-Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu
-  Lauri&egrave;re, and J&eacute;r&eacute;mie Roland.
- Relative Discrepancy does not separate Information and Communication
-  Complexity.
- In <em>42nd International Colloquium on Automata, Languages and
-  Programming (ICALP'15)</em>, 2015.
- To appear.
-[&nbsp;<a href="http://eccc.hpi-web.de/report/2015/028/">http</a>&nbsp;]
-</td>
-</tr>
-<tr valign="top">
-<td align="right" class="bibtexnumber">
-[<a name="BR14">2</a>]
 </td>
 <td class="bibtexitem">
@@ Line 106: / Line 90: @@
 </td>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">3</a>]
+[<a name="KLL+14">2</a>]
 </td>
 <td class="bibtexitem">
@@ Line 117: / Line 100: @@
  Lower bounds on information complexity via zero-communication
   protocols and applications.
- <em>SIAM Journal on Computing</em>, 2015.
+ <em>SIAM Journal on Computing</em>, 44(5):1550--1572, 2015.
- To appear.
+[&nbsp;<a href="http://dx.doi.org/10.1137/130928273">DOI</a>&nbsp;|
-[&nbsp;<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
+<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
 </td>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">4</a>]
+[<a name="FJKL+15">3</a>]
 </td>
 <td class="bibtexitem">
-Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
+Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu
- Quantum walks can find a marked element on any graph.
+  Lauri&egrave;re, and J&eacute;r&eacute;mie Roland.
- <em>Algorithmica</em>, 2015.
+ Relative Discrepancy does not separate Information and Communication
- Published online.
+  Complexity.
-[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
+ In <em>42nd International Colloquium on Automata, Languages and
-<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
+  Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer
+  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;| <a href="http://eccc.hpi-web.de/report/2015/028/">http</a>&nbsp;]
 </td>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13-IJQI">5</a>]
+[<a name="MR13-IJQI">4</a>]
 </td>
 <td class="bibtexitem">
@@ Line 152: / Line 134: @@
   query complexity.
  <em>International Journal of Quantum Information</em>, 13(4): 1350059, 2015.
- Online ready.
 [&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;]
@@ Line 158: / Line 139: @@
 </tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="KMOR15">5</a>]
+</td>
+<td class="bibtexitem">
+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.
+ <em>Algorithmica</em>, 2015.
+ Published online.
+[&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;]
+</td>
+</tr>
 <tr valign="top">