Zhiyi Huang
According to our database^{1},
Zhiyi Huang
authored at least 40 papers
between 2009 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org

at dl.acm.org
On csauthors.net:
Bibliography
2019
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model.
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
2018
Online Submodular Maximization with Free Disposal.
ACM Trans. Algorithms, 2018
How to match when all vertices arrive online.
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
Optimal Differentially Private Algorithms for kMeans Clustering.
Proceedings of the 37th ACM SIGMODSIGACTSIGAI Symposium on Principles of Database Systems, 2018
Learning Optimal Reserve Price against Nonmyopic Bidders.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
OccupationOblivious Pricing of Cloud Jobs via Online Learning.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018
Online VertexWeighted Bipartite Matching: Beating 11/e with Random Arrivals.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Online Makespan Minimization: The Power of Restart.
Proceedings of the Approximation, 2018
2017
An Efficient Cloud Market Mechanism for Computing Jobs With Soft Deadlines.
IEEE/ACM Trans. Netw., 2017
Online Stochastic BuySell Mechanism for VNF Chains in the NFV Market.
IEEE Journal on Selected Areas in Communications, 2017
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Online Auctions and Multiscale Online Learning.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
2016
Privacy Preserving Auction.
Encyclopedia of Algorithms, 2016
The sample complexity of auctions with side information.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Jointly Private Convex Programming.
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Online Algorithms for Covering and Packing Problems with Convex Objectives.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Recognizing Coverage Functions.
SIAM J. Discrete Math., 2015
Budget Constraints in Prediction Markets.
Proceedings of the ThirtyFirst Conference on Uncertainty in Artificial Intelligence, 2015
Speed Scaling in the Nonclairvoyant Model.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015
Welfare Maximization with Production Costs: A Primal Dual Approach.
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
Online Auctions in IaaS Clouds: Welfare and Profit Maximization with Server Costs.
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015
Making the Most of Your Samples.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
2014
SIGACT News Online Algorithms Column 25: Online Primal Dual: Beyond Linear Programs.
SIGACT News, 2014
Private matchings and allocations.
Proceedings of the Symposium on Theory of Computing, 2014
Exploiting Metric Structure for Efficient Private Query Release.
Proceedings of the TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms.
Proceedings of the TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
2013
Dynamic and Nonuniform Pricing Strategies for Revenue Maximization.
SIAM J. Comput., 2013
Simple and Nearly Optimal MultiItem Auctions.
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, 2013
Wholepage optimization and submodular welfare maximization with online bidders.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
2012
Testing Coverage Functions.
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
Bayesian Incentive Compatibility via Fractional Assignments.
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Algorithms for the Generalized Sorting Problem.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
BlackBox Reductions in Mechanism Design.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
On Sampling from Multivariate Distributions.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2010
Dynamic and nonuniform pricing strategies for revenue maximization.
Proceedings of the Behavioral and Quantitative Game Theory, 2010
2009
Reconstructing Numbers from Pairwise Function Values.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
Dynamic and Nonuniform Pricing Strategies for Revenue Maximization.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009