Ashwinkumar Badanidiyuru
Ashwinkumar Badanidiyuru
Google Research Mountain View
Verified email at google.com - Homepage
Title
Cited by
Cited by
Year
Bandits with knapsacks
A Badanidiyuru, R Kleinberg, A Slivkins
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 207-216, 2013
256*2013
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
2282014
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
2152015
Fast algorithms for maximizing submodular functions
A Badanidiyuru, J VondrŠk
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete†…, 2014
1922014
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
1192012
Fast Constrained Submodular Maximization: Personalized Data Summarization.
B Mirzasoleiman, A Badanidiyuru, A Karbasi
ICML, 1358-1367, 2016
842016
Resourceful contextual bandits
A Badanidiyuru, J Langford, A Slivkins
Conference on Learning Theory, 1109-1134, 2014
822014
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
742012
Buyback Problem-Approximate Matroid Intersection with Cancellation Costs
A Badanidiyuru Varadaraja
Automata, Languages and Programming, 379-390, 2011
522011
Distributed submodular cover: Succinctly summarizing massive data
B Mirzasoleiman, A Karbasi, A Badanidiyuru, A Krause
Advances in Neural Information Processing Systems 28, 2881-2889, 2015
442015
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
402016
Approximating low-dimensional coverage problems
A Badanidiyuru, R Kleinberg, H Lee
Proceedings of the twenty-eighth annual symposium on Computational geometry†…, 2012
232012
Randomized online algorithms for the buyback problem
B Ashwinkumar, R Kleinberg
Internet and Network Economics, 529-536, 2009
222009
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
192009
Optimization with demand oracles
A Badanidiyuru, S Dobzinski, S Oren
Proceedings of the 13th ACM conference on electronic commerce, 110-127, 2012
142012
Perfectly reliable and secure communication tolerating static and mobile mixed adversary
A Choudhary, A Patra, BV Ashwinkumar, K Srinathan, CP Rangan
International Conference on Information Theoretic Security, 137-155, 2008
132008
Targeting and signaling in ad auctions
A Badanidiyuru, K Bhawalkar, H Xu
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete†…, 2018
122018
Secure message transmission in asynchronous networks
A Choudhury, A Patra, BV Ashwinkumar, K Srinathan, CP Rangan
Journal of Parallel and Distributed Computing 71 (8), 1067-1074, 2011
72011
On Round Complexity of Unconditional VSS
A Patra, A Choudhary, BV AshwinKumar, CP Rangan
Cryptology ePrint Archive, Report 2008/172, 2008
32008
The system can't perform the operation now. Try again later.
Articles 1–20