Nikhil Bansal

About Nikhil Bansal

Nikhil Bansal, With an exceptional h-index of 54 and a recent h-index of 31 (since 2020), a distinguished researcher at Technische Universiteit Eindhoven, specializes in the field of Algorithm Design, Theoretical Computer Science, Discrete Math.

His recent articles reflect a diverse array of research interests and contributions to the field:

Perseus: Removing Energy Bloat from Large Model Training

Almost Logarithmic Approximation for Cutwidth and Pathwidth

A nearly tight lower bound for the d-dimensional cow-path problem

On Minimizing Generalized Makespan on Unrelated Machines

Resolving matrix spencer conjecture up to poly-logarithmic rank

On min sum vertex cover and generalized min sum set cover

Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture

Nikhil Bansal Information

University

Position

CWI and

Citations(all)

11423

Citations(since 2020)

3572

Cited By

9393

hIndex(all)

54

hIndex(since 2020)

31

i10Index(all)

136

i10Index(since 2020)

89

Email

University Profile Page

Google Scholar

Nikhil Bansal Skills & Research Interests

Algorithm Design

Theoretical Computer Science

Discrete Math

Top articles of Nikhil Bansal

Perseus: Removing Energy Bloat from Large Model Training

arXiv preprint arXiv:2312.06902

2023/12/12

Almost Logarithmic Approximation for Cutwidth and Pathwidth

arXiv preprint arXiv:2311.15639

2023/11/27

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Roy Schwartz
Roy Schwartz

H-Index: 15

A nearly tight lower bound for the d-dimensional cow-path problem

Information Processing Letters

2023/8/1

Nikhil Bansal
Nikhil Bansal

H-Index: 31

William Kuszmaul
William Kuszmaul

H-Index: 7

On Minimizing Generalized Makespan on Unrelated Machines

arXiv preprint arXiv:2307.13937

2023/7/26

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Resolving matrix spencer conjecture up to poly-logarithmic rank

2023/6/2

On min sum vertex cover and generalized min sum set cover

SIAM Journal on Computing

2023/4/30

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

2023

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Viswanath Nagarajan
Viswanath Nagarajan

H-Index: 19

Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture

Random Structures & Algorithms

2023

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Influence in completely bounded block-multilinear forms and classical simulation of quantum algorithms

arXiv preprint arXiv:2203.00212

2022/3/1

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Discrepancy theory and related algorithms

Proc. Int. Cong. Math

2022

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Online metric allocation and time-varying regularization

2022

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Smoothed analysis of the Komlós conjecture

2022

Learning-augmented weighted paging

2022

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Ravi Kumar
Ravi Kumar

H-Index: 3

Balanced allocations: The heavily loaded case with deletions

2022/10/31

Nikhil Bansal
Nikhil Bansal

H-Index: 31

William Kuszmaul
William Kuszmaul

H-Index: 7

Sticky brownian rounding and its applications to constraint satisfaction problems

ACM Transactions on Algorithms (TALG)

2022/10/10

The power of two choices in graphical allocation

2022/6/9

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Flow time scheduling and prefix beck-fiala

2022/6/9

A unified approach to discrepancy minimization

arXiv preprint arXiv:2205.01023

2022/5/2

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Smoothed Analysis of the Koml\'os Conjecture

arXiv preprint arXiv:2204.11427

2022/4/25

Online metric allocation

arXiv preprint arXiv:2111.15169

2021/11/30

Nikhil Bansal
Nikhil Bansal

H-Index: 31

See List of Professors in Nikhil Bansal University(Technische Universiteit Eindhoven)

Co-Authors

academic-engine