by Frédéric Magniez and Ashwin Nayak
Reference:
Quantum Distributed Complexity of Set Disjointness on a Line (Frédéric Magniez and Ashwin Nayak), In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, volume 168, 2020.
Bibtex Entry:
@inproceedings{magniez_et_al:LIPIcs:2020:12489,
address = {Dagstuhl, Germany},
annote = {Keywords: Quantum distributed computing, Set Disjointness, communication complexity, query complexity},
author = {Frédéric Magniez and Ashwin Nayak},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
date-added = {2021-03-05 17:34:59 +0100},
date-modified = {2021-03-05 17:34:59 +0100},
doi = {10.4230/LIPIcs.ICALP.2020.82},
editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli},
isbn = {978-3-95977-138-2},
issn = {1868-8969},
pages = {82:1--82:18},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum für Informatik},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
title = {{Quantum Distributed Complexity of Set Disjointness on a Line}},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12489},
urn = {urn:nbn:de:0030-drops-124892},
volume = {168},
year = {2020},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2020/12489},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.ICALP.2020.82}}