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 [2013/01/07 14:30] jroland |
members:jroland [2013/04/26 16:43] jroland |
||
---|---|---|---|
Line 39: | Line 39: | ||
=== Selected talks === | === Selected talks === | ||
+ | * 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}}] | ||
* Quantum algorithms based on quantum walks. [[http://www-fourier.ujf-grenoble.fr/~joye/quawag/QuaWaG/|Quantum Walks in Grenoble]] (France), November 13-14, 2012. [{{:members:jroland:quawag-grenoble-presentation-handout.pdf|PDF}}] | * Quantum algorithms based on quantum walks. [[http://www-fourier.ujf-grenoble.fr/~joye/quawag/QuaWaG/|Quantum Walks in Grenoble]] (France), November 13-14, 2012. [{{:members:jroland:quawag-grenoble-presentation-handout.pdf|PDF}}] | ||
* Quantum query complexity: Adversaries, polynomials and direct product theorems. [[http://qa2012.iqc.uwaterloo.ca/|Recent Progress in Quantum Algorithms]] at IQC (Waterloo, Canada), April 11-13, 2012. [{{:members:jroland:talk-iqc-pi-workshop-2012-printout.pdf|PDF}} | [[http://www.youtube.com/watch?v=N9BuArGFqjU|Video]]] | * Quantum query complexity: Adversaries, polynomials and direct product theorems. [[http://qa2012.iqc.uwaterloo.ca/|Recent Progress in Quantum Algorithms]] at IQC (Waterloo, Canada), April 11-13, 2012. [{{:members:jroland:talk-iqc-pi-workshop-2012-printout.pdf|PDF}} | [[http://www.youtube.com/watch?v=N9BuArGFqjU|Video]]] | ||
Line 69: | Line 70: | ||
Explicit relation between all lower bound techniques for quantum | Explicit relation between all lower bound techniques for quantum | ||
query complexity. | query complexity. | ||
- | Technical Report arXiv:1209.2713, arXiv, 2012. | + | In <em> 30th International Symposium on Theoretical Aspects of Computer Science (STACS'13)</em>, pages 434-445, 2013. |
- | [ <a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2013.434">DOI</a> |<a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] |
</td> | </td> |