# Zhihao Gavin Tang

According to our database

Collaborative distances:

^{1}, Zhihao Gavin Tang authored at least 35 papers between 2015 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

Proceedings of the 38th International Conference on Machine Learning, 2021

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications.

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass.

IEEE Trans. Knowl. Data Eng., 2020

SIAM J. Comput., 2020

J. ACM, 2020

CoRR, 2020

CoRR, 2020

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

Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models.

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Theor. Comput. Sci., 2019

Online Vertex-Weighted Bipartite Matching: Beating 1-1/<i>e</i> with Random Arrivals.

ACM Trans. Algorithms, 2019

SIGecom Exch., 2019

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

CoRR, 2019

CoRR, 2019

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

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

ACM Trans. Algorithms, 2018

J. ACM, 2018

CoRR, 2018

Algorithmica, 2018

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Proceedings of the Approximation, 2018

2017

Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method.

Proceedings of the 34th International Conference on Machine Learning, 2017

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids.

CoRR, 2016

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs.

CoRR, 2015

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015