Zhiyi Huang
Orcid: 0000000329639556Affiliations:
 University of Hong Kong, Department of Computer Science, Hong Kong
According to our database^{1},
Zhiyi Huang
authored at least 73 papers
between 2009 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org

on cs.hku.hk

on dl.acm.org
On csauthors.net:
Bibliography
2024
SIAM J. Comput., 2024
Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue.
SIAM J. Comput., 2024
CoRR, 2024
Artif. Intell., 2024
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
2023
CoRR, 2023
Proceedings of the Web and Internet Economics  19th International Conference, 2023
Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs.
Proceedings of the Web and Internet Economics  19th International Conference, 2023
Proceedings of the 24th ACM Conference on Economics and Computation, 2023
2022
J. ACM, 2022
CoRR, 2022
CoRR, 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
2021
ACM Trans. Model. Perform. Evaluation Comput. Syst., 2021
IEEE Trans. Cloud Comput., 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem.
Proceedings of the Conference on Learning Theory, 2021
2020
J. ACM, 2020
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Online VertexWeighted Bipartite Matching: Beating 11/<i>e</i> with Random Arrivals.
ACM Trans. Algorithms, 2019
SIGecom Exch., 2019
Multiscale Online Learning: Theory and Applications to Online Auctions and Pricing.
J. Mach. Learn. Res., 2019
Games Econ. Behav., 2019
Understanding Zadimoghaddam's Edgeweighted Online Matching Algorithm: Weighted Case.
CoRR, 2019
Understanding Zadimoghaddam's Edgeweighted Online Matching Algorithm: Unweighted Case.
CoRR, 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model.
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence, 2019
2018
ACM Trans. Algorithms, 2018
ACM Trans. Algorithms, 2018
SIAM J. Comput., 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Near Optimal Jointly Private Packing Algorithms via Dual Multiplicative Weight Update.
Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 37th ACM SIGMODSIGACTSIGAI Symposium on Principles of Database Systems, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the Approximation, 2018
2017
IEEE/ACM Trans. Netw., 2017
Online Auctions in IaaS Clouds: Welfare and Profit Maximization With Server Costs.
IEEE/ACM Trans. Netw., 2017
IEEE J. Sel. Areas Commun., 2017
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
2016
Encyclopedia of Algorithms, 2016
ACM Trans. Economics and Comput., 2016
SIAM J. Comput., 2016
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids.
CoRR, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
SIAM J. Discret. Math., 2015
CoRR, 2015
Proceedings of the ThirtyFirst Conference on Uncertainty in Artificial Intelligence, 2015
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015
2014
SIGACT News Online Algorithms Column 25: Online Primal Dual: Beyond Linear Programs.
SIGACT News, 2014
Proceedings of the TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
2013
SIAM J. Comput., 2013
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, 2013
2012
CoRR, 2012
Proceedings of the Automata, Languages, and Programming  39th International Colloquium, 2012
The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2010
CoRR, 2010
Proceedings of the Behavioral and Quantitative Game Theory, 2010
2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009