Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Robert Spalek
@inproceedings{DBLP:conf/innovations/BelovsS13,
author = {Aleksandrs Belovs and
Robert Spalek},
editor = {Robert D. Kleinberg},
title = {Adversary lower bound for the k-sum problem},
booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
CA, USA, January 9-12, 2013},
pages = {323--328},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2422436.2422474},
doi = {10.1145/2422436.2422474},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BelovsS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-0845,
author = {Robert Spalek},
title = {Adversary Lower Bound for the Orthogonal Array Problem},
journal = {CoRR},
volume = {abs/1304.0845},
year = {2013},
url = {http://arxiv.org/abs/1304.0845},
eprinttype = {arXiv},
eprint = {1304.0845},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-0845.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ReichardtS12,
author = {Ben Reichardt and
Robert Spalek},
title = {Span-Program-Based Quantum Algorithm for Evaluating Formulas},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {291--319},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a013},
doi = {10.4086/TOC.2012.V008A013},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ReichardtS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-6528,
author = {Aleksandrs Belovs and
Robert Spalek},
title = {Adversary Lower Bound for the k-sum Problem},
journal = {CoRR},
volume = {abs/1206.6528},
year = {2012},
url = {http://arxiv.org/abs/1206.6528},
eprinttype = {arXiv},
eprint = {1206.6528},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-6528.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeMRSS11,
author = {Troy Lee and
Rajat Mittal and
Ben W. Reichardt and
Robert Spalek and
Mario Szegedy},
editor = {Rafail Ostrovsky},
title = {Quantum Query Complexity of State Conversion},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {344--353},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.75},
doi = {10.1109/FOCS.2011.75},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeeMRSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmbainisCRSZ10,
author = {Andris Ambainis and
Andrew M. Childs and
Ben Reichardt and
Robert Spalek and
Shengyu Zhang},
title = {Any {AND-OR} Formula of Size {N} Can Be Evaluated in Time N\({}^{\mbox{1/2+o(1)}}\)
on a Quantum Computer},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2513--2530},
year = {2010},
url = {https://doi.org/10.1137/080712167},
doi = {10.1137/080712167},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AmbainisCRSZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmbainisSW09,
author = {Andris Ambainis and
Robert Spalek and
Ronald de Wolf},
title = {A New Quantum Lower Bound Method, with Applications to Direct Product
Theorems and Time-Space Tradeoffs},
journal = {Algorithmica},
volume = {55},
number = {3},
pages = {422--461},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9022-9},
doi = {10.1007/S00453-007-9022-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmbainisSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeSS08,
author = {Troy Lee and
Adi Shraibman and
Robert Spalek},
title = {A Direct Product Theorem for Discrepancy},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {71--80},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.25},
doi = {10.1109/CCC.2008.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeeSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Spalek08,
author = {Robert Spalek},
title = {The Multiplicative Quantum Adversary},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {237--248},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.9},
doi = {10.1109/CCC.2008.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Spalek08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ReichardtS08,
author = {Ben Reichardt and
Robert Spalek},
editor = {Cynthia Dwork},
title = {Span-program-based quantum algorithm for evaluating formulas},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {103--112},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374394},
doi = {10.1145/1374376.1374394},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ReichardtS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0803-4516,
author = {Robert Spalek},
title = {A Dual Polynomial for {OR}},
journal = {CoRR},
volume = {abs/0803.4516},
year = {2008},
url = {http://arxiv.org/abs/0803.4516},
eprinttype = {arXiv},
eprint = {0803.4516},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0803-4516.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KlauckSW07,
author = {Hartmut Klauck and
Robert Spalek and
Ronald de Wolf},
title = {Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space
Tradeoffs},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {5},
pages = {1472--1493},
year = {2007},
url = {https://doi.org/10.1137/05063235X},
doi = {10.1137/05063235X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KlauckSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AmbainisCRSZ07,
author = {Andris Ambainis and
Andrew M. Childs and
Ben Reichardt and
Robert Spalek and
Shengyu Zhang},
title = {Any {AND-OR} Formula of Size {N} can be Evaluated in time N\({}^{\mbox{1/2+o(1)}}\)
on a Quantum Computer},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {363--372},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.10},
doi = {10.1109/FOCS.2007.10},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AmbainisCRSZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HoyerLS07,
author = {Peter H{\o}yer and
Troy Lee and
Robert Spalek},
editor = {David S. Johnson and
Uriel Feige},
title = {Negative weights make adversaries stronger},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {526--535},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250867},
doi = {10.1145/1250790.1250867},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HoyerLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/SpalekS06,
author = {Robert Spalek and
Mario Szegedy},
title = {All Quantum Adversary Methods are Equivalent},
journal = {Theory Comput.},
volume = {2},
number = {1},
pages = {1--18},
year = {2006},
url = {https://doi.org/10.4086/toc.2006.v002a001},
doi = {10.4086/TOC.2006.V002A001},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/SpalekS06.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/AmbainisS06,
author = {Andris Ambainis and
Robert Spalek},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Quantum Algorithms for Matching and Network Flows},
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 = {172--183},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_13},
doi = {10.1007/11672142\_13},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AmbainisS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmbainisSW06,
author = {Andris Ambainis and
Robert Spalek and
Ronald de Wolf},
editor = {Jon M. Kleinberg},
title = {A new quantum lower bound method, : with applications to direct product
theorems and time-space tradeoffs},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {618--633},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132604},
doi = {10.1145/1132516.1132604},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AmbainisSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/HoyerS05,
author = {Peter H{\o}yer and
Robert Spalek},
title = {Lower Bounds on Quantum Query Complexity},
journal = {Bull. {EATCS}},
volume = {87},
pages = {78--103},
year = {2005},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/HoyerS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HoyerS05,
author = {Peter H{\o}yer and
Robert Spalek},
title = {Quantum Fan-out is Powerful},
journal = {Theory Comput.},
volume = {1},
number = {1},
pages = {81--103},
year = {2005},
url = {https://doi.org/10.4086/toc.2005.v001a005},
doi = {10.4086/TOC.2005.V001A005},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/HoyerS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/SpalekS05,
author = {Robert Spalek and
Mario Szegedy},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {All Quantum Adversary Methods Are Equivalent},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {1299--1311},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_105},
doi = {10.1007/11523468\_105},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/SpalekS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-quant-ph-0511200,
author = {Andris Ambainis and
Robert Spalek and
Ronald de Wolf},
title = {A New Quantum Lower Bound Method, with Applications to Direct Product
Theorems and Time-Space Tradeoffs},
journal = {CoRR},
volume = {abs/quant-ph/0511200},
year = {2005},
url = {http://arxiv.org/abs/quant-ph/0511200},
eprinttype = {arXiv},
eprint = {quant-ph/0511200},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-quant-ph-0511200.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KlauckSW04,
author = {Hartmut Klauck and
Robert Spalek and
Ronald de Wolf},
title = {Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space
Tradeoffs},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {12--21},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.52},
doi = {10.1109/FOCS.2004.52},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KlauckSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-0402123,
author = {Hartmut Klauck and
Robert Spalek and
Ronald de Wolf},
title = {Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space
Tradeoffs},
journal = {CoRR},
volume = {quant-ph/0402123},
year = {2004},
url = {http://arxiv.org/abs/quant-ph/0402123},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-0402123.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-045,
author = {Hartmut Klauck and
Robert Spalek and
Ronald de Wolf},
title = {Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space
Tradeoffs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-045}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-045/index.html},
eprinttype = {ECCC},
eprint = {TR04-045},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-045.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HoyerS03,
author = {Peter H{\o}yer and
Robert Spalek},
editor = {Helmut Alt and
Michel Habib},
title = {Quantum Circuits with Unbounded Fan-out},
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 = {234--246},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_22},
doi = {10.1007/3-540-36494-3\_22},
timestamp = {Thu, 14 Oct 2021 10:38:16 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HoyerS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-0208043,
author = {Peter H{\o}yer and
Robert Spalek},
title = {Quantum Circuits with Unbounded Fan-out},
journal = {CoRR},
volume = {quant-ph/0208043},
year = {2002},
url = {http://arxiv.org/abs/quant-ph/0208043},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-0208043.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 2023-09-27 22:47 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:
