Universality for Doubly Stochastic Matrices [arXiv]

Lower Bounds for XOR of Forrelations
with Uma Girish, Ran Raz [ECCC] [arXiv]

Quantum Logspace Algorithm for Powering Matrices with Bounded Norm
with Uma Girish, Ran Raz [ECCC] [arXiv]

Conference and Journal Papers

The Random-Query Model and the Memory-Bounded Coupon Collector
with Ran Raz,
in 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) [pdf] [ECCC]

Odd Yao-Yao Graphs are Not Spanners
with Yifei Jin, Jian Li,
in 34th International Symposium on Computational Geometry (SoCG 2018) [pdf] [arXiv]

Stability of Generalized Two-sided Markets with Transaction Thresholds
with Zhiyuan Li, Yicheng Liu, Pingzhong Tang, Tingting Xu,
in Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2017) [pdf]

Exponential Separations in the Energy Complexity of Leader Election
with Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang,
in Proceedings of the 49th ACM Symposium on Theory of Computing (STOC 2017) [pdf]
in ACM Transactions on Algorithms, Vol. 15, No. 4 [pdf] [arXiv]

k-Regret Minimizing Set: Efficient Algorithms and Hardness
with Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong,
in 20th International Conference on Database Theory (ICDT 2017) [pdf] (Best Newcomer Award)

Almost All Even Yao-Yao Graphs Are Spanners
with Jian Li,
in Proceedings of 24th Annual European Symposium on Algorithms (ESA 2016) [pdf] [arXiv]

Department of Computer Science

194 Nassau St., Princeton NJ 08540

Email: weizhan [at] cs [dot] princeton [dot] edu

Last Updated: Nov. 2020.