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/06/21 17:55] jroland |
members:jroland [2013/06/21 17:58] jroland |
||
---|---|---|---|
Line 17: | Line 17: | ||
|} | |} | ||
- | === Short biography === | + | ==== Short biography ==== |
* Born in Brussels in 1976. | * Born in Brussels in 1976. | ||
* In 1994, he began to study engineering at the [[http://www.ulb.ac.be/|University of Brussels]] (ULB). | * In 1994, he began to study engineering at the [[http://www.ulb.ac.be/|University of Brussels]] (ULB). | ||
Line 30: | Line 30: | ||
* From May 2008 to August 2011, he was a Research Staff Member at [[http://www.nec-labs.com/|NEC Laboratories America]]. | * From May 2008 to August 2011, he was a Research Staff Member at [[http://www.nec-labs.com/|NEC Laboratories America]]. | ||
- | === Research interests === | + | ==== Research interests ==== |
* Quantum algorithms | * Quantum algorithms | ||
* Quantum walks | * Quantum walks | ||
Line 38: | Line 38: | ||
* Quantum query complexity | * Quantum query complexity | ||
- | === 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 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}}] | ||
Line 50: | Line 50: | ||
* Search via quantum walk. [[http://www2.research.att.com/~dsj/stoc07.html|39th ACM Symposium on Theory of Computing]] (STOC'07) in San Diego (USA), June 11-13, 2007. [{{:members:jroland:stoc-presentation.pdf|PDF}}] | * Search via quantum walk. [[http://www2.research.att.com/~dsj/stoc07.html|39th ACM Symposium on Theory of Computing]] (STOC'07) in San Diego (USA), June 11-13, 2007. [{{:members:jroland:stoc-presentation.pdf|PDF}}] | ||
- | === Publications === | + | ==== Publications ==== |
<html> | <html> | ||
Line 137: | Line 137: | ||
In <em>27th IEEE Conference on Computational Complexity (CCC'12)</em>, | In <em>27th IEEE Conference on Computational Complexity (CCC'12)</em>, | ||
pages 236-246. IEEE, 2012. | pages 236-246. IEEE, 2012. | ||
- | To appear. | ||
[ <a href="http://dx.doi.org/10.1109/CCC.2012.17">DOI</a> | | [ <a href="http://dx.doi.org/10.1109/CCC.2012.17">DOI</a> | | ||
<a href="http://arxiv.org/abs/1104.4468">arXiv</a> ] | <a href="http://arxiv.org/abs/1104.4468">arXiv</a> ] |