| 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 | 145 | 2016 |
| Making the most of your samples Z Huang, Y Mansour, T Roughgarden SIAM Journal on Computing (SICOMP) 47 (3), 651-674, 2018 | 143 | 2018 |
| 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 | 109 | 2016 |
| The exponential mechanism for social welfare: private, truthful, and nearly optimal Z Huang, S Kannan 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 140-149, 2012 | 98 | 2012 |
| Private matchings and allocations J Hsu, Z Huang, A Roth, T Roughgarden, ZS Wu SIAM Journal on Computing (SICOMP) 45 (6), 1953–1984, 2016 | 87 | 2016 |
| 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 | 85 | 2018 |
| 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 | 85 | 2017 |
| Bayesian incentive compatibility via fractional assignments X Bei, Z Huang 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 720-733, 2011 | 79 | 2011 |
| Primal dual gives almost optimal energy efficient online algorithms NR Devanur, Z Huang ACM Transactions on Algorithms (TALG) 14 (1), 2018 | 72 | 2018 |
| 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 | 67* | 2016 |
| 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 | 65 | 2019 |
| Simple and nearly optimal multi-item auctions Y Cai, Z Huang 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 564-577, 2013 | 65 | 2013 |
| 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 | 64* | 2019 |
| Welfare maximization with production costs: a primal dual approach Z Huang, A Kim 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 59-72, 2015 | 63* | 2015 |
| 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 | 61 | 2019 |
| Edge-weighted online bipartite matching M Fahrbach, Z Huang, R Tao, M Zadimoghaddam 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2020 | 60* | 2020 |
| Whole-page optimization and submodular welfare maximization with online bidders NR Devanur, Z Huang, N Korula, VS Mirrokni, Q Yan ACM Transactions on Economics and Computation (TEAC) 4 (3), 2016 | 59 | 2016 |
| Learning resource allocation and pricing for cloud profit maximization B Du, C Wu, Z Huang 33rd AAAI Conference on Artificial Intelligence (AAAI), 2019 | 56 | 2019 |
| 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 | 50 | 2019 |
| Online stochastic buy-sell mechanism for VNF chains in the NFV market X Zhang, Z Huang, C Wu, Z Li, FCM Lau IEEE Journal on Selected Areas in Communications (JSAC) 35 (2), 392-406, 2017 | 42 | 2017 |
nikhil r. devanurAmazonZweryfikowany adres z nikhildevanur.com
