Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Harry Buhrman
@inproceedings{DBLP:conf/innovations/AaronsonBK24,
author = {Scott Aaronson and
Harry Buhrman and
William Kretschmer},
editor = {Venkatesan Guruswami},
title = {A Qubit, a Coin, and an Advice String Walk into a Relational Problem},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {1:1--1:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.1},
doi = {10.4230/LIPICS.ITCS.2024.1},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AaronsonBK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BrietBCN24,
author = {Jop Bri{\"{e}}t and
Harry Buhrman and
Davi Castro{-}Silva and
Niels M. P. Neumann},
editor = {Venkatesan Guruswami},
title = {Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum
(Extended Abstract)},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {21:1--21:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.21},
doi = {10.4230/LIPICS.ITCS.2024.21},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BrietBCN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-04841,
author = {Harry Buhrman and
Jonas Helsen and
Jordi Weggemans},
title = {Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local
Hamiltonians},
journal = {CoRR},
volume = {abs/2403.04841},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.04841},
doi = {10.48550/ARXIV.2403.04841},
eprinttype = {arXiv},
eprint = {2403.04841},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-04841.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BuhrmanLMMO23,
author = {Harry Buhrman and
Noah Linden and
Laura Mancinska and
Ashley Montanaro and
Maris Ozols},
editor = {Yael Tauman Kalai},
title = {Quantum Majority Vote},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {29:1--29:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.29},
doi = {10.4230/LIPICS.ITCS.2023.29},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BuhrmanLMMO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-02870,
author = {Jop Bri{\"{e}}t and
Harry Buhrman and
Davi Castro{-}Silva and
Niels M. P. Neumann},
title = {Noisy decoding by shallow circuits with parities: classical and quantum},
journal = {CoRR},
volume = {abs/2302.02870},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.02870},
doi = {10.48550/ARXIV.2302.02870},
eprinttype = {arXiv},
eprint = {2302.02870},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-02870.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-10332,
author = {Scott Aaronson and
Harry Buhrman and
William Kretschmer},
title = {A Qubit, a Coin, and an Advice String Walk Into a Relational Problem},
journal = {CoRR},
volume = {abs/2302.10332},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.10332},
doi = {10.48550/ARXIV.2302.10332},
eprinttype = {arXiv},
eprint = {2302.10332},
timestamp = {Thu, 23 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-10332.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AaronsonBK23,
author = {Scott Aaronson and
Harry Buhrman and
William Kretschmer},
title = {A Qubit, a Coin, and an Advice String Walk Into a Relational Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-015}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/015},
eprinttype = {ECCC},
eprint = {TR23-015},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/AaronsonBK23.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/algorithmica/BuhrmanCKLPV21,
author = {Harry Buhrman and
Matthias Christandl and
Michal Kouck{\'{y}} and
Zvi Lotker and
Boaz Patt{-}Shamir and
Nikolai K. Vereshchagin},
title = {High Entropy Random Selection Protocols},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {667--694},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00770-y},
doi = {10.1007/S00453-020-00770-Y},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BuhrmanCKLPV21.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-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/algorithmica/BuhrmanTUV19,
author = {Harry Buhrman and
Leen Torenvliet and
Falk Unger and
Nikolai K. Vereshchagin},
title = {Sparse Selfreducible Sets and Nonuniform Lower Bounds},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {179--200},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0439-0},
doi = {10.1007/S00453-018-0439-0},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BuhrmanTUV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BanninkBBLL19,
author = {Tom Bannink and
Jop Bri{\"{e}}t and
Harry Buhrman and
Farrokh Labib and
Troy Lee},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Bounding Quantum-Classical Separations for Classes of Nonlocal Games},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {12:1--12:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.12},
doi = {10.4230/LIPICS.STACS.2019.12},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BanninkBBLL19.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/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}
}
@article{DBLP:journals/ercim/BuhrmanP18,
author = {Harry Buhrman and
Floor van de Pavert},
title = {The Case for Quantum Software},
journal = {{ERCIM} News},
volume = {2018},
number = {112},
year = {2018},
url = {https://ercim-news.ercim.eu/en112/special/the-case-for-quantum-software},
timestamp = {Wed, 22 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ercim/BuhrmanP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BuhrmanCZ17,
author = {Harry Buhrman and
Matthias Christandl and
Jeroen Zuiddam},
editor = {Christos H. Papadimitriou},
title = {Nondeterministic Quantum Communication Complexity: the Cyclic Equality
Game and Iterated Matrix Multiplication},
booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
2017, January 9-11, 2017, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {67},
pages = {24:1--24:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.24},
doi = {10.4230/LIPICS.ITCS.2017.24},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BuhrmanCZ17.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}
}
@article{DBLP:journals/mst/AntunesBMST16,
author = {Luis Filipe Coelho Antunes and
Harry Buhrman and
Armando Matos and
Andr{\'{e}} Souto and
Andreia Teixeira},
title = {Distinguishing Two Probability Ensembles with One Sample from each
Ensemble},
journal = {Theory Comput. Syst.},
volume = {59},
number = {3},
pages = {517--531},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9661-1},
doi = {10.1007/S00224-015-9661-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AntunesBMST16.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}
}
@article{DBLP:journals/corr/BuhrmanCZ16,
author = {Harry Buhrman and
Matthias Christandl and
Jeroen Zuiddam},
title = {Nondeterministic quantum communication complexity: the cyclic equality
game and iterated matrix multiplication},
journal = {CoRR},
volume = {abs/1603.03757},
year = {2016},
url = {http://arxiv.org/abs/1603.03757},
eprinttype = {arXiv},
eprint = {1603.03757},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BuhrmanCZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanLT15,
author = {Harry Buhrman and
Bruno Loff and
Leen Torenvliet},
title = {Hardness of Approximation for Knapsack Problems},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {372--393},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9550-z},
doi = {10.1007/S00224-014-9550-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BrietBLPS15,
author = {Jop Bri{\"{e}}t and
Harry Buhrman and
Monique Laurent and
Teresa Piovesan and
Giannicola Scarpa},
title = {Entanglement-Assisted Zero-Error Source-Channel Coding},
journal = {{IEEE} Trans. Inf. Theory},
volume = {61},
number = {2},
pages = {1124--1138},
year = {2015},
url = {https://doi.org/10.1109/TIT.2014.2385080},
doi = {10.1109/TIT.2014.2385080},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/BrietBLPS15.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}
}
@article{DBLP:journals/corr/AllenderBFL14,
author = {Eric Allender and
Harry Buhrman and
Luke Friedman and
Bruno Loff},
title = {Reductions to the set of random strings: The resource-bounded case},
journal = {Log. Methods Comput. Sci.},
volume = {10},
number = {3},
year = {2014},
url = {https://doi.org/10.2168/LMCS-10(3:5)2014},
doi = {10.2168/LMCS-10(3:5)2014},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AllenderBFL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanCFGGOS14,
author = {Harry Buhrman and
Nishanth Chandran and
Serge Fehr and
Ran Gelles and
Vipul Goyal and
Rafail Ostrovsky and
Christian Schaffner},
title = {Position-Based Quantum Cryptography: Impossibility and Constructions},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {1},
pages = {150--178},
year = {2014},
url = {https://doi.org/10.1137/130913687},
doi = {10.1137/130913687},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanCFGGOS14.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}
}
@inproceedings{DBLP:conf/tqc/BuhrmanFS14,
author = {Harry Buhrman and
Serge Fehr and
Christian Schaffner},
editor = {Steven T. Flammia and
Aram W. Harrow},
title = {On the Parallel Repetition of Multi-Player Games: The No-Signaling
Case},
booktitle = {9th Conference on the Theory of Quantum Computation, Communication
and Cryptography, {TQC} 2014, May 21-23, 2014, Singapore},
series = {LIPIcs},
volume = {27},
pages = {24--35},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.TQC.2014.24},
doi = {10.4230/LIPICS.TQC.2014.24},
timestamp = {Mon, 12 Jul 2021 09:55:56 +0200},
biburl = {https://dblp.org/rec/conf/tqc/BuhrmanFS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/cu/p/Buhrman14,
author = {Harry Buhrman},
editor = {Rod Downey},
title = {Turing in Quantumland},
booktitle = {Turing's Legacy: Developments from Turing's Ideas in Logic},
series = {Lecture Notes in Logic},
volume = {42},
pages = {70--89},
publisher = {Cambridge University Press},
year = {2014},
url = {https://doi.org/10.1017/CBO9781107338579.004},
doi = {10.1017/CBO9781107338579.004},
timestamp = {Tue, 16 May 2017 14:01:41 +0200},
biburl = {https://dblp.org/rec/books/cu/p/Buhrman14.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}
}
@article{DBLP:journals/cjtcs/BuhrmanGMW13,
author = {Harry Buhrman and
David Garc{\'{\i}}a{-}Soriano and
Arie Matsliah and
Ronald de Wolf},
title = {The non-adaptive query complexity of testing k-parities},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2013},
year = {2013},
url = {http://cjtcs.cs.uchicago.edu/articles/2013/6/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/BuhrmanGMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/BrietBLV13,
author = {Jop Bri{\"{e}}t and
Harry Buhrman and
Troy Lee and
Thomas Vidick},
title = {Multipartite entanglement in {XOR} games},
journal = {Quantum Inf. Comput.},
volume = {13},
number = {3-4},
pages = {334--360},
year = {2013},
url = {https://doi.org/10.26421/QIC13.3-4-11},
doi = {10.26421/QIC13.3-4-11},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/BrietBLV13.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}
}
@inproceedings{DBLP:conf/mfcs/BuhrmanFHL13,
author = {Harry Buhrman and
Lance Fortnow and
John M. Hitchcock and
Bruno Loff},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Learning Reductions to Sparse Sets},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {243--253},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_23},
doi = {10.1007/978-3-642-40313-2\_23},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BuhrmanFHL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BuhrmanRSW12,
author = {Harry Buhrman and
Oded Regev and
Giannicola Scarpa and
Ronald de Wolf},
title = {Near-Optimal and Explicit Bell Inequality Violations},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {623--645},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a027},
doi = {10.4086/TOC.2012.V008A027},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BuhrmanRSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AllenderBFL12,
author = {Eric Allender and
Harry Buhrman and
Luke Friedman and
Bruno Loff},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Reductions to the Set of Random Strings: The Resource-Bounded Case},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {88--99},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_11},
doi = {10.1007/978-3-642-32589-2\_11},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AllenderBFL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-0849,
author = {Harry Buhrman and
Matthias Christandl and
Christian Schaffner},
title = {Complete Insecurity of Quantum Protocols for Classical Two-Party Computation},
journal = {CoRR},
volume = {abs/1201.0849},
year = {2012},
url = {http://arxiv.org/abs/1201.0849},
eprinttype = {arXiv},
eprint = {1201.0849},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-0849.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-1779,
author = {Jop Bri{\"{e}}t and
Harry Buhrman and
Dion Gijswijt},
title = {Violating the Shannon capacity of metric graphs with entanglement},
journal = {CoRR},
volume = {abs/1207.1779},
year = {2012},
url = {http://arxiv.org/abs/1207.1779},
eprinttype = {arXiv},
eprint = {1207.1779},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-1779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-3849,
author = {Harry Buhrman and
David Garc{\'{\i}}a{-}Soriano and
Arie Matsliah and
Ronald de Wolf},
title = {The non-adaptive query complexity of testing k-parities},
journal = {CoRR},
volume = {abs/1209.3849},
year = {2012},
url = {http://arxiv.org/abs/1209.3849},
eprinttype = {arXiv},
eprint = {1209.3849},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-3849.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderBFL12,
author = {Eric Allender and
Harry Buhrman and
Luke Friedman and
Bruno Loff},
title = {Reductions to the set of random strings: the resource-bounded case},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-054}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/054},
eprinttype = {ECCC},
eprint = {TR12-054},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderBFL12.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/tcbb/BuhrmanGKKS11,
author = {Harry Buhrman and
Peter T. S. van der Gulik and
Steven Kelk and
Wouter M. Koolen and
Leen Stougie},
title = {Some Mathematical Refinements Concerning Error Minimization in the
Genetic Code},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {8},
number = {5},
pages = {1358--1372},
year = {2011},
url = {https://doi.org/10.1109/TCBB.2011.40},
doi = {10.1109/TCBB.2011.40},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/BuhrmanGKKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanRSW11,
author = {Harry Buhrman and
Oded Regev and
Giannicola Scarpa and
Ronald de Wolf},
title = {Near-Optimal and Explicit Bell Inequality Violations},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {157--166},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.30},
doi = {10.1109/CCC.2011.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanRSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BuhrmanCFGGOS11,
author = {Harry Buhrman and
Nishanth Chandran and
Serge Fehr and
Ran Gelles and
Vipul Goyal and
Rafail Ostrovsky and
Christian Schaffner},
editor = {Phillip Rogaway},
title = {Position-Based Quantum Cryptography: Impossibility and Constructions},
booktitle = {Advances in Cryptology - {CRYPTO} 2011 - 31st Annual Cryptology Conference,
Santa Barbara, CA, USA, August 14-18, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6841},
pages = {429--446},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22792-9\_24},
doi = {10.1007/978-3-642-22792-9\_24},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/BuhrmanCFGGOS11.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}
}
@article{DBLP:journals/ercim/BuhrmanFS11,
author = {Harry Buhrman and
Serge Fehr and
Christian Schaffner},
title = {Position-Based Quantum Cryptography},
journal = {{ERCIM} News},
volume = {2011},
number = {85},
pages = {16--17},
year = {2011},
url = {http://ercim-news.ercim.eu/en85/special/position-based-quantum-cryptography},
timestamp = {Wed, 22 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ercim/BuhrmanFS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BuhrmanGM10,
author = {Harry Buhrman and
David Garc{\'{\i}}a{-}Soriano and
Arie Matsliah},
title = {Learning parities in the mistake-bound model},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {16--21},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.009},
doi = {10.1016/J.IPL.2010.10.009},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BuhrmanGM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanFKRV10,
author = {Harry Buhrman and
Lance Fortnow and
Michal Kouck{\'{y}} and
John D. Rogers and
Nikolai K. Vereshchagin},
title = {Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {143--156},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9160-8},
doi = {10.1007/S00224-008-9160-8},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanFKRV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanHHT10,
author = {Harry Buhrman and
Benjamin J. Hescott and
Steven Homer and
Leen Torenvliet},
title = {Non-Uniform Reductions},
journal = {Theory Comput. Syst.},
volume = {47},
number = {2},
pages = {317--341},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9163-5},
doi = {10.1007/S00224-008-9163-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanHHT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFKL10,
author = {Harry Buhrman and
Lance Fortnow and
Michal Kouck{\'{y}} and
Bruno Loff},
title = {Derandomizing from Random Strings},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {58--63},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.15},
doi = {10.1109/CCC.2010.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanFKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-2490,
author = {Harry Buhrman and
Nishanth Chandran and
Serge Fehr and
Ran Gelles and
Vipul Goyal and
Rafail Ostrovsky and
Christian Schaffner},
title = {Position-Based Quantum Cryptography: Impossibility and Constructions},
journal = {CoRR},
volume = {abs/1009.2490},
year = {2010},
url = {http://arxiv.org/abs/1009.2490},
eprinttype = {arXiv},
eprint = {1009.2490},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-2490.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AaronsonABHM10,
author = {Scott Aaronson and
Baris Aydinlioglu and
Harry Buhrman and
John M. Hitchcock and
Dieter van Melkebeek},
title = {A note on exponential circuit lower bounds from derandomizing Arthur-Merlin
games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-174}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/174},
eprinttype = {ECCC},
eprint = {TR10-174},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AaronsonABHM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BuhrmanTUV10,
author = {Harry Buhrman and
Leen Torenvliet and
Falk Unger and
Nikolai K. Vereshchagin},
title = {Sparse Selfreducible Sets and Nonuniform Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-163}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/163},
eprinttype = {ECCC},
eprint = {TR10-163},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BuhrmanTUV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BuhrmanCFGGOS10,
author = {Harry Buhrman and
Nishanth Chandran and
Serge Fehr and
Ran Gelles and
Vipul Goyal and
Rafail Ostrovsky and
Christian Schaffner},
title = {Position-Based Quantum Cryptography: Impossibility and Constructions},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {275},
year = {2010},
url = {http://eprint.iacr.org/2010/275},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BuhrmanCFGGOS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuhrmanFS09,
author = {Harry Buhrman and
Lance Fortnow and
Rahul Santhanam},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {Unconditional Lower Bounds against Advice},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {195--209},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_18},
doi = {10.1007/978-3-642-02927-1\_18},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BuhrmanFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanFS09,
author = {Harry Buhrman and
Lance Fortnow and
Rahul Santhanam},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {Unconditional Lower Bounds against Advice},
booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2411/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BuhrmanFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanGM09,
author = {Harry Buhrman and
David Garc{\'{\i}}a{-}Soriano and
Arie Matsliah},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {Learning Parities in the Mistake-Bound model},
booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2417/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BuhrmanGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-3162,
author = {Harry Buhrman and
Lance Fortnow and
Michal Kouck{\'{y}} and
Bruno Loff},
title = {Derandomizing from Random Strings},
journal = {CoRR},
volume = {abs/0912.3162},
year = {2009},
url = {http://arxiv.org/abs/0912.3162},
eprinttype = {arXiv},
eprint = {0912.3162},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-3162.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BuhrmanFS09,
author = {Harry Buhrman and
Lance Fortnow and
Rahul Santhanam},
title = {Unconditional Lower Bounds against Advice},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-064}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/064},
eprinttype = {ECCC},
eprint = {TR09-064},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BuhrmanFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BuhrmanGM09,
author = {Harry Buhrman and
David Garc{\'{\i}}a{-}Soriano and
Arie Matsliah},
title = {Learning parities in the mistake-bound model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-060}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/060},
eprinttype = {ECCC},
eprint = {TR09-060},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BuhrmanGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Buhrman08,
author = {Harry Buhrman},
title = {Foreword},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {3},
pages = {297},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.06.022},
doi = {10.1016/J.JCSS.2007.06.022},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Buhrman08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanFNR08,
author = {Harry Buhrman and
Lance Fortnow and
Ilan Newman and
Hein R{\"{o}}hrig},
title = {Quantum Property Testing},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {5},
pages = {1387--1400},
year = {2008},
url = {https://doi.org/10.1137/S0097539704442416},
doi = {10.1137/S0097539704442416},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanFNR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanH08,
author = {Harry Buhrman and
John M. Hitchcock},
title = {NP-Hard Sets Are Exponentially Dense Unless coNP {C} NP/poly},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {1--7},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.21},
doi = {10.1109/CCC.2008.21},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanKV08,
author = {Harry Buhrman and
Michal Kouck{\'{y}} and
Nikolai K. Vereshchagin},
title = {Randomised Individual Communication Complexity},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {321--331},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.33},
doi = {10.1109/CCC.2008.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanKV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2007P7411,
editor = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07411},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/portals/07411/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2007P7411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BuhrmanH08,
author = {Harry Buhrman and
John M. Hitchcock},
title = {NP-Hard Sets are Exponentially Dense Unless {NP} is contained in coNP/poly},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-022}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-022/index.html},
eprinttype = {ECCC},
eprint = {TR08-022},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BuhrmanH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanKVV07,
author = {Harry Buhrman and
Hartmut Klauck and
Nikolai K. Vereshchagin and
Paul M. B. Vit{\'{a}}nyi},
title = {Individual communication complexity},
journal = {J. Comput. Syst. Sci.},
volume = {73},
number = {6},
pages = {973--985},
year = {2007},
url = {https://doi.org/10.1016/j.jcss.2007.03.015},
doi = {10.1016/J.JCSS.2007.03.015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuhrmanKVV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanNRW07,
author = {Harry Buhrman and
Ilan Newman and
Hein R{\"{o}}hrig and
Ronald de Wolf},
title = {Robust Polynomials and Quantum Algorithms},
journal = {Theory Comput. Syst.},
volume = {40},
number = {4},
pages = {379--395},
year = {2007},
url = {https://doi.org/10.1007/s00224-006-1313-z},
doi = {10.1007/S00224-006-1313-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanNRW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BuhrmanCKLPV07,
author = {Harry Buhrman and
Matthias Christandl and
Michal Kouck{\'{y}} and
Zvi Lotker and
Boaz Patt{-}Shamir and
Nikolai K. Vereshchagin},
editor = {Moses Charikar and
Klaus Jansen and
Omer Reingold and
Jos{\'{e}} D. P. Rolim},
title = {High Entropy Random Selection Protocols},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
20-22, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4627},
pages = {366--379},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74208-1\_27},
doi = {10.1007/978-3-540-74208-1\_27},
timestamp = {Sat, 30 Sep 2023 09:34:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/BuhrmanCKLPV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanVW07,
author = {Harry Buhrman and
Nikolai K. Vereshchagin and
Ronald de Wolf},
title = {On Computation and Communication with Small Bias},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {24--32},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.18},
doi = {10.1109/CCC.2007.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanVW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BuhrmanFKRV07,
author = {Harry Buhrman and
Lance Fortnow and
Michal Kouck{\'{y}} and
John D. Rogers and
Nikolai K. Vereshchagin},
editor = {Volker Diekert and
Mikhail V. Volkov and
Andrei Voronkov},
title = {Inverting Onto Functions and Polynomial Hierarchy},
booktitle = {Computer Science - Theory and Applications, Second International Symposium
on Computer Science in Russia, {CSR} 2007, Ekaterinburg, Russia, September
3-7, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4649},
pages = {92--103},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74510-5\_12},
doi = {10.1007/978-3-540-74510-5\_12},
timestamp = {Thu, 09 Nov 2023 20:20:35 +0100},
biburl = {https://dblp.org/rec/conf/csr/BuhrmanFKRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/saga/Buhrman07,
author = {Harry Buhrman},
editor = {Juraj Hromkovic and
Richard Kr{\'{a}}lovic and
Marc Nunkesser and
Peter Widmayer},
title = {On Computation and Communication with Small Bias},
booktitle = {Stochastic Algorithms: Foundations and Applications, 4th International
Symposium, {SAGA} 2007, Zurich, Switzerland, September 13-14, 2007,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4665},
pages = {1},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74871-7\_1},
doi = {10.1007/978-3-540-74871-7\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/saga/Buhrman07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07,
author = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
editor = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {07411 Executive Summary -- Algebraic Methods in Computational Complexity},
booktitle = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07411},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1306},
timestamp = {Thu, 10 Jun 2021 13:02:08 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalBFT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07a,
author = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
editor = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {07411 Abstracts Collection -- Algebraic Methods in Computational Complexity},
booktitle = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07411},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1307},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalBFT07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/VereshchaginBCKLP07,
author = {Nikolai K. Vereshchagin and
Harry Buhrman and
Matthias Christandl and
Michal Kouck{\'{y}} and
Zvi Lotker and
Boaz Patt{-}Shamir},
editor = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {High Entropy Random Selection Protocols},
booktitle = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07411},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1309},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/VereshchaginBCKLP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ercim/VermeerB07,
author = {Bram Vermeer and
Harry Buhrman},
title = {Quantum Information Processing},
journal = {{ERCIM} News},
volume = {2007},
number = {71},
year = {2007},
url = {http://ercim-news.ercim.eu/quantum-information-processing},
timestamp = {Wed, 22 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ercim/VermeerB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/AllenderBK06,
author = {Eric Allender and
Harry Buhrman and
Michal Kouck{\'{y}}},
title = {What can be efficiently reduced to the Kolmogorov-random strings?},
journal = {Ann. Pure Appl. Log.},
volume = {138},
number = {1-3},
pages = {2--19},
year = {2006},
url = {https://doi.org/10.1016/j.apal.2005.06.003},
doi = {10.1016/J.APAL.2005.06.003},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apal/AllenderBK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/BuhrmanPSV06,
author = {Harry Buhrman and
Alessandro Panconesi and
Riccardo Silvestri and
Paul M. B. Vit{\'{a}}nyi},
title = {On the importance of having an identity or, is consensus really universal?},
journal = {Distributed Comput.},
volume = {18},
number = {3},
pages = {167--176},
year = {2006},
url = {https://doi.org/10.1007/s00446-005-0121-z},
doi = {10.1007/S00446-005-0121-Z},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/BuhrmanPSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BeigelBFFGLMST06,
author = {Richard Beigel and
Harry Buhrman and
Peter A. Fejer and
Lance Fortnow and
Piotr Grabowski and
Luc Longpr{\'{e}} and
Andrej Muchnik and
Frank Stephan and
Leen Torenvliet},
title = {Enumerations of the Kolmogorov function},
journal = {J. Symb. Log.},
volume = {71},
number = {2},
pages = {501--528},
year = {2006},
url = {https://doi.org/10.2178/jsl/1146620156},
doi = {10.2178/JSL/1146620156},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BeigelBFFGLMST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AllenderBKMR06,
author = {Eric Allender and
Harry Buhrman and
Michal Kouck{\'{y}} and
Dieter van Melkebeek and
Detlef Ronneburger},
title = {Power from Random Strings},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {6},
pages = {1467--1493},
year = {2006},
url = {https://doi.org/10.1137/050628994},
doi = {10.1137/050628994},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AllenderBKMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BuhrmanCLLSU06,
author = {Harry Buhrman and
Richard Cleve and
Monique Laurent and
Noah Linden and
Alexander Schrijver and
Falk Unger},
title = {New Limits on Fault-Tolerant Quantum Computation},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {411--419},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.50},
doi = {10.1109/FOCS.2006.50},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BuhrmanCLLSU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuhrmanS06,
author = {Harry Buhrman and
Robert Spalek},
title = {Quantum verification of matrix products},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {880--889},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109654},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BuhrmanS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanTU06,
author = {Harry Buhrman and
Leen Torenvliet and
Falk Unger},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {455--468},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_37},
doi = {10.1007/11672142\_37},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanTU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BuhrmanFKRV06,
author = {Harry Buhrman and
Lance Fortnow and
Michal Kouck{\'{y}} and
John D. Rogers and
Nikolai K. Vereshchagin},
title = {Inverting onto functions might not be hard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-024}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-024/index.html},
eprinttype = {ECCC},
eprint = {TR06-024},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BuhrmanFKRV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanLM05,
author = {Harry Buhrman and
Troy Lee and
Dieter van Melkebeek},
title = {Language compression and pseudorandom generators},
journal = {Comput. Complex.},
volume = {14},
number = {3},
pages = {228--255},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0199-5},
doi = {10.1007/S00037-005-0199-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BuhrmanLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/BuhrmanT05,
author = {Harry Buhrman and
Leen Torenvliet},
title = {A Post's Program for Complexity Theory},
journal = {Bull. {EATCS}},
volume = {85},
pages = {41--51},
year = {2005},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/BuhrmanT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanFP05,
author = {Harry Buhrman and
Lance Fortnow and
Aduri Pavan},
title = {Some Results on Derandomization},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {211--227},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1194-y},
doi = {10.1007/S00224-004-1194-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanFP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanD05,
author = {Harry Buhrman and
Christoph D{\"{u}}rr and
Mark Heiligman and
Peter H{\o}yer and
Fr{\'{e}}d{\'{e}}ric Magniez and
Miklos Santha and
Ronald de Wolf},
title = {Quantum Algorithms for Element Distinctness},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1324--1330},
year = {2005},
url = {https://doi.org/10.1137/S0097539702402780},
doi = {10.1137/S0097539702402780},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanD05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Buhrman05,
author = {Harry Buhrman},
editor = {S. Barry Cooper and
Benedikt L{\"{o}}we and
Leen Torenvliet},
title = {Quantum Computing},
booktitle = {New Computational Paradigms, First Conference on Computability in
Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3526},
pages = {68--68},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11494645\_9},
doi = {10.1007/11494645\_9},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/Buhrman05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanFNV05,
author = {Harry Buhrman and
Lance Fortnow and
Ilan Newman and
Nikolai K. Vereshchagin},
editor = {Volker Diekert and
Bruno Durand},
title = {Increasing Kolmogorov Complexity},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {412--421},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_34},
doi = {10.1007/978-3-540-31856-9\_34},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanFNV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanNRW05,
author = {Harry Buhrman and
Ilan Newman and
Hein R{\"{o}}hrig and
Ronald de Wolf},
editor = {Volker Diekert and
Bruno Durand},
title = {Robust Polynomials and Quantum Algorithms},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {593--604},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_49},
doi = {10.1007/978-3-540-31856-9\_49},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanNRW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2004P4421,
editor = {Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04421},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/portals/04421/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2004P4421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanLM04,
author = {Harry Buhrman and
Troy Lee and
Dieter van Melkebeek},
title = {Language Compression and Pseudorandom Generators},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {15--28},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313772},
doi = {10.1109/CCC.2004.1313772},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanLM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT04,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Separating Complexity Classes Using Structural Properties},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {130--138},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313820},
doi = {10.1109/CCC.2004.1313820},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisBDR04,
author = {Andris Ambainis and
Harry Buhrman and
Yevgeniy Dodis and
Hein R{\"{o}}hrig},
title = {Multiparty Quantum Coin Flipping},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {250--259},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313848},
doi = {10.1109/CCC.2004.1313848},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisBDR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanKVV04,
author = {Harry Buhrman and
Hartmut Klauck and
Nikolai K. Vereshchagin and
Paul M. B. Vit{\'{a}}nyi},
editor = {Volker Diekert and
Michel Habib},
title = {Individual Communication Complexity: Extended Abstract},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {19--30},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_3},
doi = {10.1007/978-3-540-24749-4\_3},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanKVV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AllenderBK04,
author = {Eric Allender and
Harry Buhrman and
Michal Kouck{\'{y}}},
editor = {Volker Diekert and
Michel Habib},
title = {What Can be Efficiently Reduced to the K-Random Strings?},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {584--595},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_51},
doi = {10.1007/978-3-540-24749-4\_51},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AllenderBK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanFT04,
author = {Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
editor = {Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {04421 Abstracts Collection - Algebraic Methods in Computational Complexity},
booktitle = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04421},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/116},
timestamp = {Thu, 10 Jun 2021 13:02:11 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BuhrmanFT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-002,
author = {Troy Lee and
Dieter van Melkebeek and
Harry Buhrman},
title = {Language Compression and Pseudorandom Generators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-002}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-002/index.html},
eprinttype = {ECCC},
eprint = {TR04-002},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-015,
author = {Richard Beigel and
Harry Buhrman and
Peter A. Fejer and
Lance Fortnow and
Piotr Grabowski and
Luc Longpr{\'{e}} and
Andrei A. Muchnik and
Frank Stephan and
Leen Torenvliet},
title = {Enumerations of the Kolmogorov Function},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-015}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-015/index.html},
eprinttype = {ECCC},
eprint = {TR04-015},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-044,
author = {Eric Allender and
Harry Buhrman and
Michal Kouck{\'{y}}},
title = {What Can be Efficiently Reduced to the Kolmogorov-Random Strings?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-044}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-044/index.html},
eprinttype = {ECCC},
eprint = {TR04-044},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-081,
author = {Harry Buhrman and
Lance Fortnow and
Ilan Newman and
Nikolai K. Vereshchagin},
title = {Increasing Kolmogorov Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-081}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-081/index.html},
eprinttype = {ECCC},
eprint = {TR04-081},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BuhrmanW03,
author = {Harry Buhrman and
Ronald de Wolf},
title = {Quantum zero-error algorithms cannot be composed},
journal = {Inf. Process. Lett.},
volume = {87},
number = {2},
pages = {79--84},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(03)00254-0},
doi = {10.1016/S0020-0190(03)00254-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BuhrmanW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BuhrmanR03,
author = {Harry Buhrman and
Hein R{\"{o}}hrig},
editor = {Branislav Rovan and
Peter Vojt{\'{a}}s},
title = {Distributed Quantum Computing},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {1--20},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45138-9\_1},
doi = {10.1007/978-3-540-45138-9\_1},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BuhrmanR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuhrmanFNR03,
author = {Harry Buhrman and
Lance Fortnow and
Ilan Newman and
Hein R{\"{o}}hrig},
title = {Quantum property testing},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {480--488},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644188},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BuhrmanFNR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanFP03,
author = {Harry Buhrman and
Lance Fortnow and
Aduri Pavan},
editor = {Helmut Alt and
Michel Habib},
title = {Some Results on Derandomization},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {212--222},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_20},
doi = {10.1007/3-540-36494-3\_20},
timestamp = {Thu, 14 Oct 2021 10:38:16 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanFP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanCF03,
author = {Harry Buhrman and
Richard Chang and
Lance Fortnow},
editor = {Helmut Alt and
Michel Habib},
title = {One Bit of Advice},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {547--558},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_48},
doi = {10.1007/3-540-36494-3\_48},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanCF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0304012,
author = {Harry Buhrman and
Hartmut Klauck and
Nikolai K. Vereshchagin and
Paul M. B. Vit{\'{a}}nyi},
title = {Individual Communication Complexity},
journal = {CoRR},
volume = {cs.CC/0304012},
year = {2003},
url = {http://arxiv.org/abs/cs/0304012},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0304012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-0304112,
author = {Andris Ambainis and
Harry Buhrman and
Yevgeniy Dodis and
Hein R{\"{o}}hrig},
title = {Multiparty Quantum Coin Flipping},
journal = {CoRR},
volume = {quant-ph/0304112},
year = {2003},
url = {http://arxiv.org/abs/quant-ph/0304112},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-0304112.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-0309220,
author = {Harry Buhrman and
Ilan Newman and
Hein R{\"{o}}hrig and
Ronald de Wolf},
title = {Robust Quantum Algorithms and Polynomials},
journal = {CoRR},
volume = {quant-ph/0309220},
year = {2003},
url = {http://arxiv.org/abs/quant-ph/0309220},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-0309220.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanMRV02,
author = {Harry Buhrman and
Peter Bro Miltersen and
Jaikumar Radhakrishnan and
Srinivasan Venkatesh},
title = {Are Bitvectors Optimal?},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {6},
pages = {1723--1744},
year = {2002},
url = {https://doi.org/10.1137/S0097539702405292},
doi = {10.1137/S0097539702405292},
timestamp = {Thu, 21 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanMRV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BuhrmanW02,
author = {Harry Buhrman and
Ronald de Wolf},
title = {Complexity measures and decision tree complexity: a survey},
journal = {Theor. Comput. Sci.},
volume = {288},
number = {1},
pages = {21--43},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00144-X},
doi = {10.1016/S0304-3975(01)00144-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BuhrmanW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AllenderBKMR02,
author = {Eric Allender and
Harry Buhrman and
Michal Kouck{\'{y}} and
Dieter van Melkebeek and
Detlef Ronneburger},
title = {Power from Random Strings},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {669--678},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181992},
doi = {10.1109/SFCS.2002.1181992},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AllenderBKMR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DC-0201006,
author = {Harry Buhrman and
Alessandro Panconesi and
Riccardo Silvestri and
Paul M. B. Vit{\'{a}}nyi},
title = {On the Importance of Having an Identity or, is Consensus really Universal?},
journal = {CoRR},
volume = {cs.DC/0201006},
year = {2002},
url = {https://arxiv.org/abs/cs/0201006},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DC-0201006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-0211029,
author = {Harry Buhrman and
Ronald de Wolf},
title = {Quantum Zero-Error Algorithms Cannot be Composed},
journal = {CoRR},
volume = {quant-ph/0211029},
year = {2002},
url = {http://arxiv.org/abs/quant-ph/0211029},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-0211029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-028,
author = {Eric Allender and
Harry Buhrman and
Michal Kouck{\'{y}} and
Detlef Ronneburger and
Dieter van Melkebeek},
title = {Power from Random Strings},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-028}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-028/index.html},
eprinttype = {ECCC},
eprint = {TR02-028},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanFFT01,
author = {Harry Buhrman and
Stephen A. Fenner and
Lance Fortnow and
Leen Torenvliet},
title = {Two oracles that force a big crunch},
journal = {Comput. Complex.},
volume = {10},
number = {2},
pages = {93--116},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8190-2},
doi = {10.1007/S00037-001-8190-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BuhrmanFFT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BealsBCMW01,
author = {Robert Beals and
Harry Buhrman and
Richard Cleve and
Michele Mosca and
Ronald de Wolf},
title = {Quantum lower bounds by polynomials},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {778--797},
year = {2001},
url = {https://doi.org/10.1145/502090.502097},
doi = {10.1145/502090.502097},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BealsBCMW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AmbainisBGKT01,
author = {Andris Ambainis and
Harry Buhrman and
William I. Gasarch and
Bala Kalyanasundaram and
Leen Torenvliet},
title = {The Communication Complexity of Enumeration, Elimination, and Selection},
journal = {J. Comput. Syst. Sci.},
volume = {63},
number = {2},
pages = {148--185},
year = {2001},
url = {https://doi.org/10.1006/jcss.2001.1761},
doi = {10.1006/JCSS.2001.1761},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AmbainisBGKT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanL01,
author = {Harry Buhrman and
Luc Longpr{\'{e}}},
title = {Compressibility and Resource Bounded Measure},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {876--886},
year = {2001},
url = {https://doi.org/10.1137/S0097539797317123},
doi = {10.1137/S0097539797317123},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanFL01,
author = {Harry Buhrman and
Lance Fortnow and
Sophie Laplante},
title = {Resource-Bounded Kolmogorov Complexity Revisited},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {887--905},
year = {2001},
url = {https://doi.org/10.1137/S009753979834388X},
doi = {10.1137/S009753979834388X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanFL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanW01,
author = {Harry Buhrman and
Ronald de Wolf},
title = {Communication Complexity Lower Bounds by Polynomials},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {120--130},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933879},
doi = {10.1109/CCC.2001.933879},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanDHHMSW01,
author = {Harry Buhrman and
Christoph D{\"{u}}rr and
Mark Heiligman and
Peter H{\o}yer and
Fr{\'{e}}d{\'{e}}ric Magniez and
Miklos Santha and
Ronald de Wolf},
title = {Quantum Algorithms for Element Distinctness},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {131--137},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933880},
doi = {10.1109/CCC.2001.933880},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanDHHMSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuhrmanTV01,
author = {Harry Buhrman and
John Tromp and
Paul M. B. Vit{\'{a}}nyi},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {Time and Space Bounds for Reversible Simulation},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {1017--1027},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_82},
doi = {10.1007/3-540-48224-5\_82},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BuhrmanTV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ws/phaunRS01/Buhrman01,
author = {Harry Buhrman},
editor = {Gheorghe Paun and
Grzegorz Rozenberg and
Arto Salomaa},
title = {Quantum Computing and Communication Complexity},
booktitle = {Current Trends in Theoretical Computer Science, Entering the 21th
Century},
pages = {664--679},
publisher = {World Scientific},
year = {2001},
timestamp = {Sat, 03 Aug 2019 22:52:51 +0200},
biburl = {https://dblp.org/rec/books/ws/phaunRS01/Buhrman01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-0101133,
author = {Harry Buhrman and
John Tromp and
Paul M. B. Vit{\'{a}}nyi},
title = {Time and Space Bounds for Reversible Simulation},
journal = {CoRR},
volume = {quant-ph/0101133},
year = {2001},
url = {http://arxiv.org/abs/quant-ph/0101133},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-0101133.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-019,
author = {Andris Ambainis and
Harry Buhrman and
William I. Gasarch and
Bala Kalyanasundaram and
Leen Torenvliet},
title = {The Communication Complexity of Enumeration, Elimination, and Selection},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-019}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-019/index.html},
eprinttype = {ECCC},
eprint = {TR01-019},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Buhrman00,
author = {Harry Buhrman},
title = {Quantum Computing and Communication Complexity},
journal = {Bull. {EATCS}},
volume = {70},
pages = {131--141},
year = {2000},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Buhrman00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanFMT00,
author = {Harry Buhrman and
Lance Fortnow and
Dieter van Melkebeek and
Leen Torenvliet},
title = {Separating Complexity Classes Using Autoreducibility},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1497--1520},
year = {2000},
url = {https://doi.org/10.1137/S0097539798334736},
doi = {10.1137/S0097539798334736},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanFMT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanMRSS00,
author = {Harry Buhrman and
Dieter van Melkebeek and
Kenneth W. Regan and
D. Sivakumar and
Martin Strauss},
title = {A Generalization of Resource-Bounded Measure, with Application to
the {BPP} vs. {EXP} Problem},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {2},
pages = {576--601},
year = {2000},
url = {https://doi.org/10.1137/S0097539798343891},
doi = {10.1137/S0097539798343891},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanMRSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanT00,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Randomness is Hard},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {5},
pages = {1485--1501},
year = {2000},
url = {https://doi.org/10.1137/S0097539799360148},
doi = {10.1137/S0097539799360148},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanCD00,
author = {Harry Buhrman and
Richard Cleve and
Wim van Dam},
title = {Quantum Entanglement and Communication Complexity},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {6},
pages = {1829--1841},
year = {2000},
url = {https://doi.org/10.1137/S0097539797324886},
doi = {10.1137/S0097539797324886},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanCD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BuhrmanJLV00,
author = {Harry Buhrman and
Tao Jiang and
Ming Li and
Paul M. B. Vit{\'{a}}nyi},
title = {New applications of the incompressibility method: Part {II}},
journal = {Theor. Comput. Sci.},
volume = {235},
number = {1},
pages = {59--70},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00184-X},
doi = {10.1016/S0304-3975(99)00184-X},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BuhrmanJLV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisBGKT00,
author = {Andris Ambainis and
Harry Buhrman and
William I. Gasarch and
Bala Kalyanasundaram and
Leen Torenvliet},
title = {The Communication Complexity of Enumeration, Elimination, and Selection},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {44--53},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856734},
doi = {10.1109/CCC.2000.856734},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisBGKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanLM00,
author = {Harry Buhrman and
Sophie Laplante and
Peter Bro Miltersen},
title = {New Bounds for the Language Compression Problem},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {126--130},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856742},
doi = {10.1109/CCC.2000.856742},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanLM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanFFM00,
author = {Harry Buhrman and
Stephen A. Fenner and
Lance Fortnow and
Dieter van Melkebeek},
editor = {Horst Reichel and
Sophie Tison},
title = {Optimal Proof Systems and Sparse Sets},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {407--418},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_34},
doi = {10.1007/3-540-46541-3\_34},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanFFM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuhrmanMRV00,
author = {Harry Buhrman and
Peter Bro Miltersen and
Jaikumar Radhakrishnan and
Srinivasan Venkatesh},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Are bitvectors optimal?},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {449--458},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335357},
doi = {10.1145/335305.335357},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BuhrmanMRV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BuhrmanPSV00,
author = {Harry Buhrman and
Alessandro Panconesi and
Riccardo Silvestri and
Paul M. B. Vit{\'{a}}nyi},
editor = {Maurice Herlihy},
title = {On the Importance of Having an Identity or is Consensus Really Universal?},
booktitle = {Distributed Computing, 14th International Conference, {DISC} 2000,
Toledo, Spain, October 4-6, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1914},
pages = {134--148},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40026-5\_9},
doi = {10.1007/3-540-40026-5\_9},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/BuhrmanPSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BuhrmanW99,
author = {Harry Buhrman and
Ronald de Wolf},
title = {A Lower Bound for Quantum Search of an Ordered List},
journal = {Inf. Process. Lett.},
volume = {70},
number = {5},
pages = {205--209},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(99)00069-1},
doi = {10.1016/S0020-0190(99)00069-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BuhrmanW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BuhrmanFGHTV99,
author = {Harry Buhrman and
Matthew K. Franklin and
Juan A. Garay and
Jaap{-}Henk Hoepman and
John Tromp and
Paul M. B. Vit{\'{a}}nyi},
title = {Mutual Search},
journal = {J. {ACM}},
volume = {46},
number = {4},
pages = {517--536},
year = {1999},
url = {https://doi.org/10.1145/320211.320232},
doi = {10.1145/320211.320232},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BuhrmanFGHTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanF99,
author = {Harry Buhrman and
Lance Fortnow},
title = {Two Queries},
journal = {J. Comput. Syst. Sci.},
volume = {59},
number = {2},
pages = {182--194},
year = {1999},
url = {https://doi.org/10.1006/jcss.1999.1647},
doi = {10.1006/JCSS.1999.1647},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuhrmanF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanM99,
author = {Harry Buhrman and
Dieter van Melkebeek},
title = {Hard Sets Are Hard to Find},
journal = {J. Comput. Syst. Sci.},
volume = {59},
number = {2},
pages = {327--345},
year = {1999},
url = {https://doi.org/10.1006/jcss.1999.1650},
doi = {10.1006/JCSS.1999.1650},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuhrmanM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanHV99,
author = {Harry Buhrman and
Jaap{-}Henk Hoepman and
Paul M. B. Vit{\'{a}}nyi},
title = {Space-efficient Routing Tables for Almost All Networks and the Incompressibility
Method},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {4},
pages = {1414--1432},
year = {1999},
url = {https://doi.org/10.1137/S0097539796308485},
doi = {10.1137/S0097539796308485},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanHV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanLTV99,
author = {Harry Buhrman and
Ming Li and
John Tromp and
Paul M. B. Vit{\'{a}}nyi},
title = {Kolmogorov Random Graphs and the Incompressibility Method},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {590--599},
year = {1999},
url = {https://doi.org/10.1137/S0097539797327805},
doi = {10.1137/S0097539797327805},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanLTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanD99,
author = {Harry Buhrman and
Wim van Dam},
title = {Quantum Bounded Query Complexity},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {149},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766273},
doi = {10.1109/CCC.1999.766273},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanD99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT99,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Complicated Complementations},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {227--236},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766281},
doi = {10.1109/CCC.1999.766281},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BuhrmanCWZ99,
author = {Harry Buhrman and
Richard Cleve and
Ronald de Wolf and
Christof Zalka},
title = {Bounds for Small-Error and Zero-Error Quantum Algorithms},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {358--368},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814607},
doi = {10.1109/SFFCS.1999.814607},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BuhrmanCWZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuhrmanJLV99,
author = {Harry Buhrman and
Tao Jiang and
Ming Li and
Paul M. B. Vit{\'{a}}nyi},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {New Applications of the Incompressibility Method},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {220--229},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_19},
doi = {10.1007/3-540-48523-6\_19},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BuhrmanJLV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanF99,
author = {Harry Buhrman and
Lance Fortnow},
editor = {Christoph Meinel and
Sophie Tison},
title = {One-sided Versus Two-sided Error in Probabilistic Computation},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {100--109},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_9},
doi = {10.1007/3-540-49116-3\_9},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9904019,
author = {Harry Buhrman and
Richard Cleve and
Ronald de Wolf and
Christof Zalka},
title = {Bounds for Small-Error and Zero-Error Quantum Algorithms},
journal = {CoRR},
volume = {cs.CC/9904019},
year = {1999},
url = {https://arxiv.org/abs/cs/9904019},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9904019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910010,
author = {Harry Buhrman and
Ronald de Wolf},
title = {Communication Complexity Lower Bounds by Polynomials},
journal = {CoRR},
volume = {cs.CC/9910010},
year = {1999},
url = {https://arxiv.org/abs/cs/9910010},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DC-9903009,
author = {Harry Buhrman and
Jaap{-}Henk Hoepman and
Paul M. B. Vit{\'{a}}nyi},
title = {Space-Efficient Routing Tables for Almost All Networks and the Incompressibility
Method},
journal = {CoRR},
volume = {cs.DC/9903009},
year = {1999},
url = {https://arxiv.org/abs/cs/9903009},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DC-9903009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-9902005,
author = {Harry Buhrman and
Matthew K. Franklin and
Juan A. Garay and
Jaap{-}Henk Hoepman and
John Tromp and
Paul M. B. Vit{\'{a}}nyi},
title = {Mutual Search},
journal = {CoRR},
volume = {cs.DS/9902005},
year = {1999},
url = {https://arxiv.org/abs/cs/9902005},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-9902005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-9903035,
author = {Harry Buhrman and
Wim van Dam},
title = {Quantum Bounded Query Complexity},
journal = {CoRR},
volume = {quant-ph/9903035},
year = {1999},
url = {http://arxiv.org/abs/quant-ph/9903035},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-9903035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanKT98,
author = {Harry Buhrman and
Jim Kadin and
Thomas Thierauf},
title = {Functions Computable with Nonadaptive Queries to {NP}},
journal = {Theory Comput. Syst.},
volume = {31},
number = {1},
pages = {77--92},
year = {1998},
url = {https://doi.org/10.1007/s002240000079},
doi = {10.1007/S002240000079},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanKT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanHT98,
author = {Harry Buhrman and
Albrecht Hoene and
Leen Torenvliet},
title = {Splittings, Robustness, and Structure of Complete Sets},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {637--653},
year = {1998},
url = {https://doi.org/10.1137/S0097539795279724},
doi = {10.1137/S0097539795279724},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanHT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFT98,
author = {Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {Nonrelativizing Separations},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {8--12},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694585},
doi = {10.1109/CCC.1998.694585},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanFT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanF98,
author = {Harry Buhrman and
Lance Fortnow},
title = {Two Queries},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {13},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694586},
doi = {10.1109/CCC.1998.694586},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanM98,
author = {Harry Buhrman and
Dieter van Melkebeek},
title = {Hard Sets are Hard to Find},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {170--181},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694602},
doi = {10.1109/CCC.1998.694602},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT98,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Randomness is Hard},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {249--260},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694616},
doi = {10.1109/CCC.1998.694616},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BealsBCMW98,
author = {Robert Beals and
Harry Buhrman and
Richard Cleve and
Michele Mosca and
Ronald de Wolf},
title = {Quantum Lower Bounds by Polynomials},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {352--361},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743485},
doi = {10.1109/SFCS.1998.743485},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BealsBCMW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuhrmanFGHTV98,
author = {Harry Buhrman and
Matthew K. Franklin and
Juan A. Garay and
Jaap{-}Henk Hoepman and
John Tromp and
Paul M. B. Vit{\'{a}}nyi},
editor = {Howard J. Karloff},
title = {Mutual Search (Extended Abstract)},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {481--489},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314831},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/BuhrmanFGHTV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanMRSS98,
author = {Harry Buhrman and
Dieter van Melkebeek and
Kenneth W. Regan and
D. Sivakumar and
Martin Strauss},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {A Generalization of Resource-Bounded Measure, With an Application
(Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {161--171},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028558},
doi = {10.1007/BFB0028558},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanMRSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuhrmanCW98,
author = {Harry Buhrman and
Richard Cleve and
Avi Wigderson},
editor = {Jeffrey Scott Vitter},
title = {Quantum vs. Classical Communication and Computation},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {63--68},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276713},
doi = {10.1145/276698.276713},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BuhrmanCW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeigelBF98,
author = {Richard Beigel and
Harry Buhrman and
Lance Fortnow},
editor = {Jeffrey Scott Vitter},
title = {{NP} Might Not Be As Easy As Detecting Unique Solutions},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {203--208},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276737},
doi = {10.1145/276698.276737},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeigelBF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9809060,
author = {Harry Buhrman and
Tao Jiang and
Ming Li and
Paul M. B. Vit{\'{a}}nyi},
title = {New Applications of the Incompressibility Method: Part {II}},
journal = {CoRR},
volume = {cs.CC/9809060},
year = {1998},
url = {https://arxiv.org/abs/cs/9809060},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9809060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-9802049,
author = {Robert Beals and
Harry Buhrman and
Richard Cleve and
Michele Mosca and
Ronald de Wolf},
title = {Quantum Lower Bounds by Polynomials},
journal = {CoRR},
volume = {quant-ph/9802049},
year = {1998},
url = {http://arxiv.org/abs/quant-ph/9802049},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-9802049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-9811046,
author = {Harry Buhrman and
Ronald de Wolf},
title = {Lower Bounds for Quantum Search and Derandomization},
journal = {CoRR},
volume = {quant-ph/9811046},
year = {1998},
url = {http://arxiv.org/abs/quant-ph/9811046},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-9811046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-058,
author = {Harry Buhrman and
Dieter van Melkebeek and
Kenneth W. Regan and
Martin Strauss and
D. Sivakumar},
title = {A Generalization of Resource-Bounded Measure, With Application to
the {BPP} vs. {EXP} Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-058}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-058/index.html},
eprinttype = {ECCC},
eprint = {TR98-058},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-058.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanM97,
author = {Harry Buhrman and
Elvira Mayordomo},
title = {An Excursion to the Kolmogorov Random Strings},
journal = {J. Comput. Syst. Sci.},
volume = {54},
number = {3},
pages = {393--399},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1484},
doi = {10.1006/JCSS.1997.1484},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuhrmanM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFT97,
author = {Harry Buhrman and
Lance Fortnow and
Leen Torenvliet},
title = {Six Hypotheses in Search of a Theorem},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {2--12},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612295},
doi = {10.1109/CCC.1997.612295},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanFT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuhrmanFF97,
author = {Harry Buhrman and
Stephen A. Fenner and
Lance Fortnow},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Results on Resource-Bounded Measure},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {188--194},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_176},
doi = {10.1007/3-540-63165-8\_176},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BuhrmanFF97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sequences/BuhrmanLV97,
author = {Harry Buhrman and
Ming Li and
Paul M. B. Vit{\'{a}}nyi},
editor = {Bruno Carpentieri and
Alfredo De Santis and
Ugo Vaccaro and
James A. Storer},
title = {Kolmogorov random graphs},
booktitle = {Compression and Complexity of {SEQUENCES} 1997, Positano, Amalfitan
Coast, Salerno, Italy, June 11-13, 1997, Proceedings},
pages = {78--96},
publisher = {{IEEE}},
year = {1997},
url = {https://doi.org/10.1109/SEQUEN.1997.666905},
doi = {10.1109/SEQUEN.1997.666905},
timestamp = {Fri, 25 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sequences/BuhrmanLV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanF97,
author = {Harry Buhrman and
Lance Fortnow},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Resource-Bounded Kolmogorov Complexity Revisited},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {105--116},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023452},
doi = {10.1007/BFB0023452},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanF97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanT96,
author = {Harry Buhrman and
Leen Torenvliet},
title = {P-Selektive Self-Reducible Sets: {A} New Characterization of {P}},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {210--217},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0062},
doi = {10.1006/JCSS.1996.0062},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuhrmanT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanO96,
author = {Harry Buhrman and
Pekka Orponen},
title = {Random Strings Make Hard Instances},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {261--266},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0067},
doi = {10.1006/JCSS.1996.0067},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuhrmanO96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Buhrman96,
author = {Harry Buhrman},
title = {A short note on Shor's factoring algorithm},
journal = {{SIGACT} News},
volume = {27},
number = {1},
pages = {89--90},
year = {1996},
url = {https://doi.org/10.1145/230514.230515},
doi = {10.1145/230514.230515},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Buhrman96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BuhrmanHV96,
author = {Harry Buhrman and
Jaap{-}Henk Hoepman and
Paul M. B. Vit{\'{a}}nyi},
editor = {James E. Burns and
Yoram Moses},
title = {Optimal Routing Tables},
booktitle = {Proceedings of the Fifteenth Annual {ACM} Symposium on Principles
of Distributed Computing, Philadelphia, Pennsylvania, USA, May 23-26,
1996},
pages = {134--142},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/248052.248076},
doi = {10.1145/248052.248076},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BuhrmanHV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanL96,
author = {Harry Buhrman and
Luc Longpr{\'{e}}},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Compressibility and Resource Bounded Measure},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {13--24},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_2},
doi = {10.1007/3-540-60922-9\_2},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanT96,
author = {Harry Buhrman and
Thomas Thierauf},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {The Complexity of Generating and Checking Proffs of Membership},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {75--86},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_7},
doi = {10.1007/3-540-60922-9\_7},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanHL95,
author = {Harry Buhrman and
Edith Hemaspaandra and
Luc Longpr{\'{e}}},
title = {{SPARSE} Reduces Conjunctively to {TALLY}},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {673--681},
year = {1995},
url = {https://doi.org/10.1137/0224044},
doi = {10.1137/0224044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanHL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanM95,
author = {Harry Buhrman and
Elvira Mayordomo},
title = {An Excursion to the Kolmogorov Random Strings},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {197--203},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514858},
doi = {10.1109/SCT.1995.514858},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocolt/BalcazarBH95,
author = {Jos{\'{e}} L. Balc{\'{a}}zar and
Harry Buhrman and
Montserrat Hermo},
editor = {Paul M. B. Vit{\'{a}}nyi},
title = {Learnability of Kolmogorov-easy circuit expressions via queries},
booktitle = {Computational Learning Theory, Second European Conference, EuroCOLT
'95, Barcelona, Spain, March 13-15, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {904},
pages = {112--124},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59119-2\_172},
doi = {10.1007/3-540-59119-2\_172},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/eurocolt/BalcazarBH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BuhrmanFT95,
author = {Harry Buhrman and
Lance Fortnow and
Leen Torenvliet},
title = {Using Autoreducibility to Separate Complexity Classes},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {520--527},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492582},
doi = {10.1109/SFCS.1995.492582},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BuhrmanFT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ftcs/BuhrmanGH95,
author = {Harry Buhrman and
Juan A. Garay and
Jaap{-}Henk Hoepman},
title = {Optimal Resiliency against Mobile Faults},
booktitle = {Digest of Papers: FTCS-25, The Twenty-Fifth International Symposium
on Fault-Tolerant Computing, Pasadena, California, USA, June 27-30,
1995},
pages = {83--88},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/FTCS.1995.466995},
doi = {10.1109/FTCS.1995.466995},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ftcs/BuhrmanGH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BuhrmanGHM95,
author = {Harry Buhrman and
Juan A. Garay and
Jaap{-}Henk Hoepman and
Mark Moir},
editor = {James H. Anderson},
title = {Long-Lived Renaming Made Fast},
booktitle = {Proceedings of the Fourteenth Annual {ACM} Symposium on Principles
of Distributed Computing, Ottawa, Ontario, Canada, August 20-23, 1995},
pages = {194--203},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/224964.224986},
doi = {10.1145/224964.224986},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BuhrmanGHM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanH95,
author = {Harry Buhrman and
Montserrat Hermo},
editor = {Ernst W. Mayr and
Claude Puech},
title = {On the Sparse Set Conjecture for Sets with Low Denisty},
booktitle = {{STACS} 95, 12th Annual Symposium on Theoretical Aspects of Computer
Science, Munich, Germany, March 2-4, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {900},
pages = {609--618},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59042-0\_109},
doi = {10.1007/3-540-59042-0\_109},
timestamp = {Sat, 07 Sep 2019 11:59:26 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanKT94,
author = {Harry Buhrman and
Jim Kadin and
Thomas Thierauf},
title = {On Functions Computable with Nonadaptive Queries to {NP}},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {43--52},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315819},
doi = {10.1109/SCT.1994.315819},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanKT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT94,
author = {Harry Buhrman and
Leen Torenvliet},
title = {On the Structure of Complete Sets},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {118--133},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315811},
doi = {10.1109/SCT.1994.315811},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanO94,
author = {Harry Buhrman and
Pekka Orponen},
title = {Random Strings Make Hard Instances},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {217--222},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315802},
doi = {10.1109/SCT.1994.315802},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanO94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuhrmanT94,
author = {Harry Buhrman and
Leen Torenvliet},
editor = {Serge Abiteboul and
Eli Shamir},
title = {On the Cutting Edge of Relativization: The Resource Bounded Injury
Method},
booktitle = {Automata, Languages and Programming, 21st International Colloquium,
ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {820},
pages = {263--273},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58201-0\_74},
doi = {10.1007/3-540-58201-0\_74},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BuhrmanT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanST93,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
title = {The Relative Power of Logspace and Polynomial Time Reductions},
journal = {Comput. Complex.},
volume = {3},
pages = {231--244},
year = {1993},
url = {https://doi.org/10.1007/BF01271369},
doi = {10.1007/BF01271369},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BuhrmanST93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BuhrmanTB93,
author = {Harry Buhrman and
Leen Torenvliet and
Peter van Emde Boas},
title = {Twenty Questions to a P-Selector},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {201--204},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90146-Z},
doi = {10.1016/0020-0190(93)90146-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BuhrmanTB93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanHT93,
author = {Harry Buhrman and
Peter van Helden and
Leen Torenvliet},
title = {P-Selective Self-reducibles Sets: {A} New Characterization of \emph{P}},
booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
San Diego, CA, USA, May 18-21, 1993},
pages = {44--51},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336542},
doi = {10.1109/SCT.1993.336542},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanHT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanLS93,
author = {Harry Buhrman and
Luc Longpr{\'{e}} and
Edith Spaan},
title = {{SPARSE} reduces conjunctively to {TALLY}},
booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
San Diego, CA, USA, May 18-21, 1993},
pages = {208--214},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336525},
doi = {10.1109/SCT.1993.336525},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanLS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanHT93,
author = {Harry Buhrman and
Albrecht Hoene and
Leen Torenvliet},
editor = {Patrice Enjalbert and
Alain Finkel and
Klaus W. Wagner},
title = {Splittings, Robustness and Structure of Complete Sets},
booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {665},
pages = {175--184},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56503-5\_20},
doi = {10.1007/3-540-56503-5\_20},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanHT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanST92,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
editor = {Klaus Ambos{-}Spies and
Steven Homer and
Uwe Sch{\"{o}}ning},
title = {Bounded Reductions},
booktitle = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8,
1992},
pages = {83--99},
publisher = {Cambridge University Press},
year = {1992},
timestamp = {Mon, 15 Jul 2002 11:29:49 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BuhrmanST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BuhrmanH92,
author = {Harry Buhrman and
Steven Homer},
editor = {R. K. Shyamasundar},
title = {Superpolynomial Circuits, Almost Sparse Oracles and the Exponential
Hierarchy},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
12th Conference, New Delhi, India, December 18-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {652},
pages = {116--127},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56287-7\_99},
doi = {10.1007/3-540-56287-7\_99},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BuhrmanH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanHT91,
author = {Harry Buhrman and
Steven Homer and
Leen Torenvliet},
title = {Completeness for Nondeterministic Complexity Classes},
journal = {Math. Syst. Theory},
volume = {24},
number = {3},
pages = {179--200},
year = {1991},
url = {https://doi.org/10.1007/BF02090397},
doi = {10.1007/BF02090397},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanHT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanST91,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
editor = {Christian Choffrut and
Matthias Jantzen},
title = {Bounded Reductions},
booktitle = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {480},
pages = {410--421},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0020816},
doi = {10.1007/BFB0020816},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanST91.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-05-08 23:35 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:
