Articles by Nikhil Bansal
Vol 20, Article 6 (pp 1-23)
On a Generalization of Iterated and Randomized Rounding
by Nikhil Bansal
On a Generalization of Iterated and Randomized Rounding
by Nikhil Bansal
Vol 15, Article 21 (pp 1-27)
The Gram--Schmidt Walk: A Cure for the Banaszczyk Blues
by Nikhil Bansal, Daniel Dadush, Shashwat Garg, and Shachar Lovett
The Gram--Schmidt Walk: A Cure for the Banaszczyk Blues
by Nikhil Bansal, Daniel Dadush, Shashwat Garg, and Shachar Lovett
Vol 15, Article 4 (pp 1-32)
[RESEARCH SURVEY]
Potential-Function Proofs for Gradient Methods
by Nikhil Bansal and Anupam Gupta
Potential-Function Proofs for Gradient Methods
by Nikhil Bansal and Anupam Gupta
Vol 12, Article 14 (pp 1-14)
[APRX-RND15 Spec Issue]
Minimizing Maximum Flow-Time on Related Machines
by Nikhil Bansal and Bouke Cloostermans
Minimizing Maximum Flow-Time on Related Machines
by Nikhil Bansal and Bouke Cloostermans
Vol 8, Article 24 (pp 533-565)
Solving Packing Integer Programs via Randomized Rounding with Alterations
by Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, and Aravind Srinivasan
Solving Packing Integer Programs via Randomized Rounding with Alterations
by Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, and Aravind Srinivasan
Vol 8, Article 9 (pp 209-229)
[Motwani Special Issue]
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
by Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, and Kirk Pruhs
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
by Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, and Kirk Pruhs
Vol 8, Article 4 (pp 69-94)
[Motwani Special Issue]
Regularity Lemmas and Combinatorial Algorithms
by Nikhil Bansal and R. Ryan Williams
Regularity Lemmas and Combinatorial Algorithms
by Nikhil Bansal and R. Ryan Williams