2026 Nikhil Bansal: 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	53	4774	4640	2222	2144	234	12715

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

4774

4640

2222

2144

234

12715

Overview

Nikhil Bansal is affiliated with the University of Michigan-Ann Arbor in the United States. Their research focuses primarily on computer science, with a particular emphasis on computational theory and mathematics, computer networks and communications, artificial intelligence, industrial and manufacturing engineering, and numerical analysis.

Their work covers several main topics, including:

Complexity and Algorithms in Graphs
Optimization and Search Problems
Mathematical Approximation and Integration
Computational Geometry and Mesh Generation
Optimization and Packing Problems
Artificial Intelligence in Games
Advanced Bandit Algorithms Research

Bansal has published extensively, with a notable presence in publication venues such as:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
SIAM Journal on Computing
ACM Transactions on Algorithms
Society for Industrial and Applied Mathematics eBooks

Recent publications by Bansal include:

"Pseudorandom Density Matrices," 2025, PRX Quantum
"On-line balancing of random inputs," 2020, Random Structures and Algorithms

Bansal has also collaborated frequently with other researchers, particularly:

Raghu Meka
Makrand Sinha
Jatin Batra
William Kuszmaul
Christian Coester

Aside from the papers authored solely by Bansal, they have contributed to other notable works such as:

"Improving Traditional Stock Market Prediction Algorithms using Covid-19 Analysis," 2021, 2021 International Conference on Emerging Smart Computing and Informatics (ESCI)
"Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems," 2022, ACM Transactions on Algorithms
"Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary," 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Best Publications

Correlation clustering

N. Bansal;A. Blum;S. Chawla

2116
Citations
Capacity, delay and mobility in wireless ad-hoc networks

N. Bansal;Z. Liu

506
Citations
Analysis of SRPT scheduling: investigating unfairness

Nikhil Bansal;Mor Harchol-Balter

479
Citations
Speed scaling to manage energy and temperature

Nikhil Bansal;Tracy Kimbrel;Kirk Pruhs

434
Citations
Size-based scheduling to improve web performance

Mor Harchol-Balter;Bianca Schroeder;Nikhil Bansal;Mukesh Agrawal

430
Citations
A Primal-Dual Randomized Algorithm for Weighted Paging

Nikhil Bansal;Niv Buchbinder;Joseph (Seffi) Naor

325
Citations
Speed Scaling for Weighted Flow Time

Nikhil Bansal;Kirk Pruhs;Cliff Stein

322
Citations
The Santa Claus problem

Nikhil Bansal;Maxim Sviridenko

321
Citations
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

Nikhil Bansal;Anupam Gupta;Jian Li;Julián Mestre

303
Citations
Approximation algorithms for deadline-TSP and vehicle routing with time-windows

Nikhil Bansal;Avrim Blum;Shuchi Chawla;Adam Meyerson

272
Citations
Speed Scaling with an Arbitrary Power Function

Nikhil Bansal;Ho-Leung Chan;Kirk Pruhs

243
Citations
A Polylogarithmic-Competitive Algorithm for the k-Server Problem

Nikhil Bansal;Niv Buchbinder;Aleksander Madry;Joseph (Seffi) Naor

226
Citations
Dynamic speed scaling to manage energy and temperature

N. Bansal;T. Kimbrel;K. Pruhs

225
Citations
The geometry of scheduling

N Nikhil Bansal;KR Pruhs

225
Citations
SODA: an optimizing scheduler for large-scale stream-based distributed computer systems

Joel Wolf;Nikhil Bansal;Kirsten Hildrum;Sujay Parekh

201
Citations
Constructive Algorithms for Discrepancy Minimization

Nikhil Bansal

182
Citations
SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems

Unknown

172
Citations
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Nikhil Bansal;Jos R. Correa;Claire Kenyon;Maxim Sviridenko

153
Citations
Min-Max Graph Partitioning and Small Set Expansion

Nikhil Bansal;Uriel Feige;Robert Krauthgamer;Konstantin Makarychev

143
Citations
Optimal Long Code Test with One Free Bit

Nikhil Bansal;Subhash Khot

140
Citations
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule

Nikhil Bansal;Ho-Leung Chan;Kirk Pruhs;Dmitriy Katz

82
Citations

Frequent Co-Authors

Kirk Pruhs University of Pittsburgh

Maxim Sviridenko Yahoo (United States)

Anupam Gupta Carnegie Mellon University

Joseph (Seffi) Naor Technion – Israel Institute of Technology

Niv Buchbinder Tel Aviv University

Atri Rudra University at Buffalo, State University of New York

Joel L. Wolf IBM (United States)

Mor Harchol-Balter Carnegie Mellon University

Aravind Srinivasan University of Maryland, College Park

Avrim Blum Toyota Technological Institute at Chicago

External Links

Personal website of Nikhil Bansal Google Scholar page

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

Related Online Degrees & Career Pathways

As you consider studying Computer Science in the USA, it's worth exploring related online degrees that can broaden your career opportunities. Many universities now offer flexible online programs in STEM fields, often designed for working professionals or those seeking accelerated learning options.

For those looking for a fast track, a 1 year computer science degree online can help you quickly gain in-demand skills and enter the job market sooner. If your interests extend into engineering, you might consider accredited environmental engineering degrees online or pursue an online mechanical engineering degree for a strong technical foundation.

For students curious about the physical sciences, you may ask, can you get a physics degree online? The answer is yes—many reputable programs now offer comprehensive remote study options without sacrificing academic quality.

Exploring these related online degrees enables you to diversify your skillset and create new avenues for specialization within technology, engineering, and science career pathways.