Ashwinkumar Badanidiyuru Varadaraja, B. V. Ashwinkumar
List of publications from the DBLP Bibliography Server - FAQ| 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 (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. ACM Conference on Electronic Commerce 2012: 110-127 | |
| c7 | Ashwinkumar Badanidiyuru, Robert Kleinberg, Yaron Singer: Learning on a budget: posted price mechanisms for online procurement. ACM Conference on Electronic Commerce 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 | |
| i6 | Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren: Optimization with Demand Oracles. CoRR abs/1107.2869 (2011) | |
| i5 | Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee: Approximating Low-Dimensional Coverage Problems. CoRR abs/1112.0689 (2011) | |
| 2010 | ||
| i4 | B. V. Ashwinkumar: Buyback Problem - Approximate matroid intersection with cancellation costs. CoRR abs/1009.5037 (2010) | |
| 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 | |
| i3 | 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 | |
| i2 | Arpita Patra, Ashish Choudhary, B. V. Ashwinkumar, C. Pandu Rangan: Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary. IACR Cryptology ePrint Archive 2008: 101 (2008) | |
| 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) | |
| 1 | Ashish Choudhury (Ashish Choudhary) | |
| 2 | Shahar Dobzinski | |
| 3 | Hu Fu | |
| 4 | Robert D. Kleinberg (Robert Kleinberg) | |
| 5 | Hooyeon Lee | |
| 6 | Noam Nisan | |
| 7 | Sigal Oren | |
| 8 | Arpita Patra | |
| 9 | C. Pandu Rangan (Chandrasekaran Pandu Rangan) | |
| 10 | Tim Roughgarden | |
| 11 | Yaron Singer | |
| 12 | K. Srinathan (Kannan Srinathan) |
Colors in the list of coauthors
Last update Fri May 24 22:40:52 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page