Nikhil Bansal

Professor

Department of Math and CS,Eindhoven University of Technology

埃因霍温理工大学

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

Research interests:
Theoretical computer science with emphasis on design and analysis of algorithms for discrete optimization problems. I also dabble in related areas such as discrete math, complexity theory, machine learning and probability.

Papers237 papers

Sort

By YearBy Citation

On the discrepancy of random low degree set systems

Nikhil Bansal,Raghu Meka

Random Struct. Algorithms, no. 3 (2020): 695-705

EIBibtex

On-line balancing of random inputs

Nikhil Bansal,Joel H. Spencer

Random Struct. Algorithms, no. 4 (2020): 879-891

EIBibtex

$k$-Forrelation Optimally Separates Quantum and Classical Query Complexity

Nikhil Bansal, Makrand Sinha

Bibtex

Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems

Sepehr Abbasi Zadeh,Nikhil Bansal,Guru Guruganesh,Aleksandar Nikolov,Roy Schwartz,Mohit Singh

SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah Janua..., (2020): 854-873

Cited by2EIBibtex

Online Discrepancy Minimization for Stochastic Arrivals

Nikhil Bansal, Haotian Jiang,Raghu Meka,Sahil Singla, Makrand Sinha

symposium on discrete algorithms, (2020)

Bibtex

k-Forrelation Optimally Separates Quantum and Classical Query Complexity

Nikhil Bansal, Makrand Sinha

Electron. Colloquium Comput. Complex., (2020): 127

Bibtex

The ()-Server Problem on Bounded Depth Trees

Nikhil Bansal, Marek Eliés,Lukasz Jez, Grigorios Koumoutsos

ACM Trans. Algorithms, no. 2 (2019)

EIBibtex

The Gram--Schmidt Walk: A Cure for the Banaszczyk Blues

Nikhil Bansal,Daniel Dadush,Shashwat Garg,Shachar Lovett

Theory Comput., no. 1 (2019): 1-27

Cited by16EIBibtex

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Nikhil Bansal,Ola Svensson,Luca Trevisan

2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), (2019): 910.0-928

Cited by4EIBibtex

On the discrepancy of random low degree set systems

Nikhil Bansal,Raghu Meka

SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, (2019): 2557-2564

Cited by4EIBibtex

Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines

Nikhil Bansal,Aravind Srinivasan,Ola Svensson

SIAM Journal on Computing, (2019)

Cited by28Bibtex

Nested Convex Bodies are Chaseable

Nikhil Bansal, Martin Böhm, Marek Eliáš, Grigorios Koumoutsos,Seeun William Umboh

Algorithmica, no. 6 (2019): 1640-1653

Cited by18EIBibtex

On-Line Balancing of Random Inputs

Nikhil Bansal,Joel H. Spencer

arXiv: Data Structures and Algorithms, (2019)

EIBibtex

Potential-Function Proofs for Gradient Methods

Nikhil Bansal,Anupam Gupta

Theory Comput., no. 1 (2019): 1-32

EIBibtex

On a generalization of iterated and randomized rounding

Nikhil Bansal

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (2019): 1125-1135

Cited by3EIBibtex

Nested Convex Bodies are Chaseable

Nikhil Bansal,Martin Böhm, Marek Eliás, Grigorios Koumoutsos,Seeun William Umboh

SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018, (2018): 1253-1260

EIBibtex

Tight Bounds for Double Coverage Against Weak Adversaries

Nikhil Bansal, Marek Eliás,Lukasz Jez, Grigorios Koumoutsos,Kirk Pruhs

Theory Comput. Syst., no. 2 (2018): 349-365

Cited by3EIBibtex

Competitive Algorithms for Generalized k-Server in Uniform Metrics

Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos,Jesper Nederlof

SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018, (2018): 992-1001

Cited by8EIBibtex

Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems

Jian-Jia Chen,Nikhil Bansal,Samarjit Chakraborty, Georg von der Brüggen

ISAAC, (2018)

Cited by1EIBibtex

Competitive algorithms for generalized k -server in uniform metrics

Nikhil Bansal, Marek Eliáš, Grigorios Koumoutsos,Jesper Nederlof

symposium on discrete algorithms, pp.992-1001, (2018)

Bibtex

View All

Base Info Papers Patents Projects