Acesso público

Fully online matching

Z Huang, N Kang, ZG Tang, X Wu, Y Zhang, X Zhu

Journal of the ACM (JACM), 2020

Autorizações: National Natural Science Foundation of China, Research Grants Council, Hong Kong

SIGACT news online algorithms column 25 -- Online primal dual: beyond linear programs

Z Huang

ACM SIGACT News 45 (4), 105-119, 2014

Autorizações: Research Grants Council, Hong Kong

31 artigos disponíveis publicamente

Making the most of your samples

Z Huang, Y Mansour, T Roughgarden

SIAM Journal on Computing (SICOMP) 47 (3), 651-674, 2018

Autorizações: US National Science Foundation, US Department of Defense, Research Grants …

[PDF] hku.hk

Online auctions in IaaS clouds: welfare and profit maximization with server costs

X Zhang, Z Huang, C Wu, Z Li, F Lau

IEEE/ACM Transactions on Networking (ToN) 25 (2), 1034 - 1047, 2016

Autorizações: Natural Sciences and Engineering Research Council of Canada, Research Grants …

[PDF] acm.org

The sample complexity of auctions with side information

NR Devanur, Z Huang, CA Psomas

48th Annual ACM Symposium on Theory of Computing (STOC), 426-439, 2016

Autorizações: US National Science Foundation, Research Grants Council, Hong Kong

Private matchings and allocations

J Hsu, Z Huang, A Roth, T Roughgarden, ZS Wu

SIAM Journal on Computing (SICOMP) 45 (6), 1953–1984, 2016

Autorizações: US National Science Foundation

[PDF] hku.hk

An efficient cloud market mechanism for computing jobs with soft deadlines

R Zhou, Z Li, C Wu, Z Huang

IEEE/ACM Transactions on Networking (ToN) 25 (2), 793-805, 2017

Autorizações: Natural Sciences and Engineering Research Council of Canada, Research Grants …

How to match when all vertices arrive online

Z Huang, N Kang, ZG Tang, X Wu, Y Zhang, X Zhu

50th Annual ACM Symposium on Theory of Computing (STOC), 17-29, 2018

Autorizações: National Natural Science Foundation of China, Research Grants Council, Hong Kong

Online vertex-weighted bipartite matching: beating 1-1/e with random arrivals

Z Huang, ZG Tang, X Wu, Y Zhang

ACM Transactions on Algorithms (TALG) 15 (3), 38, 2019

Autorizações: European Commission, Research Grants Council, Hong Kong

[HTML] acm.org

Edge-weighted online bipartite matching

M Fahrbach, Z Huang, R Tao, M Zadimoghaddam

61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2020

Autorizações: US National Science Foundation

Online algorithms for covering and packing problems with convex objectives

Y Azar, N Buchbinder, THH Chan, S Chen, IR Cohen, A Gupta, Z Huang, ...

57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 148-157, 2016

Autorizações: US National Science Foundation, Research Grants Council, Hong Kong

[PDF] acm.org

Multi-scale online learning: theory and applications to online auctions and pricing

S Bubeck, N Devanur, Z Huang, R Niazadeh

Journal of Machine Learning Research (JMLR) 20 (62), 2019

Autorizações: US National Science Foundation

Primal dual gives almost optimal energy efficient online algorithms

NR Devanur, Z Huang

ACM Transactions on Algorithms (TALG) 14 (1), 2018

Autorizações: US Department of Defense

[PDF] aaai.org

Learning resource allocation and pricing for cloud profit maximization

B Du, C Wu, Z Huang

33rd AAAI Conference on Artificial Intelligence (AAAI), 2019

Autorizações: Research Grants Council, Hong Kong

Settling the sample complexity of single-parameter revenue maximization

C Guo, Z Huang, X Zhang

51st Annual ACM Symposium on Theory of Computing (STOC), 662-673, 2019

Autorizações: Research Grants Council, Hong Kong

Tight competitive ratios of classic matching algorithms in the fully online model

Z Huang, B Peng, ZG Tang, R Tao, X Wu, Y Zhang

30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2875-2886, 2019

Autorizações: Research Grants Council, Hong Kong

Jointly private convex programming

J Hsu, Z Huang, A Roth, ZS Wu

27nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 580-599, 2016

Autorizações: US National Science Foundation

Adwords in a panorama

Z Huang, Q Zhang, Y Zhang

61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2020

Autorizações: National Natural Science Foundation of China, Research Grants Council, Hong Kong

Online stochastic matching, Poisson arrivals, and the natural linear program

Z Huang, X Shu

53rd Annual ACM Symposium on Theory of Computing (STOC), 2021

Autorizações: Research Grants Council, Hong Kong