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 Both sides next revision
members:jroland [2015/11/04 10:07]
jroland [Publications] 		members:jroland [2015/11/04 10:11]
jroland [Publications]
Line 77: Line 77:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <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>,​ 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="​BR14">​2</a>]+
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 110: Line 92:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KLL+14">​4</a>]+[<a name="​KLL+14">​2</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 123: Line 105:
 </td> </td>
 </tr> </tr>
- 
  
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="KMOR15">4</a>]+[<a name="FJKL+15">3</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. +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> </td>
 </tr> </tr>
- 
- 
  
  
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​MR13-IJQI">​5</a>]+[<a name="​MR13-IJQI">​4</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 157: Line 138:
 </tr> </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">​ <tr valign="​top">​