| Bandits with knapsacks A Badanidiyuru, R Kleinberg, A Slivkins Journal of the ACM (JACM) 65 (3), 1-55, 2018 | 529 | 2018 |
| Lazier than lazy greedy B Mirzasoleiman, A Badanidiyuru, A Karbasi, J Vondrák, A Krause Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015 | 437 | 2015 |
| Streaming submodular maximization: Massive data summarization on the fly A Badanidiyuru, B Mirzasoleiman, A Karbasi, A Krause Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014 | 408 | 2014 |
| Fast algorithms for maximizing submodular functions A Badanidiyuru, J Vondrák Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 351 | 2014 |
| Fast constrained submodular maximization: Personalized data summarization B Mirzasoleiman, A Badanidiyuru, A Karbasi International Conference on Machine Learning, 1358-1367, 2016 | 182 | 2016 |
| Learning on a budget: posted price mechanisms for online procurement A Badanidiyuru, R Kleinberg, Y Singer Proceedings of the 13th ACM conference on electronic commerce, 128-145, 2012 | 155 | 2012 |
| Resourceful contextual bandits A Badanidiyuru, J Langford, A Slivkins Conference on Learning Theory, 1109-1134, 2014 | 154 | 2014 |
| Sketching valuation functions A Badanidiyuru, S Dobzinski, H Fu, R Kleinberg, N Nisan, T Roughgarden Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 91 | 2012 |
| Autobidding with constraints G Aggarwal, A Badanidiyuru, A Mehta Web and Internet Economics: 15th International Conference, WINE 2019, New …, 2019 | 85 | 2019 |
| Distributed submodular cover: Succinctly summarizing massive data B Mirzasoleiman, A Karbasi, A Badanidiyuru, A Krause Advances in Neural Information Processing Systems 28, 2015 | 70 | 2015 |
| Buyback Problem-Approximate Matroid Intersection with Cancellation Costs A Badanidiyuru Varadaraja Automata, Languages and Programming, 379-390, 2011 | 62 | 2011 |
| Targeting and signaling in ad auctions A Badanidiyuru, K Bhawalkar, H Xu Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete …, 2018 | 57 | 2018 |
| Online learning via offline greedy algorithms: Applications in market design and optimization R Niazadeh, N Golrezaei, JR Wang, F Susan, A Badanidiyuru Proceedings of the 22nd ACM Conference on Economics and Computation, 737-738, 2021 | 56* | 2021 |
| Locally adaptive optimization: Adaptive seeding for monotone submodular functions A Badanidiyuru, C Papadimitriou, A Rubinstein, L Seeman, Y Singer Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 44 | 2016 |
| Approximating low-dimensional coverage problems A Badanidiyuru, R Kleinberg, H Lee Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012 | 29 | 2012 |
| Optimization with demand oracles A Badanidiyuru, S Dobzinski, S Oren Proceedings of the 13th ACM conference on electronic commerce, 110-127, 2012 | 24* | 2012 |
| Randomized online algorithms for the buyback problem B Ashwinkumar, R Kleinberg Internet and Network Economics, 529-536, 2009 | 23 | 2009 |
| On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission A Badanidiyuru, A Patra, A Choudhury, K Srinathan, CP Rangan Journal of the ACM (JACM) 59 (5), 1-35, 2012 | 20* | 2012 |
| On minimal connectivity requirement for secure message transmission in asynchronous networks A Choudhary, A Patra, BV Ashwinkumar, K Srinathan, CP Rangan International Conference on Distributed Computing and Networking, 148-162, 2009 | 20 | 2009 |
| Submodular maximization through barrier functions A Badanidiyuru, A Karbasi, E Kazemi, J Vondrák Advances in neural information processing systems 33, 524-534, 2020 | 18 | 2020 |
Amin KarbasiRobust Intelligence, Yale University (on leave)在 yale.edu 的电子邮件经过验证
