Runzhou Tao (陶润洲)
Runzhou Tao is a third-year PhD student in Department of Computer Science, Columbia Unversity.
He completes his Bachelor's Degree from Yao Class of Institute for Interdisciplinary Information Sciences, Tsinghua University. In
his undergraduate time, he was advised by Prof. Boaz Barak, Prof. Venkatesan Guruswami and Prof. Zhiyi Huang when he visited Harvard University, Carnegie Mellon University
and HKU.
Research Interests
-
Theoretical computer science: graph algorithm, online algorithm, hardness of approximation, quantum
computing, machine learning theory
-
System: program analysis, formal verification, quantum programming language
Publications
(The authors of papers in theoretical computer science are listed by alphabetical order, whereas in other papers the authors are in contribution order.)
-
Verifying a Multiprocessor Hypervisor on Arm Relaxed Memory Hardware - [code]
Runzhou Tao, Jianan Yao, Jason Nieh ,
Shih-Wei Li , Xupeng Li,
Ronghui Gu
The 28th ACM Symposium on Operating Systems Principles (SOSP 2021), to appear
-
DistAI: Data-Driven Automated Invariant Learning for Distributed Protocols - [paper]
Jianan Yao,
Runzhou Tao, Ronghui Gu, Jason Nieh , Suman Jana and Gabriel Ryan
The 15th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2021)
Jay Lepreau Best Paper Award
-
Gleipnir: Toward Practical Error Analysis for Quantum Programs - [arXiv]
Runzhou Tao, Yunong Shi, Jianan Yao, John Hui, Frederic T. Chong and Ronghui Gu
The 42nd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI
2021)
-
Edge-Weighted Online Bipartite Matching - [arXiv] [conference version]
Matthew
Fahrbach, Zhiyi
Huang, Runzhou Tao and Morteza
Zadimoghaddam
The 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2020)
Best Paper Award
-
Streaming Hardness of Unique Games - [arXiv] [conference version]
Venkatesan
Guruswami and Runzhou Tao
The 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems
(APPROX 2019)
-
Tight Competitive Ratios of Classic Matching Algorithms The Fully Online Model - [arXiv] [conference
version]
Zhiyi Huang, Binghui
Peng, Zhihao
Gavin Tang, Runzhou Tao,
Xiaowei
Wu and Yuhao
Zhang
The 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)
Manuscripts
-
Symmetric Boolean Factor Analysis with Applications to InstaHide - [arXiv]
Sitan Chen, Zhao
Song, Runzhou
Tao and Ruizhe
Zhang
Manuscript, 2021
Solving Tall Dense SDPs The Current Matrix Multiplication Time - [arXiv]
Baihe Huang, Shunhua Jiang, Zhao Song and Runzhou Tao
Manuscript, 2021
InstaHide's Sample Complexity When Mixing Two Private Images - [arXiv]
Baihe Huang, Zhao Song, Runzhou Tao, Ruizhe Zhang and Danyang Zhuo
Manuscript, 2020
CertiQ: A Mostly-automated Verification of a Realistic Quantum Compiler
Yunong Shi, Runzhou Tao, Xupeng Li, Ali Javadi-Abhari, Andrew W. Cross, Frederic T. Chong and Ronghui Gu
Manuscript, 2020
Contact
|