# Ashwinkumar Badanidiyuru

According to our database

Collaborative distances:

^{1}, Ashwinkumar Badanidiyuru authored at least 22 papers between 2008 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Targeting and Signaling in Ad Auctions.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2016

Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Fast Constrained Submodular Maximization: Personalized Data Summarization.

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

Distributed Submodular Cover: Succinctly Summarizing Massive Data.

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Lazier Than Lazy Greedy.

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Fast algorithms for maximizing submodular functions.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Streaming submodular maximization: massive data summarization on the fly.

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Resourceful Contextual Bandits.

Proceedings of The 27th Conference on Learning Theory, 2014

Robust Multi-objective Learning with Mentor Feedback.

Proceedings of The 27th Conference on Learning Theory, 2014

2013

Bandits with Knapsacks.

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission.

J. ACM, 2012

Sketching valuation functions.

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Learning on a budget: posted price mechanisms for online procurement.

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Optimization with demand oracles.

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Approximating low-dimensional coverage problems.

Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011

Secure message transmission in asynchronous networks.

J. Parallel Distrib. Comput., 2011

Buyback Problem - Approximate Matroid Intersection with Cancellation Costs.

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2009

Randomized Online Algorithms for the Buyback Problem.

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008

Perfectly Secure Message Transmission Tolerating Mixed Adversary.

IACR Cryptology ePrint Archive, 2008

On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary.

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.

Proceedings of the Information Theoretic Security, Third International Conference, 2008