2026 Nikhil R. Devanur: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	34	12067	11717	4917	4697	104	5871

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

12067

11717

4917

4697

104

5871

Overview

Nikhil R. Devanur is affiliated with Amazon in the United States. Their research contributions span primarily the field of Decision Sciences with a focus on Management Science and Operations Research. They have also engaged in studies related to Computer Networks and Communications, Management Information Systems, Economics and Econometrics, as well as Electrical and Electronic Engineering.

The scientist's published work addresses multiple themes within their fields of study. Major topics covered include:

Auction Theory and Applications
Optimization and Search Problems
Supply Chain and Inventory Management
Economic theories and models
Game Theory and Applications
Advanced Neural Network Applications
Ferroelectric and Negative Capacitance Devices

Their recent papers include the following:

Efficient Algorithms for Device Placement of DNN Graph Operators (2020), published in arXiv (Cornell University)
Static Pricing for Multi-unit Prophet Inequalities (2023), published in Operations Research
Static pricing for multi-unit prophet inequalities (2020), published in arXiv (Cornell University)
Simple pricing schemes for consumers with evolving values (2022), published in Games and Economic Behavior
Designing a Combinatorial Financial Options Market (2021), published in arXiv (Cornell University)

Frequent collaborators in their research include:

Shuchi Chawla
Thodoris Lykouris
Anna R. Karlin
Balasubramanian Sivan
Jakub Tarnawski

The primary venues where this scientist has published are:

arXiv (Cornell University)
Games and Economic Behavior
Operations Research

Best Publications

PipeDream: generalized pipeline parallelism for DNN training

Deepak Narayanan;Aaron Harlap;Amar Phanishayee;Vivek Seshadri

696
Citations
The adwords problem: online keyword matching with budgeted bidders under random permutations

Nikhil R. Devanur;Thomas P. Hayes

419
Citations
ProjecToR: Agile Reconfigurable Data Center Interconnect

Monia Ghobadi;Ratul Mahajan;Amar Phanishayee;Nikhil Devanur

337
Citations
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems

Nikhil R. Devanur;Kamal Jain;Balasubramanian Sivan;Christopher A. Wilkens

276
Citations
Market equilibrium via a primal--dual algorithm for a convex program

Nikhil R. Devanur;Christos H. Papadimitriou;Amin Saberi;Vijay V. Vazirani

259
Citations
Randomized primal-dual analysis of RANKING for online bipartite matching

Nikhil R. Devanur;Kamal Jain;Robert D. Kleinberg

191
Citations
Market equilibrium via a primal-dual-type algorithm

N.R. Devanur;C.H. Papadimitriou;A. Saberi;V.V. Vazirani

184
Citations
Real-time bidding algorithms for performance-based display ad allocation

Ye Chen;Pavel Berkhin;Bo Anderson;Nikhil R. Devanur

180
Citations
A Duality-Based Unified Approach to Bayesian Mechanism Design

Yang Cai;Nikhil R. Devanur;S. Matthew Weinberg

170
Citations
Bandits with concave rewards and convex knapsacks

Shipra Agrawal;Nikhil R. Devanur

161
Citations
Fast algorithms for online stochastic convex programming

Shipra Agrawal;Nikhil R. Devanur

159
Citations
Convex Program Duality, Fisher Markets, and Nash Social Welfare

Richard Cole;Nikhil Devanur;Vasilis Gkatzelis;Kamal Jain

145
Citations
PipeDream: Fast and Efficient Pipeline Parallel DNN Training.

Aaron Harlap;Deepak Narayanan;Amar Phanishayee;Vivek Seshadri

142
Citations
Online matching with concave returns

Nikhil R. Devanur;Kamal Jain

138
Citations
Strategyproof cost-sharing mechanisms for set cover and facility location games

Nikhil R. Devanur;Milena Mihail;Vijay V. Vazirani

136
Citations
The sample complexity of auctions with side information

Nikhil R. Devanur;Zhiyi Huang;Christos-Alexandros Psomas

113
Citations
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms

Nikhil R. Devanur;Zhiyi Huang

111
Citations
Integrality gaps for sparsest cut and minimum linear arrangement problems

Nikhil R. Devanur;Subhash A. Khot;Rishi Saket;Nisheeth K. Vishnoi

109
Citations
Distributed algorithms via gradient descent for fisher markets

Benjamin Birnbaum;Nikhil R. Devanur;Lin Xiao

103
Citations
Linear Contextual Bandits with Knapsacks

Shipra Agrawal;Nikhil R. Devanur

100
Citations
Blink: Fast and Generic Collectives for Distributed ML

Guanhua Wang;Shivaram Venkataraman;Amar Phanishayee;Jorgen Thelin

32
Citations

Frequent Co-Authors

Vijay V. Vazirani University of California, Irvine

Kamal Jain Microsoft (United States)

Jason D. Hartline Northwestern University

Anna R. Karlin University of Washington

Yuval Rabani Hebrew University of Jerusalem

Richard Cole New York University

Sébastien Bubeck Microsoft (United States)

Yossi Azar Tel Aviv University

Amin Saberi Stanford University

Lin Xiao Facebook (United States)

External Links

Personal website of Nikhil R. Devanur

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens up various opportunities for affordable and flexible online education. If you’re looking to save on tuition, consider programs like the cheapest data science degree options, which allow you to gain in-demand skills at a lower cost.

For those interested in technical fields, online electrical engineering courses USA offer practical training while providing the flexibility to study from anywhere. Such online courses make it easier to balance education and other commitments.

Many students are also drawn to easy certifications that pay well. These short programs can quickly boost your qualifications and help launch or advance a tech career without a significant time commitment.

If you’re seeking a rapid academic path, consider the shortest online masters degree programs available. Earning a master’s in less time means faster entry into competitive roles in computer science and related industries.