Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla. Quantum Query Complexity of Some Graph Problems. In Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella, editors, Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings. Volume 3142 of Lecture Notes in Computer Science, pages 481-493, Springer, 2004. [doi]
@inproceedings{DurrHHM04,
title = {Quantum Query Complexity of Some Graph Problems},
author = {Christoph Dürr and Mark Heiligman and Peter Høyer and Mehdi Mhalla},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3142&spage=481},
tags = {graph query, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DurrHHM04},
cites = {0},
citedby = {0},
pages = {481-493},
booktitle = {Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings},
editor = {Josep Díaz and Juhani Karhumäki and Arto Lepistö and Donald Sannella},
volume = {3142},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-22849-7},
}