| Regret bounds for sleeping experts and bandits R Kleinberg, A Niculescu-Mizil, Y Sharma Machine learning 80 (2), 245-272, 2010 | 302 | 2010 |
| Characterizing truthful multi-armed bandit mechanisms M Babaioff, Y Sharma, A Slivkins Proceedings of the 10th ACM conference on Electronic commerce, 79-88, 2009 | 206* | 2009 |
| Wormhole: Reliable {Pub-Sub} to Support Geo-replicated Internet Services Y Sharma, P Ajoux, P Ang, D Callies, A Choudhary, L Demailly, T Fersch, ... 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI …, 2015 | 70 | 2015 |
| Approximation algorithms for prize collecting forest problems with submodular penalty functions Y Sharma, C Swamy, DP Williamson SODA 7, 1275-1284, 2007 | 60 | 2007 |
| Stackelberg thresholds in network routing games or the value of altruism Y Sharma, DP Williamson Proceedings of the 8th ACM conference on Electronic commerce, 93-102, 2007 | 58 | 2007 |
| Approximation algorithms for prize-collecting network design problems with general connectivity requirements C Nagarajan, Y Sharma, DP Williamson International Workshop on Approximation and Online Algorithms, 174-187, 2008 | 14 | 2008 |
| Expressive models in online learning Y Sharma Cornell University, 2010 | | 2010 |
| An Analytical Approach to Designing Message Ferry Routes Y Sharma, L Kroc, M Balakrishnan, K Birman space 7, 3, 0 | | |
David P. WilliamsonProfessor of Operations Research, Cornell UniversityVerified email at cornell.edu
