Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Florian Speelman
@inproceedings{DBLP:conf/asiacrypt/ColissonMS23,
author = {L{\'{e}}o Colisson and
Garazi Muguruza and
Florian Speelman},
editor = {Jian Guo and
Ron Steinfeld},
title = {Oblivious Transfer from Zero-Knowledge Proofs - Or How to Achieve
Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs
on Quantum States},
booktitle = {Advances in Cryptology - {ASIACRYPT} 2023 - 29th International Conference
on the Theory and Application of Cryptology and Information Security,
Guangzhou, China, December 4-8, 2023, Proceedings, Part {VIII}},
series = {Lecture Notes in Computer Science},
volume = {14445},
pages = {3--38},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-981-99-8742-9\_1},
doi = {10.1007/978-981-99-8742-9\_1},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/asiacrypt/ColissonMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-01476,
author = {L{\'{e}}o Colisson and
Garazi Muguruza and
Florian Speelman},
title = {Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal
Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States},
journal = {CoRR},
volume = {abs/2303.01476},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.01476},
doi = {10.48550/ARXIV.2303.01476},
eprinttype = {arXiv},
eprint = {2303.01476},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-01476.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-16431,
author = {Yanlin Chen and
Yilei Chen and
Rajendra Kumar and
Subhasree Patro and
Florian Speelman},
title = {{QSETH} strikes again: finer quantum lower bounds for lattice problem,
strong simulation, hitting set problem, and more},
journal = {CoRR},
volume = {abs/2309.16431},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.16431},
doi = {10.48550/ARXIV.2309.16431},
eprinttype = {arXiv},
eprint = {2309.16431},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-16431.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ColissonMS23,
author = {L{\'{e}}o Colisson and
Garazi Muguruza and
Florian Speelman},
title = {Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal
Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {311},
year = {2023},
url = {https://eprint.iacr.org/2023/311},
timestamp = {Fri, 31 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/ColissonMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/quantum/WeggemansURSBSS22,
author = {Jordi R. Weggemans and
Alexander Urech and
Alexander Rausch and
Robert J. C. Spreeuw and
Richard J. Boucherie and
Florian Schreck and
Kareljan Schoutens and
Jir{\'{\i}} Min{\'{a}}r and
Florian Speelman},
title = {Solving correlation clustering with {QAOA} and a Rydberg qudit system:
a full-stack approach},
journal = {Quantum},
volume = {6},
pages = {687},
year = {2022},
url = {https://doi.org/10.22331/q-2022-04-13-687},
doi = {10.22331/Q-2022-04-13-687},
timestamp = {Thu, 18 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/quantum/WeggemansURSBSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BuhrmanLPS22,
author = {Harry Buhrman and
Bruno Loff and
Subhasree Patro and
Florian Speelman},
editor = {Mark Braverman},
title = {Limits of Quantum Speed-Ups for Computational Geometry and Other Problems:
Fine-Grained Complexity via Quantum Walks},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {31:1--31:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.31},
doi = {10.4230/LIPICS.ITCS.2022.31},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BuhrmanLPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/BuhrmanLPS22,
author = {Harry Buhrman and
Bruno Loff and
Subhasree Patro and
Florian Speelman},
editor = {Fran{\c{c}}ois Le Gall and
Tomoyuki Morimae},
title = {Memory Compression with Quantum Random-Access Gates},
booktitle = {17th Conference on the Theory of Quantum Computation, Communication
and Cryptography, {TQC} 2022, July 11-15, 2022, Urbana Champaign,
Illinois, {USA}},
series = {LIPIcs},
volume = {232},
pages = {10:1--10:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.TQC.2022.10},
doi = {10.4230/LIPICS.TQC.2022.10},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tqc/BuhrmanLPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-05599,
author = {Harry Buhrman and
Bruno Loff and
Subhasree Patro and
Florian Speelman},
title = {Memory Compression with Quantum Random-Access Gates},
journal = {CoRR},
volume = {abs/2203.05599},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.05599},
doi = {10.48550/ARXIV.2203.05599},
eprinttype = {arXiv},
eprint = {2203.05599},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-05599.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-11068,
author = {Andris Ambainis and
Harry Buhrman and
Koen Leijnse and
Subhasree Patro and
Florian Speelman},
title = {Matching Triangles and Triangle Collection: Hardness based on a Weak
Quantum Conjecture},
journal = {CoRR},
volume = {abs/2207.11068},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.11068},
doi = {10.48550/ARXIV.2207.11068},
eprinttype = {arXiv},
eprint = {2207.11068},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-11068.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-09686,
author = {Yfke Dulek and
Garazi Muguruza and
Florian Speelman},
title = {An efficient combination of quantum error correction and authentication},
journal = {CoRR},
volume = {abs/2211.09686},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.09686},
doi = {10.48550/ARXIV.2211.09686},
eprinttype = {arXiv},
eprint = {2211.09686},
timestamp = {Thu, 24 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-09686.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanPS21,
author = {Harry Buhrman and
Subhasree Patro and
Florian Speelman},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {A Framework of Quantum Strong Exponential-Time Hypotheses},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {19:1--19:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.19},
doi = {10.4230/LIPICS.STACS.2021.19},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-06301,
author = {Andreas Bluhm and
Matthias Christandl and
Florian Speelman},
title = {Position-based cryptography: Single-qubit protocol secure against
multi-qubit attacks},
journal = {CoRR},
volume = {abs/2104.06301},
year = {2021},
url = {https://arxiv.org/abs/2104.06301},
eprinttype = {arXiv},
eprint = {2104.06301},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-06301.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-02773,
author = {Yfke Dulek and
Stacey Jeffery and
Christian Majenz and
Christian Schaffner and
Florian Speelman and
Ronald de Wolf},
title = {A Guide for New Program Committee Members at Theoretical Computer
Science Conferences},
journal = {CoRR},
volume = {abs/2105.02773},
year = {2021},
url = {https://arxiv.org/abs/2105.02773},
eprinttype = {arXiv},
eprint = {2105.02773},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-02773.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-02005,
author = {Harry Buhrman and
Bruno Loff and
Subhasree Patro and
Florian Speelman},
title = {Limits of quantum speed-ups for computational geometry and other problems:
Fine-grained complexity via quantum walks},
journal = {CoRR},
volume = {abs/2106.02005},
year = {2021},
url = {https://arxiv.org/abs/2106.02005},
eprinttype = {arXiv},
eprint = {2106.02005},
timestamp = {Fri, 11 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-02005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-05686,
author = {Harry Buhrman and
Subhasree Patro and
Florian Speelman},
title = {The Quantum Strong Exponential-Time Hypothesis},
journal = {CoRR},
volume = {abs/1911.05686},
year = {2019},
url = {http://arxiv.org/abs/1911.05686},
eprinttype = {arXiv},
eprint = {1911.05686},
timestamp = {Wed, 04 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-05686.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanKLS18,
author = {Harry Buhrman and
Michal Kouck{\'{y}} and
Bruno Loff and
Florian Speelman},
title = {Catalytic Space: Non-determinism and Hierarchy},
journal = {Theory Comput. Syst.},
volume = {62},
number = {1},
pages = {116--135},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9784-7},
doi = {10.1007/S00224-017-9784-7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanKLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/DulekSS18,
author = {Yfke Dulek and
Christian Schaffner and
Florian Speelman},
title = {Quantum Homomorphic Encryption for Polynomial-Size Circuits},
journal = {Theory Comput.},
volume = {14},
number = {1},
pages = {1--45},
year = {2018},
url = {https://doi.org/10.4086/toc.2018.v014a007},
doi = {10.4086/TOC.2018.V014A007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/DulekSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/DulekS18,
author = {Yfke Dulek and
Florian Speelman},
editor = {Stacey Jeffery},
title = {Quantum Ciphertext Authentication and Key Recycling with the Trap
Code},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication
and Cryptography, {TQC} 2018, July 16-18, 2018, Sydney, Australia},
series = {LIPIcs},
volume = {111},
pages = {1:1--1:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.TQC.2018.1},
doi = {10.4230/LIPICS.TQC.2018.1},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tqc/DulekS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-02237,
author = {Yfke Dulek and
Florian Speelman},
title = {Quantum ciphertext authentication and key recycling with the trap
code},
journal = {CoRR},
volume = {abs/1804.02237},
year = {2018},
url = {http://arxiv.org/abs/1804.02237},
eprinttype = {arXiv},
eprint = {1804.02237},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-02237.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-09290,
author = {Jop Bri{\"{e}}t and
Harry Buhrman and
Debbie W. Leung and
Teresa Piovesan and
Florian Speelman},
title = {Round elimination in exact communication complexity},
journal = {CoRR},
volume = {abs/1812.09290},
year = {2018},
url = {http://arxiv.org/abs/1812.09290},
eprinttype = {arXiv},
eprint = {1812.09290},
timestamp = {Mon, 23 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-09290.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asiacrypt/AlagicDSS17,
author = {Gorjan Alagic and
Yfke Dulek and
Christian Schaffner and
Florian Speelman},
editor = {Tsuyoshi Takagi and
Thomas Peyrin},
title = {Quantum Fully Homomorphic Encryption with Verification},
booktitle = {Advances in Cryptology - {ASIACRYPT} 2017 - 23rd International Conference
on the Theory and Applications of Cryptology and Information Security,
Hong Kong, China, December 3-7, 2017, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {10624},
pages = {438--467},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-70694-8\_16},
doi = {10.1007/978-3-319-70694-8\_16},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/asiacrypt/AlagicDSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-09156,
author = {Gorjan Alagic and
Yfke Dulek and
Christian Schaffner and
Florian Speelman},
title = {Quantum Fully Homomorphic Encryption With Verification},
journal = {CoRR},
volume = {abs/1708.09156},
year = {2017},
url = {http://arxiv.org/abs/1708.09156},
eprinttype = {arXiv},
eprint = {1708.09156},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-09156.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrodyBKLSV16,
author = {Joshua Brody and
Harry Buhrman and
Michal Kouck{\'{y}} and
Bruno Loff and
Florian Speelman and
Nikolai K. Vereshchagin},
title = {Towards a Reverse Newman's Theorem in Interactive Information Complexity},
journal = {Algorithmica},
volume = {76},
number = {3},
pages = {749--781},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0112-9},
doi = {10.1007/S00453-015-0112-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrodyBKLSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/DulekSS16,
author = {Yfke Dulek and
Christian Schaffner and
Florian Speelman},
editor = {Matthew Robshaw and
Jonathan Katz},
title = {Quantum Homomorphic Encryption for Polynomial-Sized Circuits},
booktitle = {Advances in Cryptology - {CRYPTO} 2016 - 36th Annual International
Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016,
Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {9816},
pages = {3--32},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53015-3\_1},
doi = {10.1007/978-3-662-53015-3\_1},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/crypto/DulekSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanKLS16,
author = {Harry Buhrman and
Michal Kouck{\'{y}} and
Bruno Loff and
Florian Speelman},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Catalytic Space: Non-determinism and Hierarchy},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.24},
doi = {10.4230/LIPICS.STACS.2016.24},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanKLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/Speelman16,
author = {Florian Speelman},
editor = {Anne Broadbent},
title = {Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication
and Cryptography, {TQC} 2016, September 27-29, 2016, Berlin, Germany},
series = {LIPIcs},
volume = {61},
pages = {9:1--9:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.TQC.2016.9},
doi = {10.4230/LIPICS.TQC.2016.9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tqc/Speelman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DulekSS16,
author = {Yfke Dulek and
Christian Schaffner and
Florian Speelman},
title = {Quantum homomorphic encryption for polynomial-sized circuits},
journal = {CoRR},
volume = {abs/1603.09717},
year = {2016},
url = {http://arxiv.org/abs/1603.09717},
eprinttype = {arXiv},
eprint = {1603.09717},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DulekSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/DulekSS16,
author = {Yfke Dulek and
Christian Schaffner and
Florian Speelman},
title = {Quantum homomorphic encryption for polynomial-sized circuits},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {559},
year = {2016},
url = {http://eprint.iacr.org/2016/559},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/DulekSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/BrietBLPS15,
author = {Jop Bri{\"{e}}t and
Harry Buhrman and
Debbie W. Leung and
Teresa Piovesan and
Florian Speelman},
editor = {Salman Beigi and
Robert K{\"{o}}nig},
title = {Round Elimination in Exact Communication Complexity},
booktitle = {10th Conference on the Theory of Quantum Computation, Communication
and Cryptography, {TQC} 2015, May 20-22, 2015, Brussels, Belgium},
series = {LIPIcs},
volume = {44},
pages = {206--225},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.TQC.2015.206},
doi = {10.4230/LIPICS.TQC.2015.206},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tqc/BrietBLPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuhrmanCKLS14,
author = {Harry Buhrman and
Richard Cleve and
Michal Kouck{\'{y}} and
Bruno Loff and
Florian Speelman},
editor = {David B. Shmoys},
title = {Computing with a full memory: catalytic space},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {857--866},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591874},
doi = {10.1145/2591796.2591874},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BuhrmanCKLS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BuhrmanCKLS14,
author = {Harry Buhrman and
Richard Cleve and
Michal Kouck{\'{y}} and
Bruno Loff and
Florian Speelman},
title = {Computing with a full memory: Catalytic space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-053}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/053},
eprinttype = {ECCC},
eprint = {TR14-053},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BuhrmanCKLS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BrodyBKLSV13,
author = {Joshua Brody and
Harry Buhrman and
Michal Kouck{\'{y}} and
Bruno Loff and
Florian Speelman and
Nikolay K. Vereshchagin},
title = {Towards a Reverse Newman's Theorem in Interactive Information Complexity},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {24--33},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.12},
doi = {10.1109/CCC.2013.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BrodyBKLSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BuhrmanFSS13,
author = {Harry Buhrman and
Serge Fehr and
Christian Schaffner and
Florian Speelman},
editor = {Robert D. Kleinberg},
title = {The garden-hose model},
booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
CA, USA, January 9-12, 2013},
pages = {145--158},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2422436.2422455},
doi = {10.1145/2422436.2422455},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BuhrmanFSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-4353,
author = {Florian Speelman},
title = {Position-Based Quantum Cryptography and the Garden-Hose Game},
journal = {CoRR},
volume = {abs/1210.4353},
year = {2012},
url = {http://arxiv.org/abs/1210.4353},
eprinttype = {arXiv},
eprint = {1210.4353},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-4353.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrodyBKLS12,
author = {Joshua Brody and
Harry Buhrman and
Michal Kouck{\'{y}} and
Bruno Loff and
Florian Speelman},
title = {Towards a Reverse Newman's Theorem in Interactive Information Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-179}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/179},
eprinttype = {ECCC},
eprint = {TR12-179},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrodyBKLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-2563,
author = {Harry Buhrman and
Serge Fehr and
Christian Schaffner and
Florian Speelman},
title = {The Garden-Hose Game: {A} New Model of Computation, and Application
to Position-Based Quantum Cryptography},
journal = {CoRR},
volume = {abs/1109.2563},
year = {2011},
url = {http://arxiv.org/abs/1109.2563},
eprinttype = {arXiv},
eprint = {1109.2563},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-2563.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 02:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
