Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Richard Cleve
@article{DBLP:journals/quantum/CleveCLP22, author = {Richard Cleve and Benoit Collins and Li Liu and Vern I. Paulsen}, title = {Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement}, journal = {Quantum}, volume = {6}, pages = {755}, year = {2022}, url = {https://doi.org/10.22331/q-2022-07-07-755}, doi = {10.22331/Q-2022-07-07-755}, timestamp = {Mon, 26 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/quantum/CleveCLP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CleveW17, author = {Richard Cleve and Chunhao Wang}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, title = {Efficient Quantum Algorithms for Simulating Lindblad Evolution}, booktitle = {44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {80}, pages = {17:1--17:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.17}, doi = {10.4230/LIPICS.ICALP.2017.17}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/CleveW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/qic/CleveLLW16, author = {Richard Cleve and Debbie W. Leung and Li Liu and Chunhao Wang}, title = {Near-linear constructions of exact unitary 2-designs}, journal = {Quantum Inf. Comput.}, volume = {16}, number = {9{\&}10}, pages = {721--756}, year = {2016}, url = {https://doi.org/10.26421/QIC16.9-10-1}, doi = {10.26421/QIC16.9-10-1}, timestamp = {Mon, 23 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/qic/CleveLLW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/qic/BerryCG14, author = {Dominic W. Berry and Richard Cleve and Sevag Gharibian}, title = {Gate-efficient discrete simulations of continuous-time quantum query algorithms}, journal = {Quantum Inf. Comput.}, volume = {14}, number = {1-2}, pages = {1--30}, year = {2014}, url = {https://doi.org/10.26421/QIC14.1-2-1}, doi = {10.26421/QIC14.1-2-1}, timestamp = {Thu, 29 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/qic/BerryCG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CleveM14, author = {Richard Cleve and Rajat Mittal}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {Characterization of Binary Constraint System Games}, booktitle = {Automata, Languages, and Programming - 41st International Colloquium, {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8572}, pages = {320--331}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43948-7\_27}, doi = {10.1007/978-3-662-43948-7\_27}, timestamp = {Wed, 26 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CleveM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BerryCCKS14, author = {Dominic W. Berry and Andrew M. Childs and Richard Cleve and Robin Kothari and Rolando D. Somma}, editor = {David B. Shmoys}, title = {Exponential improvement in precision for simulating sparse Hamiltonians}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {283--292}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591854}, doi = {10.1145/2591796.2591854}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BerryCCKS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BuhrmanCKLS14, author = {Harry Buhrman and Richard Cleve and Michal Kouck{\'{y}} and Bruno Loff and Florian Speelman}, editor = {David B. Shmoys}, title = {Computing with a full memory: catalytic space}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {857--866}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591874}, doi = {10.1145/2591796.2591874}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BuhrmanCKLS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BuhrmanCKLS14, author = {Harry Buhrman and Richard Cleve and Michal Kouck{\'{y}} and Bruno Loff and Florian Speelman}, title = {Computing with a full memory: Catalytic space}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-053}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/053}, eprinttype = {ECCC}, eprint = {TR14-053}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BuhrmanCKLS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CleveDNT13, author = {Richard Cleve and Wim van Dam and Michael Nielsen and Alain Tapp}, title = {Quantum entanglement and the communication complexity of the inner product function}, journal = {Theor. Comput. Sci.}, volume = {486}, pages = {11--19}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.012}, doi = {10.1016/J.TCS.2012.12.012}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CleveDNT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/CleveIGNTTY12, author = {Richard Cleve and Kazuo Iwama and Fran{\c{c}}ois Le Gall and Harumichi Nishimura and Seiichiro Tani and Junichi Teruyama and Shigeru Yamashita}, editor = {Fedor V. Fomin and Petteri Kaski}, title = {Reconstructing Strings from Substrings with Quantum Queries}, booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7357}, pages = {388--397}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31155-0\_34}, doi = {10.1007/978-3-642-31155-0\_34}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/swat/CleveIGNTTY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-4691, author = {Richard Cleve and Kazuo Iwama and Fran{\c{c}}ois Le Gall and Harumichi Nishimura and Seiichiro Tani and Junichi Teruyama and Shigeru Yamashita}, title = {Reconstructing Strings from Substrings with Quantum Queries}, journal = {CoRR}, volume = {abs/1204.4691}, year = {2012}, url = {http://arxiv.org/abs/1204.4691}, eprinttype = {arXiv}, eprint = {1204.4691}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-4691.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/qic/CleveGJ09, author = {Richard Cleve and Dmitry Gavinsky and Rahul Jain}, title = {Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's}, journal = {Quantum Inf. Comput.}, volume = {9}, number = {7{\&}8}, pages = {648--656}, year = {2009}, url = {https://doi.org/10.26421/QIC9.7-8-7}, doi = {10.26421/QIC9.7-8-7}, timestamp = {Thu, 29 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/qic/CleveGJ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/ChildsCJY09, author = {Andrew M. Childs and Richard Cleve and Stephen P. Jordan and David L. Yonge{-}Mallo}, title = {Discrete-Query Quantum Algorithm for {NAND} Trees}, journal = {Theory Comput.}, volume = {5}, number = {1}, pages = {119--123}, year = {2009}, url = {https://doi.org/10.4086/toc.2009.v005a005}, doi = {10.4086/TOC.2009.V005A005}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/ChildsCJY09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CleveGMSY09, author = {Richard Cleve and Daniel Gottesman and Michele Mosca and Rolando D. Somma and David L. Yonge{-}Mallo}, editor = {Michael Mitzenmacher}, title = {Efficient discrete-time simulations of continuous-time quantum query algorithms}, booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing, {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, pages = {409--416}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1536414.1536471}, doi = {10.1145/1536414.1536471}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CleveGMSY09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/CleveSUU08, author = {Richard Cleve and William Slofstra and Falk Unger and Sarvagya Upadhyay}, title = {Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems}, journal = {Comput. Complex.}, volume = {17}, number = {2}, pages = {282--299}, year = {2008}, url = {https://doi.org/10.1007/s00037-008-0250-4}, doi = {10.1007/S00037-008-0250-4}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/CleveSUU08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tqc/CleveGY08, author = {Richard Cleve and Dmitry Gavinsky and David L. Yonge{-}Mallo}, editor = {Yasuhito Kawano and Michele Mosca}, title = {Quantum Algorithms for Evaluating Min-MaxTrees}, booktitle = {Theory of Quantum Computation, Communication, and Cryptography, Third Workshop, {TQC} 2008, Tokyo, Japan, January 30 - February 1, 2008. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {5106}, pages = {11--15}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-89304-2\_2}, doi = {10.1007/978-3-540-89304-2\_2}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/tqc/CleveGY08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/CleveSUU07, author = {Richard Cleve and William Slofstra and Falk Unger and Sarvagya Upadhyay}, title = {Perfect Parallel Repetition Theorem for Quantum {XOR} Proof Systems}, booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007), 13-16 June 2007, San Diego, California, {USA}}, pages = {109--114}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/CCC.2007.24}, doi = {10.1109/CCC.2007.24}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/CleveSUU07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AdcockCIPY06, author = {Mark Adcock and Richard Cleve and Kazuo Iwama and Raymond H. Putra and Shigeru Yamashita}, title = {Quantum lower bounds for the Goldreich-Levin problem}, journal = {Inf. Process. Lett.}, volume = {97}, number = {5}, pages = {208--211}, year = {2006}, url = {https://doi.org/10.1016/j.ipl.2005.01.016}, doi = {10.1016/J.IPL.2005.01.016}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AdcockCIPY06.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} }
@article{DBLP:journals/qic/HornSWCLS05, author = {Rolf T. Horn and A. J. Scott and Jonathan Walgate and Richard Cleve and A. I. Lvovsky and Barry C. Sanders}, title = {Classical and quantum fingerprinting with shared randomness and one-sided error}, journal = {Quantum Inf. Comput.}, volume = {5}, number = {3}, pages = {258--271}, year = {2005}, url = {https://doi.org/10.26421/QIC5.3-6}, doi = {10.26421/QIC5.3-6}, timestamp = {Mon, 12 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/qic/HornSWCLS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Cleve04, author = {Richard Cleve}, title = {The query complexity of order-finding}, journal = {Inf. Comput.}, volume = {192}, number = {2}, pages = {162--171}, year = {2004}, url = {https://doi.org/10.1016/j.ic.2004.04.001}, doi = {10.1016/J.IC.2004.04.001}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Cleve04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/CleveHTW04, author = {Richard Cleve and Peter H{\o}yer and Benjamin Toner and John Watrous}, title = {Consequences and Limits of Nonlocal Strategies}, booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004), 21-24 June 2004, Amherst, MA, {USA}}, pages = {236--249}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/CCC.2004.1313847}, doi = {10.1109/CCC.2004.1313847}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/CleveHTW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChildsCDFGS03, author = {Andrew M. Childs and Richard Cleve and Enrico Deotto and Edward Farhi and Sam Gutmann and Daniel A. Spielman}, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {Exponential algorithmic speedup by a quantum walk}, booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, pages = {59--68}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/780542.780552}, doi = {10.1145/780542.780552}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChildsCDFGS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BeaudrapCW02, author = {J. Niel de Beaudrap and Richard Cleve and John Watrous}, title = {Sharp Quantum versus Classical Query Complexity Separations}, journal = {Algorithmica}, volume = {34}, number = {4}, pages = {449--461}, year = {2002}, url = {https://doi.org/10.1007/s00453-002-0978-1}, doi = {10.1007/S00453-002-0978-1}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BeaudrapCW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/qic/Cleve02, author = {Richard Cleve}, title = {Editorial}, journal = {Quantum Inf. Comput.}, volume = {2}, number = {7}, pages = {517}, year = {2002}, url = {https://doi.org/10.26421/QIC2.s-1}, doi = {10.26421/QIC2.S-1}, timestamp = {Fri, 30 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/qic/Cleve02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AdcockC02, author = {Mark Adcock and Richard Cleve}, editor = {Helmut Alt and Afonso Ferreira}, title = {A Quantum Goldreich-Levin Theorem with Cryptographic Applications}, booktitle = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2285}, pages = {323--334}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45841-7\_26}, doi = {10.1007/3-540-45841-7\_26}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AdcockC02.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/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} }
@inproceedings{DBLP:conf/coco/Cleve00, author = {Richard Cleve}, title = {The Query Complexity of Order-Finding}, booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational Complexity, Florence, Italy, July 4-7, 2000}, pages = {54}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/CCC.2000.856735}, doi = {10.1109/CCC.2000.856735}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Cleve00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/CleveW00, author = {Richard Cleve and John Watrous}, title = {Fast parallel circuits for the quantum Fourier transform}, booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000, 12-14 November 2000, Redondo Beach, California, {USA}}, pages = {526--536}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/SFCS.2000.892140}, doi = {10.1109/SFCS.2000.892140}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/CleveW00.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} }
@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/complexity/CleveEHMM98, author = {Richard Cleve and Artur Ekert and Leah Henderson and Chiara Macchiavello and Michele Mosca}, title = {On quantum algorithms}, journal = {Complex.}, volume = {4}, number = {1}, pages = {33--42}, year = {1998}, url = {https://doi.org/10.1002/(SICI)1099-0526(199809/10)4:1\&\#60;33::AID-CPLX10\&\#62;3.0.CO;2-U}, doi = {10.1002/(SICI)1099-0526(199809/10)4:1\&\#60;33::AID-CPLX10\&\#62;3.0.CO;2-U}, timestamp = {Thu, 24 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/complexity/CleveEHMM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BshoutyC98, author = {Nader H. Bshouty and Richard Cleve}, title = {Interpolating Arithmetic Read-Once Formulas in Parallel}, journal = {{SIAM} J. Comput.}, volume = {27}, number = {2}, pages = {401--413}, year = {1998}, url = {https://doi.org/10.1137/S009753979528812X}, doi = {10.1137/S009753979528812X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyC98.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/qcqc/CleveDNT98, author = {Richard Cleve and Wim van Dam and Michael Nielsen and Alain Tapp}, editor = {Colin P. Williams}, title = {Quantum Entanglement and the Communication Complexity of the Inner Product Function}, booktitle = {Quantum Computing and Quantum Communications, First {NASA} International Conference, QCQC'98, Palm Springs, California, USA, February 17-20, 1998, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1509}, pages = {61--74}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/3-540-49208-9\_4}, doi = {10.1007/3-540-49208-9\_4}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/qcqc/CleveDNT98.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} }
@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/jcss/BshoutyCGKT96, author = {Nader H. Bshouty and Richard Cleve and Ricard Gavald{\`{a}} and Sampath Kannan and Christino Tamon}, title = {Oracles and Queries That Are Sufficient for Exact Learning}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {421--433}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0032}, doi = {10.1006/JCSS.1996.0032}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BshoutyCGKT96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BshoutyCE95, author = {Nader H. Bshouty and Richard Cleve and Wayne Eberly}, title = {Size-Depth Tradeoffs for Algebraic Formulas}, journal = {{SIAM} J. Comput.}, volume = {24}, number = {4}, pages = {682--705}, year = {1995}, url = {https://doi.org/10.1137/S0097539792232586}, doi = {10.1137/S0097539792232586}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyCE95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR95-015, author = {Nader H. Bshouty and Richard Cleve and Ricard Gavald{\`{a}} and Sampath Kannan and Christino Tamon}, title = {Oracles and Queries That Are Sufficient for Exact Learning}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR95-015}}, year = {1995}, url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-015/index.html}, eprinttype = {ECCC}, eprint = {TR95-015}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BshoutyCKT94, author = {Nader H. Bshouty and Richard Cleve and Sampath Kannan and Christino Tamon}, editor = {Manfred K. Warmuth}, title = {Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract)}, booktitle = {Proceedings of the Seventh Annual {ACM} Conference on Computational Learning Theory, {COLT} 1994, New Brunswick, NJ, USA, July 12-15, 1994}, pages = {130--139}, publisher = {{ACM}}, year = {1994}, url = {https://doi.org/10.1145/180139.181067}, doi = {10.1145/180139.181067}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/BshoutyCKT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/ChungCD93, author = {Fan R. K. Chung and Richard Cleve and Paul Dagum}, title = {A Note on Constructive Lower Bounds for the Ramsey Numbers \emph{R}(3, \emph{t})}, journal = {J. Comb. Theory, Ser. {B}}, volume = {57}, number = {1}, pages = {150--155}, year = {1993}, url = {https://doi.org/10.1006/jctb.1993.1013}, doi = {10.1006/JCTB.1993.1013}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/ChungCD93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Ben-OrC92, author = {Michael Ben{-}Or and Richard Cleve}, title = {Computing Algebraic Formulas Using a Constant Number of Registers}, journal = {{SIAM} J. Comput.}, volume = {21}, number = {1}, pages = {54--58}, year = {1992}, url = {https://doi.org/10.1137/0221006}, doi = {10.1137/0221006}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Ben-OrC92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BshoutyC92, author = {Nader H. Bshouty and Richard Cleve}, title = {On the Exact Learning of Formulas in Parallel (Extended Abstract)}, booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992}, pages = {513--522}, publisher = {{IEEE} Computer Society}, year = {1992}, url = {https://doi.org/10.1109/SFCS.1992.267800}, doi = {10.1109/SFCS.1992.267800}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BshoutyC92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Cleve91, author = {Richard Cleve}, title = {Towards Optimal Simulations of Formulas by Bounded-Width Programs}, journal = {Comput. Complex.}, volume = {1}, pages = {91--105}, year = {1991}, url = {https://doi.org/10.1007/BF01200059}, doi = {10.1007/BF01200059}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Cleve91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BshoutyCE91, author = {Nader H. Bshouty and Richard Cleve and Wayne Eberly}, title = {Size-Depth Tradeoffs for Algebraic Formulae}, booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991}, pages = {334--341}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SFCS.1991.185387}, doi = {10.1109/SFCS.1991.185387}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BshoutyCE91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/Cleve90, author = {Richard Cleve}, editor = {Alfred Menezes and Scott A. Vanstone}, title = {Complexity Theoretic Issues Concerning Block Ciphers Related to {D.E.S}}, booktitle = {Advances in Cryptology - {CRYPTO} '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {537}, pages = {530--544}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/3-540-38424-3\_37}, doi = {10.1007/3-540-38424-3\_37}, timestamp = {Fri, 17 Jul 2020 16:12:45 +0200}, biburl = {https://dblp.org/rec/conf/crypto/Cleve90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Cleve90, author = {Richard Cleve}, editor = {Harriet Ortiz}, title = {Towards Optimal Simulations of Formulas by Bounded-Width Programs}, booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, {USA}}, pages = {271--277}, publisher = {{ACM}}, year = {1990}, url = {https://doi.org/10.1145/100216.100251}, doi = {10.1145/100216.100251}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Cleve90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/ca/Cleve89, author = {Richard Cleve}, title = {Methodologies for designing block ciphers and cryptographic protocols}, school = {University of Toronto, Canada}, year = {1989}, url = {https://librarysearch.library.utoronto.ca/permalink/01UTORONTO\_INST/14bjeso/alma991105894989706196}, timestamp = {Wed, 10 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/ca/Cleve89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/Cleve89, author = {Richard Cleve}, editor = {Gilles Brassard}, title = {Controlled Gradual Disclosure Schemes for Random Bits and Their Applications}, booktitle = {Advances in Cryptology - {CRYPTO} '89, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {435}, pages = {573--588}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/0-387-34805-0\_50}, doi = {10.1007/0-387-34805-0\_50}, timestamp = {Tue, 01 Jun 2021 15:21:29 +0200}, biburl = {https://dblp.org/rec/conf/crypto/Cleve89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-OrC88, author = {Michael Ben{-}Or and Richard Cleve}, editor = {Janos Simon}, title = {Computing Algebraic Formulas Using a Constant Number of Registers}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {254--257}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62236}, doi = {10.1145/62212.62236}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ben-OrC88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Cleve86, author = {Richard Cleve}, editor = {Juris Hartmanis}, title = {Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract)}, booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, {USA}}, pages = {364--369}, publisher = {{ACM}}, year = {1986}, url = {https://doi.org/10.1145/12130.12168}, doi = {10.1145/12130.12168}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Cleve86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.