Xinzhi Zhang

According to our database, Xinzhi Zhang authored at least 8 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method.

Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

A Hyperbolic Extension of Kadison-Singer Type Results.

Ruizhe Zhang, Xinzhi Zhang

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

An improved approximation algorithm for the minimum <i>k</i>-edge connected multi-subgraph problem.

Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan, Xinzhi Zhang

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem.

Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan, Xinzhi Zhang

CoRR, 2021

Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem.

Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang

Proceedings of the Conference on Learning Theory, 2021

2020

Smoothed complexity of local max-cut and binary max-CSP.

Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

Sample complexity of single-parameter revenue maximization.

Chenghao Guo, Zhiyi Huang, Xinzhi Zhang

SIGecom Exch., 2019

Settling the sample complexity of single-parameter revenue maximization.

Chenghao Guo, Zhiyi Huang, Xinzhi Zhang

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019