Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Yaoyun Shi
@article{DBLP:journals/corr/abs-2305-14304,
author = {Fang Zhang and
Xing Zhu and
Rui Chao and
Cupjin Huang and
Linghang Kong and
Guoyang Chen and
Dawei Ding and
Haishan Feng and
Yihuai Gao and
Xiaotong Ni and
Liwei Qiu and
Zhe Wei and
Yueming Yang and
Yang Zhao and
Yaoyun Shi and
Weifeng Zhang and
Peng Zhou and
Jianxin Chen},
title = {A Classical Architecture For Digital Quantum Computers},
journal = {CoRR},
volume = {abs/2305.14304},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.14304},
doi = {10.48550/ARXIV.2305.14304},
eprinttype = {arXiv},
eprint = {2305.14304},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-14304.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ncs/HuangZNN0CGWWZK21,
author = {Cupjin Huang and
Fang Zhang and
Michael Newman and
Xiaotong Ni and
Dawei Ding and
Junjie Cai and
Xun Gao and
Tenghui Wang and
Feng Wu and
Gengyan Zhang and
Hsiang{-}Sheng Ku and
Zhengxiong Tian and
Junyin Wu and
Haihong Xu and
Huanjun Yu and
Bo Yuan and
Mario Szegedy and
Yaoyun Shi and
Hui{-}Hai Zhao and
Chunqing Deng and
Jianxin Chen},
title = {Efficient parallelization of tensor network contraction for simulating
quantum computation},
journal = {Nat. Comput. Sci.},
volume = {1},
number = {9},
pages = {578--587},
year = {2021},
url = {https://doi.org/10.1038/s43588-021-00119-7},
doi = {10.1038/S43588-021-00119-7},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ncs/HuangZNN0CGWWZK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/JainMS20,
author = {Rahul Jain and
Carl A. Miller and
Yaoyun Shi},
title = {Parallel Device-Independent Quantum Key Distribution},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {9},
pages = {5567--5584},
year = {2020},
url = {https://doi.org/10.1109/TIT.2020.2986740},
doi = {10.1109/TIT.2020.2986740},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/JainMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/NewmanS18,
author = {Michael Newman and
Yaoyun Shi},
title = {Limitations on transversal computation through quantum homomorphic
encryption},
journal = {Quantum Inf. Comput.},
volume = {18},
number = {11{\&}12},
pages = {927--948},
year = {2018},
url = {https://doi.org/10.26421/QIC18.11-12-3},
doi = {10.26421/QIC18.11-12-3},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/NewmanS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/MillerS17,
author = {Carl A. Miller and
Yaoyun Shi},
title = {Randomness in nonlocal games between mistrustful players},
journal = {Quantum Inf. Comput.},
volume = {17},
number = {7{\&}8},
pages = {595--610},
year = {2017},
url = {https://doi.org/10.26421/QIC17.7-8-3},
doi = {10.26421/QIC17.7-8-3},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/MillerS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MillerS17,
author = {Carl A. Miller and
Yaoyun Shi},
title = {Universal Security for Randomness Expansion from the Spot-Checking
Protocol},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {4},
pages = {1304--1335},
year = {2017},
url = {https://doi.org/10.1137/15M1044333},
doi = {10.1137/15M1044333},
timestamp = {Wed, 06 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MillerS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NewmanS17,
author = {Michael Newman and
Yaoyun Shi},
title = {Limitations on Transversal Computation through Quantum Homomorphic
Encryption},
journal = {CoRR},
volume = {abs/1704.07798},
year = {2017},
url = {http://arxiv.org/abs/1704.07798},
eprinttype = {arXiv},
eprint = {1704.07798},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NewmanS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MillerS16,
author = {Carl A. Miller and
Yaoyun Shi},
title = {Robust Protocols for Securely Expanding Randomness and Distributing
Keys Using Untrusted Quantum Devices},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {33:1--33:63},
year = {2016},
url = {https://doi.org/10.1145/2885493},
doi = {10.1145/2885493},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MillerS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Shi16,
author = {Yaoyun Shi},
title = {Quantum Algorithm for the Parity Problem},
booktitle = {Encyclopedia of Algorithms},
pages = {1667--1669},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_309},
doi = {10.1007/978-1-4939-2864-4\_309},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Shi16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShiW15,
author = {Yaoyun Shi and
Xiaodi Wu},
title = {Epsilon-net method for optimizations over separable states},
journal = {Theor. Comput. Sci.},
volume = {598},
pages = {51--63},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.03.031},
doi = {10.1016/J.TCS.2015.03.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShiW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MillerS14,
author = {Carl A. Miller and
Yaoyun Shi},
editor = {David B. Shmoys},
title = {Robust protocols for securely expanding randomness and distributing
keys using untrusted quantum devices},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {417--426},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591843},
doi = {10.1145/2591796.2591843},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MillerS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/JainSWZ13,
author = {Rahul Jain and
Yaoyun Shi and
Zhaohui Wei and
Shengyu Zhang},
title = {Efficient Protocols for Generating Bipartite Classical Distributions
and Quantum States},
journal = {{IEEE} Trans. Inf. Theory},
volume = {59},
number = {8},
pages = {5171--5178},
year = {2013},
url = {https://doi.org/10.1109/TIT.2013.2258372},
doi = {10.1109/TIT.2013.2258372},
timestamp = {Thu, 01 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/JainSWZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JainSWZ13,
author = {Rahul Jain and
Yaoyun Shi and
Zhaohui Wei and
Shengyu Zhang},
editor = {Sanjeev Khanna},
title = {Efficient protocols of generating bipartite classical distributions
and quantum states},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {1503--1512},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.108},
doi = {10.1137/1.9781611973105.108},
timestamp = {Thu, 01 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/JainSWZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/MillerS13,
author = {Carl A. Miller and
Yaoyun Shi},
editor = {Simone Severini and
Fernando G. S. L. Brand{\~{a}}o},
title = {Optimal Robust Self-Testing by Binary Nonlocal {XOR} Games},
booktitle = {8th Conference on the Theory of Quantum Computation, Communication
and Cryptography, {TQC} 2013, May 21-23, 2013, Guelph, Canada},
series = {LIPIcs},
volume = {22},
pages = {254--262},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.TQC.2013.254},
doi = {10.4230/LIPICS.TQC.2013.254},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/tqc/MillerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ShiW12,
author = {Yaoyun Shi and
Xiaodi Wu},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Epsilon-Net Method for Optimizations over Separable States},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {798--809},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_67},
doi = {10.1007/978-3-642-31594-7\_67},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ShiW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-1153,
author = {Rahul Jain and
Yaoyun Shi and
Zhaohui Wei and
Shengyu Zhang},
title = {Correlation/Communication complexity of generating bipartite states},
journal = {CoRR},
volume = {abs/1203.1153},
year = {2012},
url = {http://arxiv.org/abs/1203.1153},
eprinttype = {arXiv},
eprint = {1203.1153},
timestamp = {Thu, 01 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-1153.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-2675,
author = {Yaoyun Shi},
title = {Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities},
journal = {CoRR},
volume = {abs/1203.2675},
year = {2012},
url = {http://arxiv.org/abs/1203.2675},
eprinttype = {arXiv},
eprint = {1203.2675},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-2675.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MarkovS11,
author = {Igor L. Markov and
Yaoyun Shi},
title = {Constant-Degree Graph Expansions that Preserve Treewidth},
journal = {Algorithmica},
volume = {59},
number = {4},
pages = {461--470},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9312-5},
doi = {10.1007/S00453-009-9312-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MarkovS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/ChitambarMS11,
author = {Eric Chitambar and
Carl A. Miller and
Yaoyun Shi},
title = {Deciding unitary equivalence between matrix polynomials and sets of
bipartite quantum states},
journal = {Quantum Inf. Comput.},
volume = {11},
number = {9{\&}10},
pages = {813--819},
year = {2011},
url = {https://doi.org/10.26421/QIC11.9-10-6},
doi = {10.26421/QIC11.9-10-6},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/ChitambarMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/DuanS10,
author = {Runyao Duan and
Yaoyun Shi},
title = {When is there a multipartite maximum entangled state?},
journal = {Quantum Inf. Comput.},
volume = {10},
number = {11{\&}12},
pages = {925--935},
year = {2010},
url = {https://doi.org/10.26421/QIC10.11-12-3},
doi = {10.26421/QIC10.11-12-3},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/DuanS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuSS10,
author = {Ye Du and
Rahul Sami and
Yaoyun Shi},
title = {Path auctions with multiple edge ownership},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {1},
pages = {293--300},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.09.032},
doi = {10.1016/J.TCS.2009.09.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangS10,
author = {Zhiqiang Zhang and
Yaoyun Shi},
title = {On the parity complexity measures of Boolean functions},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {26-28},
pages = {2612--2618},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.03.027},
doi = {10.1016/J.TCS.2010.03.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-0436,
author = {Zhiqiang Zhang and
Yaoyun Shi},
title = {On the parity complexity measures of Boolean functions},
journal = {CoRR},
volume = {abs/1004.0436},
year = {2010},
url = {http://arxiv.org/abs/1004.0436},
eprinttype = {arXiv},
eprint = {1004.0436},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-0436.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/ZhangS09,
author = {Zhiqiang Zhang and
Yaoyun Shi},
title = {Communication complexities of symmetric {XOR} functions},
journal = {Quantum Inf. Comput.},
volume = {9},
number = {3{\&}4},
pages = {255--263},
year = {2009},
url = {https://doi.org/10.26421/QIC9.3-4-5},
doi = {10.26421/QIC9.3-4-5},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/ZhangS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/ShiZ09,
author = {Yaoyun Shi and
Yufan Zhu},
title = {Quantum communication complexity of block-composed functions},
journal = {Quantum Inf. Comput.},
volume = {9},
number = {5{\&}6},
pages = {444--460},
year = {2009},
url = {https://doi.org/10.26421/QIC9.5-6-7},
doi = {10.26421/QIC9.5-6-7},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/ShiZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/FengS09,
author = {Yuan Feng and
Yaoyun Shi},
title = {Characterizing locally indistinguishable orthogonal product states},
journal = {{IEEE} Trans. Inf. Theory},
volume = {55},
number = {6},
pages = {2799--2806},
year = {2009},
url = {https://doi.org/10.1109/TIT.2009.2018330},
doi = {10.1109/TIT.2009.2018330},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/FengS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShiZ08,
author = {Yaoyun Shi and
Yufan Zhu},
title = {Tensor Norms and the Classical Communication Complexity of Nonlocal
Quantum Measurement},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {3},
pages = {753--766},
year = {2008},
url = {https://doi.org/10.1137/050644768},
doi = {10.1137/050644768},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ShiZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MarkovS08,
author = {Igor L. Markov and
Yaoyun Shi},
title = {Simulating Quantum Computation by Contracting Tensor Networks},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {3},
pages = {963--981},
year = {2008},
url = {https://doi.org/10.1137/050644756},
doi = {10.1137/050644756},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MarkovS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Shi08,
author = {Yaoyun Shi},
editor = {Ming{-}Yang Kao},
title = {Quantum Algorithm for the Parity Problem},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_309},
doi = {10.1007/978-0-387-30162-4\_309},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Shi08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0808-1762,
author = {Yaoyun Shi and
Zhiqiang Zhang},
title = {Communication Complexities of {XOR} functions},
journal = {CoRR},
volume = {abs/0808.1762},
year = {2008},
url = {http://arxiv.org/abs/0808.1762},
eprinttype = {arXiv},
eprint = {0808.1762},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0808-1762.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/airweb/DuSZ07,
author = {Ye Du and
Yaoyun Shi and
Xin Zhao},
editor = {Carlos Castillo and
Kumar Chellapilla and
Brian D. Davison},
title = {Using Spam Farm to Boost PageRank},
booktitle = {AIRWeb 2007, Third International Workshop on Adversarial Information
Retrieval on the Web, co-located with the {WWW} conference, Banff,
Canada, May 2007},
series = {{ACM} International Conference Proceeding Series},
volume = {215},
pages = {29--36},
year = {2007},
url = {http://airweb.cse.lehigh.edu/2007/papers/paper\_102.pdf},
doi = {10.1145/1244408.1244415},
timestamp = {Thu, 19 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/airweb/DuSZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0707-3622,
author = {Igor L. Markov and
Yaoyun Shi},
title = {Constant-degree graph expansions that preserve the treewidth},
journal = {CoRR},
volume = {abs/0707.3622},
year = {2007},
url = {http://arxiv.org/abs/0707.3622},
eprinttype = {arXiv},
eprint = {0707.3622},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0707-3622.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangSZZ06,
author = {Wei Huang and
Yaoyun Shi and
Shengyu Zhang and
Yufan Zhu},
title = {The communication complexity of the Hamming distance problem},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {149--153},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.01.014},
doi = {10.1016/J.IPL.2006.01.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangSZZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciss/ShiS06,
author = {Yaoyun Shi and
Emina Soljanin},
title = {On Multicast in Quantum Networks},
booktitle = {40th Annual Conference on Information Sciences and Systems, {CISS}
2006, Princeton, NJ, USA, 22-24 March 2006},
pages = {871--876},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/CISS.2006.286589},
doi = {10.1109/CISS.2006.286589},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciss/ShiS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Shi05,
author = {Yaoyun Shi},
title = {Quantum and classical tradeoffs},
journal = {Theor. Comput. Sci.},
volume = {344},
number = {2-3},
pages = {335--345},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.03.053},
doi = {10.1016/J.TCS.2005.03.053},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Shi05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Shi05,
author = {Yaoyun Shi},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Tensor norms and the classical communication complexity of nonlocal
quantum measurement},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {460--467},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060659},
doi = {10.1145/1060590.1060659},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Shi05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AaronsonS04,
author = {Scott Aaronson and
Yaoyun Shi},
title = {Quantum lower bounds for the collision and the element distinctness
problems},
journal = {J. {ACM}},
volume = {51},
number = {4},
pages = {595--605},
year = {2004},
url = {https://doi.org/10.1145/1008731.1008735},
doi = {10.1145/1008731.1008735},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AaronsonS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/AmbainisS04,
author = {Andris Ambainis and
Yaoyun Shi},
title = {Distributed construction of quantum fingerprints},
journal = {Quantum Inf. Comput.},
volume = {4},
number = {2},
pages = {146--151},
year = {2004},
url = {https://doi.org/10.26421/QIC4.2-6},
doi = {10.26421/QIC4.2-6},
timestamp = {Fri, 30 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/AmbainisS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-023,
author = {Yaoyun Shi},
title = {Quantum and Classical Tradeoffs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-023}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-023/index.html},
eprinttype = {ECCC},
eprint = {TR04-023},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/Shi03,
author = {Yaoyun Shi},
title = {Both Toffoli and controlled-NOT need little help to do universal quantum
computing},
journal = {Quantum Inf. Comput.},
volume = {3},
number = {1},
pages = {84--92},
year = {2003},
url = {https://doi.org/10.26421/QIC3.1-7},
doi = {10.26421/QIC3.1-7},
timestamp = {Fri, 30 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/Shi03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HoyerNS02,
author = {Peter H{\o}yer and
Jan Neerbek and
Yaoyun Shi},
title = {Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {429--448},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0976-3},
doi = {10.1007/S00453-002-0976-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HoyerNS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shi02,
author = {Yaoyun Shi},
title = {Entropy lower bounds for quantum decision tree complexity},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {23--27},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00191-0},
doi = {10.1016/S0020-0190(01)00191-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shi02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Shi02,
author = {Yaoyun Shi},
title = {Quantum Lower Bounds for the Collision and the Element Distinctness
Problems},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {513--519},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181975},
doi = {10.1109/SFCS.2002.1181975},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Shi02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabartiKS01,
author = {Amit Chakrabarti and
Subhash Khot and
Yaoyun Shi},
title = {Evasiveness of Subgraph Containment and Related Properties},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {866--875},
year = {2001},
url = {https://doi.org/10.1137/S0097539700382005},
doi = {10.1137/S0097539700382005},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChakrabartiKS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabartiSWY01,
author = {Amit Chakrabarti and
Yaoyun Shi and
Anthony Wirth and
Andrew Chi{-}Chih Yao},
title = {Informational Complexity and the Direct Sum Problem for Simultaneous
Message Complexity},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {270--278},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959901},
doi = {10.1109/SFCS.2001.959901},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChakrabartiSWY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HoyerNS01,
author = {Peter H{\o}yer and
Jan Neerbek and
Yaoyun Shi},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness},
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 = {346--357},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_29},
doi = {10.1007/3-540-48224-5\_29},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HoyerNS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChakrabartiKS01,
author = {Amit Chakrabarti and
Subhash Khot and
Yaoyun Shi},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Evasiveness of Subgraph Containment and Related Properties},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {110--120},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_10},
doi = {10.1007/3-540-44693-1\_10},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChakrabartiKS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shi00,
author = {Yaoyun Shi},
title = {Lower bounds of quantum black-box complexity and degree of approximating
polynomials by influence of Boolean variables},
journal = {Inf. Process. Lett.},
volume = {75},
number = {1-2},
pages = {79--83},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00069-7},
doi = {10.1016/S0020-0190(00)00069-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shi00.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 20:59 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:
