Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
members:jroland [2015/11/04 10:00] jroland [Teaching] |
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ère, and Jéré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. | + | |
- | [ <a href="http://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</a> | <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | + | |
- | + | ||
- | </td> | + | |
- | </tr> | + | |
- | + | ||
- | + | ||
- | <tr valign="top"> | + | |
- | <td align="right" class="bibtexnumber"> | + | |
- | [<a name="BR14">2</a>] | + | |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 107: | Line 89: | ||
</td> | </td> | ||
</tr> | </tr> | ||
- | |||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+14">3</a>] | + | [<a name="KLL+14">2</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 118: | Line 99: | ||
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>, 2015. | + | <em>SIAM Journal on Computing</em>, 44(5):1550--1572, 2015. |
- | To appear. | + | [ <a href="http://dx.doi.org/10.1137/130928273">DOI</a> | |
- | [ <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | + | <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] |
</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édéric Magniez, Maris Ozols, and Jérémie Roland. | + | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu |
- | Quantum walks can find a marked element on any graph. | + | Laurière, and Jérémie Roland. |
- | <em>Algorithmica</em>, 2015. | + | Relative Discrepancy does not separate Information and Communication |
- | Published online. | + | Complexity. |
- | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | + | In <em>42nd International Colloquium on Automata, Languages and |
- | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | + | Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer |
+ | Science</em>, pages 506-516. Springer, 2015. | ||
+ | [ <a href="http://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</a> | <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | ||
</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 158: | Line 138: | ||
</tr> | </tr> | ||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="KMOR15">5</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | ||
+ | Quantum walks can find a marked element on any graph. | ||
+ | <em>Algorithmica</em>, 2015. | ||
+ | Published online. | ||
+ | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
<tr valign="top"> | <tr valign="top"> |