Differences

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

--- members:jroland [2015/04/15 14:40]
jroland [Short biography]
+++ members:jroland [2015/04/20 09:42]
jroland [Publications]
@@ Line 76: / Line 76: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">1</a>]
+[<a name="FJKL+15">1</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.
- 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">
-<td align="right" class="bibtexnumber">
-[<a name="FJKL+15">2</a>]
-</td>
-<td class="bibtexitem">
-Lila Fontes, Rahul Jain, Iordanis Kerenidis, Mathieu Lauri&egrave;re, Sophie
-  Laplante, and J&eacute;r&eacute;mie Roland.
  Relative Discrepancy does not separate Information and Communication
   Complexity.
- <em>Electronic Colloquium on Computational Complexity</em>, 28, 2015.
+ 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;]
@@ Line 108: / Line 94: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR14">3</a>]
+[<a name="BR14">2</a>]
 </td>
 <td class="bibtexitem">
 Mathieu Brandeho and J&eacute;r&eacute;mie Roland.
  A universal adiabatic quantum query algorithm.
- <em>arXiv preprint arXiv:1409.3558</em>, 2014.
+ In <em>10th Conference on the Theory of Quantum Computation,
+  Communication and Cryptography (TQC'15)</em>, 2015.
+ To appear.
 [&nbsp;<a href="http://arxiv.org/abs/1409.3558">arXiv</a>&nbsp;]
@@ Line 122: / Line 110: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">4</a>]
+[<a name="KLL+14">3</a>]
 </td>
 <td class="bibtexitem">
@@ Line 129: / Line 117: @@
  Lower bounds on information complexity via zero-communication
   protocols and applications.
- <em>SIAM Journal on Computing</em>, 2014.
+ <em>SIAM Journal on Computing</em>, 2015.
  To appear.
 [&nbsp;<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
@@ Line 135: / Line 123: @@
 </td>
 </tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="KMOR15">4</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>