The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of B. V. Ashwinkumar Ashwinkumar Badanidiyuru Ashwinkumar Badanidiyuru Varadaraja ( http://dblp.L3S.de/Authors/B._V._Ashwinkumar )

Publication years (Num. hits)
2008 (4) 2009 (3) 2010 (1) 2011 (4) 2012 (1)
Publication types (Num. hits)
article(7) inproceedings(6)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden Sketching valuation functions. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  BibTeX  RDF
1Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren Optimization with Demand Oracles Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee Approximating Low-Dimensional Coverage Problems Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Ashwinkumar Badanidiyuru Varadaraja Buyback Problem - Approximate Matroid Intersection with Cancellation Costs. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan Secure message transmission in asynchronous networks. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1B. V. Ashwinkumar Buyback Problem - Approximate matroid intersection with cancellation costs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1B. V. Ashwinkumar, Robert Kleinberg Randomized Online Algorithms for the Buyback Problem Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. Search on Bibsonomy ICDCN The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1B. V. Ashwinkumar, Robert Kleinberg Randomized Online Algorithms for the Buyback Problem. Search on Bibsonomy WINE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan Perfectly Secure Message Transmission Tolerating Mixed Adversary. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, B. V. Ashwinkumar, C. Pandu Rangan Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. Search on Bibsonomy ICITS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1B. 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. Search on Bibsonomy PODC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.