Quantum walks can find a marked element on any graph (bibtex)

by H. Krovi, F. Magniez, M. Ozols and J. Roland

Reference:

Quantum walks can find a marked element on any graph (H. Krovi, F. Magniez, M. Ozols and J. Roland), In Algorithmica, volume 74, 2016.

Bibtex Entry:

@article{kmor16,
	author = {H. Krovi and F. Magniez and M. Ozols and J. Roland},
	doi = {10.1007/s00453-015-9979-8},
	journal = {Algorithmica},
	number = {2},
	pages = {851-907},
	pdf = {./PAPIERS/kmor-algorithmica16.pdf},
	title = {Quantum walks can find a marked element on any graph},
	volume = {74},
	year = {2016},
	bdsk-url-1 = {https://doi.org/10.1007/s00453-015-9979-8},
	bdsk-url-2 = {./PAPIERS/kmor-algorithmica16.pdf}}