Go to the corresponding LIPIcs Volume Portal 
Ambainis, Andris ; Balodis, Kaspars ; Iraids, Jānis ; Khadiev, Kamil ; Kļevickis, Vladislavs ; Prūsis, Krišjānis ; Shen, Yixin ; Smotrovs, Juris ; Vihrovs, Jevgēnijs
pdfformat: 

@InProceedings{ambainis_et_al:LIPIcs:2020:12677, author = {Andris Ambainis and Kaspars Balodis and Jānis Iraids and Kamil Khadiev and Vladislavs Kļevickis and Kri{\v{s}}jānis Prūsis and Yixin Shen and Juris Smotrovs and Jevgēnijs Vihrovs}, title = {{Quantum Lower and Upper Bounds for 2DGrid and Dyck Language}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {8:18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771597}, ISSN = {18688969}, year = {2020}, volume = {170}, editor = {Javier Esparza and Daniel Kr{\'a}ľ}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12677}, URN = {urn:nbn:de:0030drops126774}, doi = {10.4230/LIPIcs.MFCS.2020.8}, annote = {Keywords: Quantum query complexity, Quantum algorithms, Dyck language, Grid path} }
Keywords:  Quantum query complexity, Quantum algorithms, Dyck language, Grid path  
Collection:  45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)  
Issue Date:  2020  
Date of publication:  18.08.2020 