Differences

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

--- members:jroland [2015/04/20 09:42]
jroland [Publications]
+++ members:jroland [2015/11/04 09:57]
jroland [Teaching]
@@ Line 39: / Line 39: @@
   * Compléments de programmation et d'algorithmique (INFO-H-304)
   * Quantum information and computation (INFO-H-514)
+  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - Computing and Complexity Theory part
   * Examen spécial d'admission en Polytechnique - partie géométrie
-  * Analyse complexe - exercices (MATH-H-201)
+  * Analyse complexe - theory (MATH-H-302) - exercices (MATH-H-201)
 ==== Research interests ====
   * Quantum algorithms
@@ Line 84: / Line 84: @@
   Complexity.
  In <em>42nd International Colloquium on Automata, Languages and
-  Programming (ICALP'15)</em>, 2015.
+  Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer
- To appear.
+  Science</em>, pages 506-516. Springer, 2015.
-[&nbsp;<a href="http://eccc.hpi-web.de/report/2015/028/">http</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;]
 </td>
@@ Line 151: / Line 151: @@
  Explicit relation between all lower bound techniques for quantum
   query complexity.
- <em>International Journal of Quantum Information</em>, 2013.
+ <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;]