PipeDream: Generalized pipeline parallelism for DNN training D Narayanan, A Harlap, A Phanishayee, V Seshadri, NR Devanur, ... Proceedings of the 27th ACM symposium on operating systems principles, 1-15, 2019 | 1113* | 2019 |

The adwords problem: online keyword matching with budgeted bidders under random permutations NR Devanur, TP Hayes Proceedings of the 10th ACM conference on Electronic commerce, 71-78, 2009 | 465 | 2009 |

Market equilibrium via a primal--dual algorithm for a convex program NR Devanur, CH Papadimitriou, A Saberi, VV Vazirani Journal of the ACM (JACM) 55 (5), 22, 2008 | 441* | 2008 |

Projector: Agile reconfigurable data center interconnect M Ghobadi, R Mahajan, A Phanishayee, N Devanur, J Kulkarni, ... Proceedings of the 2016 ACM SIGCOMM Conference, 216-229, 2016 | 374 | 2016 |

Near optimal online algorithms and fast approximation algorithms for resource allocation problems NR Devanur, K Jain, B Sivan, CA Wilkens Journal of the ACM (JACM) 66 (1), 1-41, 2019 | 284* | 2019 |

Bandits with global convex constraints and objective S Agrawal, NR Devanur Operations Research 67 (5), 1486-1502, 2019 | 270* | 2019 |

Randomized primal-dual analysis of ranking for online bipartite matching NR Devanur, K Jain, RD Kleinberg Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 248 | 2013 |

Fast algorithms for online stochastic convex programming S Agrawal, NR Devanur Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 201 | 2014 |

Real-time bidding algorithms for performance-based display ad allocation Y Chen, P Berkhin, B Anderson, NR Devanur Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011 | 193 | 2011 |

Convex program duality, Fisher markets, and Nash social welfare R Cole, N Devanur, V Gkatzelis, K Jain, T Mai, VV Vazirani, S Yazdanbod Proceedings of the 2017 ACM Conference on Economics and Computation, 459-460, 2017 | 186 | 2017 |

A duality-based unified approach to bayesian mechanism design Y Cai, NR Devanur, SM Weinberg SIAM Journal on Computing 50 (3), STOC16-160-STOC16-200, 2019 | 177 | 2019 |

Linear contextual bandits with knapsacks S Agrawal, N Devanur Advances in neural information processing systems 29, 2016 | 177 | 2016 |

Distributed algorithms via gradient descent for fisher markets B Birnbaum, NR Devanur, L Xiao Proceedings of the 12th ACM conference on Electronic commerce, 127-136, 2011 | 154* | 2011 |

The price of truthfulness for pay-per-click auctions NR Devanur, SM Kakade Proceedings of the 10th ACM conference on Electronic commerce, 99-106, 2009 | 153 | 2009 |

Online matching with concave returns NR Devanur, K Jain Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 145 | 2012 |

Strategyproof cost-sharing mechanisms for set cover and facility location games NR Devanur, M Mihail, VV Vazirani Proceedings of the 4th ACM Conference on Electronic Commerce, 108-114, 2003 | 145 | 2003 |

Blink: Fast and generic collectives for distributed ml G Wang, S Venkataraman, A Phanishayee, N Devanur, J Thelin, I Stoica Proceedings of Machine Learning and Systems 2, 172-186, 2020 | 138 | 2020 |

The sample complexity of auctions with side information NR Devanur, Z Huang, CA Psomas Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 122 | 2016 |

An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives S Agrawal, NR Devanur, L Li Conference on Learning Theory, 4-18, 2016 | 122* | 2016 |

Integrality gaps for sparsest cut and minimum linear arrangement problems NR Devanur, SA Khot, R Saket, NK Vishnoi Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 110 | 2006 |