default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRunzhou Tao 0001
Person information
- affiliation: University of Maryland, Department of Computer Science, Joint Center for Quantum Information and Computer Science, College Park, MD, USA
- affiliation (PhD 2024): Columbia University, New York, NY, USA
Other persons with the same name
- Runzhou Tao — disambiguation page
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c12]Runzhou Tao, Hongzheng Zhu, Jason Nieh, Jianan Yao, Ronghui Gu:
Quantum Virtual Machines. OSDI 2025: 411-428- 2024
- [b1]Runzhou Tao:
Formal Verification of Quantum Software. Columbia University, USA, 2024 - [j3]Jianan Yao
, Runzhou Tao, Ronghui Gu, Jason Nieh:
Mostly Automated Verification of Liveness Properties for Distributed Protocols with Ranking Functions. Proc. ACM Program. Lang. 8(POPL): 1028-1059 (2024) - [j2]Haowei Deng, Runzhou Tao, Yuxiang Peng, Xiaodi Wu:
A Case for Synthesis of Recursive Quantum Unitary Programs. Proc. ACM Program. Lang. 8(POPL): 1759-1788 (2024) - 2023
- [i14]Haowei Deng, Runzhou Tao, Yuxiang Peng, Xiaodi Wu:
A Case for Synthesis of Recursive Quantum Unitary Programs. CoRR abs/2311.11503 (2023) - 2022
- [j1]Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam:
Edge-Weighted Online Bipartite Matching. J. ACM 69(6): 45:1-45:35 (2022) - [c11]Xiaoxiao Li, Zhao Song, Runzhou Tao, Guangyi Zhang:
A Convergence Theory for Federated Average: Beyond Smoothness. IEEE Big Data 2022: 1292-1297 - [c10]Baihe Huang, Shunhua Jiang, Zhao Song, Runzhou Tao, Ruizhe Zhang:
Solving SDP Faster: A Robust IPM Framework and Efficient Implementation. FOCS 2022: 233-244 - [c9]Sitan Chen, Zhao Song, Runzhou Tao, Ruizhe Zhang:
Symmetric Sparse Boolean Matrix Factorization and Applications. ITCS 2022: 46:1-46:25 - [c8]Jianan Yao, Runzhou Tao, Ronghui Gu, Jason Nieh:
DuoAI: Fast, Automated Inference of Inductive Invariants for Verifying Distributed Protocols. OSDI 2022: 485-501 - [c7]Runzhou Tao, Yunong Shi, Jianan Yao, Xupeng Li, Ali Javadi-Abhari, Andrew W. Cross, Frederic T. Chong, Ronghui Gu:
Giallar: push-button verification for the qiskit Quantum compiler. PLDI 2022: 641-656 - [i13]Yuxiang Peng, Kesha Hietala, Runzhou Tao, Liyi Li, Robert Rand, Michael Hicks, Xiaodi Wu:
A Formally Certified End-to-End Implementation of Shor's Factorization Algorithm. CoRR abs/2204.07112 (2022) - [i12]Runzhou Tao, Yunong Shi, Jianan Yao, Xupeng Li, Ali Javadi-Abhari, Andrew W. Cross, Frederic T. Chong, Ronghui Gu:
Giallar: Push-Button Verification for the Qiskit Quantum Compiler. CoRR abs/2205.00661 (2022) - [i11]Hang Hu, Zhao Song, Runzhou Tao, Zhaozhuo Xu, Danyang Zhuo:
Sublinear Time Algorithm for Online Weighted Bipartite Matching. CoRR abs/2208.03367 (2022) - [i10]Xiaoxiao Li, Zhao Song, Runzhou Tao, Guangyi Zhang:
A Convergence Theory for Federated Average: Beyond Smoothness. CoRR abs/2211.01588 (2022) - 2021
- [c6]Jianan Yao, Runzhou Tao, Ronghui Gu, Jason Nieh, Suman Jana, Gabriel Ryan:
DistAI: Data-Driven Automated Invariant Learning for Distributed Protocols. OSDI 2021: 405-421 - [c5]Runzhou Tao, Yunong Shi, Jianan Yao, John Hui, Frederic T. Chong, Ronghui Gu:
Gleipnir: toward practical error analysis for Quantum programs. PLDI 2021: 48-64 - [c4]Runzhou Tao, Jianan Yao, Xupeng Li, Shih-Wei Li, Jason Nieh, Ronghui Gu:
Formal Verification of a Multiprocessor Hypervisor on Arm Relaxed Memory Hardware. SOSP 2021: 866-881 - [i9]Baihe Huang, Shunhua Jiang, Zhao Song, Runzhou Tao:
Solving Tall Dense SDPs in the Current Matrix Multiplication Time. CoRR abs/2101.08208 (2021) - [i8]Sitan Chen, Zhao Song, Runzhou Tao, Ruizhe Zhang:
Symmetric Boolean Factor Analysis with Applications to InstaHide. CoRR abs/2102.01570 (2021) - [i7]Runzhou Tao, Yunong Shi, Jianan Yao, John Hui, Frederic T. Chong, Ronghui Gu:
Gleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version). CoRR abs/2104.06349 (2021) - 2020
- [c3]Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam:
Edge-Weighted Online Bipartite Matching. FOCS 2020: 412-423 - [i6]Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam:
Edge-Weighted Online Bipartite Matching. CoRR abs/2005.01929 (2020) - [i5]Baihe Huang, Zhao Song, Runzhou Tao, Ruizhe Zhang, Danyang Zhuo:
InstaHide's Sample Complexity When Mixing Two Private Images. CoRR abs/2011.11877 (2020)
2010 – 2019
- 2019
- [c2]Venkatesan Guruswami, Runzhou Tao:
Streaming Hardness of Unique Games. APPROX-RANDOM 2019: 5:1-5:12 - [c1]Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang:
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. SODA 2019: 2875-2886 - [i4]Yunong Shi, Xupeng Li, Runzhou Tao, Ali Javadi-Abhari, Andrew W. Cross, Frederic T. Chong, Ronghui Gu:
Contract-based verification of a realistic quantum compiler. CoRR abs/1908.08963 (2019) - [i3]Zhiyi Huang, Runzhou Tao:
Understanding Zadimoghaddam's Edge-weighted Online Matching Algorithm: Unweighted Case. CoRR abs/1910.02569 (2019) - 2018
- [i2]Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang:
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. CoRR abs/1810.07903 (2018) - [i1]Venkatesan Guruswami, Runzhou Tao:
Streaming Hardness of Unique Games. CoRR abs/1811.04607 (2018)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-25 23:42 CET 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:
