Ashwinkumar Badanidiyuru
Ashwinkumar Badanidiyuru Varadaraja – B. V. Ashwinkumar
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
- [j3]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
Bandits with Knapsacks. J. ACM 65(3): 13:1-13:55 (2018) - [c19]Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu:
Targeting and Signaling in Ad Auctions. SODA 2018: 2545-2563 - 2017
- [i10]Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu:
Targeting and Signaling in Ad Auctions. CoRR abs/1708.00611 (2017) - 2016
- [c18]Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi:
Fast Constrained Submodular Maximization: Personalized Data Summarization. ICML 2016: 1358-1367 - [c17]Ashwinkumar Badanidiyuru, Christos H. Papadimitriou, Aviad Rubinstein, Lior Seeman, Yaron Singer:
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions. SODA 2016: 414-429 - 2015
- [c16]Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, Andreas Krause:
Lazier Than Lazy Greedy. AAAI 2015: 1812-1818 - [c15]Baharan Mirzasoleiman, Amin Karbasi, Ashwinkumar Badanidiyuru, Andreas Krause:
Distributed Submodular Cover: Succinctly Summarizing Massive Data. NIPS 2015: 2881-2889 - [i9]Ashwinkumar Badanidiyuru, Christos H. Papadimitriou, Aviad Rubinstein, Lior Seeman, Yaron Singer:
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions. CoRR abs/1507.02351 (2015) - 2014
- [c14]Alekh Agarwal, Ashwinkumar Badanidiyuru, Miroslav Dudík, Robert E. Schapire, Aleksandrs Slivkins:
Robust Multi-objective Learning with Mentor Feedback. COLT 2014: 726-741 - [c13]Ashwinkumar Badanidiyuru, John Langford, Aleksandrs Slivkins:
Resourceful Contextual Bandits. COLT 2014: 1109-1134 - [c12]Ashwinkumar Badanidiyuru, Baharan Mirzasoleiman, Amin Karbasi, Andreas Krause:
Streaming submodular maximization: massive data summarization on the fly. KDD 2014: 671-680 - [c11]Ashwinkumar Badanidiyuru, Jan Vondrák:
Fast algorithms for maximizing submodular functions. SODA 2014: 1497-1514 - [i8]Ashwinkumar Badanidiyuru, John Langford, Aleksandrs Slivkins:
Resourceful Contextual Bandits. CoRR abs/1402.6779 (2014) - [i7]Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, Andreas Krause:
Lazier Than Lazy Greedy. CoRR abs/1409.7938 (2014) - 2013
- [c10]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
Bandits with Knapsacks. FOCS 2013: 207-216 - [i6]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
Bandits with Knapsacks. CoRR abs/1305.2545 (2013) - 2012
- [j2]Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan:
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. J. ACM 59(5): 22:1-22:35 (2012) - [c9]Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee:
Approximating low-dimensional coverage problems. Symposium on Computational Geometry 2012: 161-170 - [c8]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren:
Optimization with demand oracles. EC 2012: 110-127 - [c7]Ashwinkumar Badanidiyuru, Robert Kleinberg, Yaron Singer:
Learning on a budget: posted price mechanisms for online procurement. EC 2012: 128-145 - [c6]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden:
Sketching valuation functions. SODA 2012: 1025-1035 - 2011
- [j1]Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
Secure message transmission in asynchronous networks. J. Parallel Distrib. Comput. 71(8): 1067-1074 (2011) - [c5]Ashwinkumar Badanidiyuru Varadaraja:
Buyback Problem - Approximate Matroid Intersection with Cancellation Costs. ICALP (1) 2011: 379-390 - [i5]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren:
Optimization with Demand Oracles. CoRR abs/1107.2869 (2011) - [i4]Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee:
Approximating Low-Dimensional Coverage Problems. CoRR abs/1112.0689 (2011) - 2010
- [i3]B. V. Ashwinkumar:
Buyback Problem - Approximate matroid intersection with cancellation costs. CoRR abs/1009.5037 (2010)
2000 – 2009
- 2009
- [c4]Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. ICDCN 2009: 148-162 - [c3]B. V. Ashwinkumar, Robert Kleinberg:
Randomized Online Algorithms for the Buyback Problem. WINE 2009: 529-536 - [i2]B. V. Ashwinkumar, Robert Kleinberg:
Randomized Online Algorithms for the Buyback Problem. CoRR abs/0908.0043 (2009) - 2008
- [c2]Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan:
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. ICITS 2008: 137-155 - [c1]B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan:
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. PODC 2008: 115-124 - [i1]Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
Perfectly Secure Message Transmission Tolerating Mixed Adversary. IACR Cryptology ePrint Archive 2008: 232 (2008)
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-20 21:56 CEST by the dblp team