| Exponential separations in the energy complexity of leader election YJ Chang, T Kopelowitz, S Pettie, R Wang, W Zhan ACM Transactions on Algorithms (TALG) 15 (4), 1-31, 2019 | 51 | 2019 |
| k-regret minimizing set: Efficient algorithms and hardness W Cao, J Li, H Wang, K Wang, R Wang, R Chi-Wing Wong, W Zhan 20th International Conference on Database Theory (ICDT 2017), 2017 | 40 | 2017 |
| Quantum logspace algorithm for powering matrices with bounded norm U Girish, R Raz, W Zhan arXiv preprint arXiv:2006.04880, 2020 | 14 | 2020 |
| Lower bounds for XOR of forrelations U Girish, R Raz, W Zhan arXiv preprint arXiv:2007.03631, 2020 | 10 | 2020 |
| Parallel repetition for the GHZ game: A simpler proof U Girish, J Holmgren, K Mittal, R Raz, W Zhan arXiv preprint arXiv:2107.06156, 2021 | 7 | 2021 |
| Parallel repetition for all 3-player games over binary alphabet U Girish, J Holmgren, K Mittal, R Raz, W Zhan Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 6 | 2022 |
| Polynomial bounds on parallel repetition for all 3-player games with binary inputs U Girish, K Mittal, R Raz, W Zhan arXiv preprint arXiv:2204.00858, 2022 | 6 | 2022 |
| Memory-sample lower bounds for learning with classical-quantum hybrid memory Q Liu, R Raz, W Zhan Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1097-1110, 2023 | 5 | 2023 |
| Stability of generalized two-sided markets with transaction thresholds Z Li, Y Liu, P Tang, T Xu, W Zhan Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017 | 5 | 2017 |
| Certified hardness vs. randomness for log-space E Pyne, R Raz, W Zhan 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 4 | 2023 |
| The random-query model and the memory-bounded coupon collector R Raz, W Zhan Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020 | 4 | 2020 |
| Almost all even Yao-Yao graphs are spanners J Li, W Zhan arXiv preprint arXiv:1604.05814, 2016 | 4 | 2016 |
| Is untrusted randomness helpful? U Girish, R Raz, W Zhan 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023 | 3 | 2023 |
| Odd Yao-Yao graphs are not spanners Y Jin, J Li, W Zhan arXiv preprint arXiv:1704.03132, 2017 | 2 | 2017 |
| Sampling, Flowers and Communication H Yu, W Zhan 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 2024 | 1 | 2024 |
| Universality for Doubly Stochastic Matrices W Zhan arXiv preprint arXiv:2010.16257, 2020 | 1 | 2020 |
| Quantum Logspace Computations are Verifiable U Girish, R Raz, W Zhan 2024 Symposium on Simplicity in Algorithms (SOSA), 144-150, 2024 | | 2024 |
| Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions H Yu, W Zhan arXiv preprint arXiv:2306.15817, 2023 | | 2023 |
| Randomness and Quantumness in Space-Bounded Computation W Zhan Princeton University, 2023 | | 2023 |
| Odd Yao-Yao Graphs may Not be Spanners Y Jin, J Li, W Zhan arXiv preprint arXiv:1704.03132, 2017 | | 2017 |
Ran RazPrinceton UniversityVerified email at princeton.edu
