Upper Bounds for MaxSat: Further Improved. - Nikhil Bansal 001; Venkatesh Raman 001 (ISAAC, 1999)

SRPT Scheduling for Web Servers. - Mor Harchol-Balter; Nikhil Bansal 001; Bianca Schroeder; Mukesh Agrawal 002 (JSSPP, 2001)

Analysis of SRPT scheduling: investigating unfairness. - Nikhil Bansal 001; Mor Harchol-Balter (SIGMETRICS/Performance, 2001)

Analysis of M/G/1/SRPT under transient overload. - Nikhil Bansal 001; Mor Harchol-Balter (SIGMETRICS Perform. Evaluation Rev., 2001)

Bin-Packing with Fragile Objects. - Nikhil Bansal 001; Zhen Liu; Arvind Sankar (IFIP TCS, 2002)

Scheduling for Flow-Time with Admission Control. - Nikhil Bansal 001; Avrim Blum; Shuchi Chawla 001; Kedar Dhamdhere (ESA, 2003)

Improving Web Performance in Broadcast-Unicast Networks. - Mukesh Agrawal 002; Amit Manjhi; Nikhil Bansal 001; Srinivasan Seshan (INFOCOM, 2003)

Capacity, Delay and Mobility in Wireless Ad-Hoc Networks. - Nikhil Bansal 001; Zhen Liu (INFOCOM, 2003)

Online oblivious routing. - Nikhil Bansal 001; Avrim Blum; Shuchi Chawla 001; Adam Meyerson (SPAA, 2003)

Server scheduling in the Lp norm: a rising tide lifts all boat. - Nikhil Bansal 001; Kirk Pruhs (STOC, 2003)

Analysis of the M/G/1 processor-sharing queue with bulk arrivals. - Nikhil Bansal 001 (Oper. Res. Lett., 2003)

Size-based scheduling to improve web performance. - Mor Harchol-Balter; Bianca Schroeder; Nikhil Bansal 001; Mukesh Agrawal 002 (ACM Trans. Comput. Syst., 2003)

Efficient Algorithms for Finding Submasses in Weighted Strings. - Nikhil Bansal 001; Mark Cieliebak; Zsuzsanna Lipták (CPM, 2004)

Dynamic Speed Scaling to Manage Energy and Temperature. - Nikhil Bansal 001; Tracy Kimbrel; Kirk Pruhs (FOCS, 2004)

Further Improvements in Competitive Guarantees for QoS Buffering. - Nikhil Bansal 001; Lisa Fleischer; Tracy Kimbrel; Mohammad Mahdian; Baruch Schieber; Maxim Sviridenko (ICALP, 2004)

Server Scheduling in the Weighted lp Norm. - Nikhil Bansal 001; Kirk Pruhs (LATIN, 2004)

On minimizing the total flow time on multiple machines. - Nikhil Bansal 001 (SODA, 2004)

New approximability and inapproximability results for 2-dimensional Bin Packing. - Nikhil Bansal 001; Maxim Sviridenko (SODA, 2004)

Approximation algorithms for deadline-TSP and vehicle routing with time-windows. - Nikhil Bansal 001; Avrim Blum; Shuchi Chawla 001; Adam Meyerson (STOC, 2004)

Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. - Nikhil Bansal 001; Kedar Dhamdhere; Jochen Könemann; Amitabh Sinha (Algorithmica, 2004)

Correlation Clustering. - Nikhil Bansal 001; Avrim Blum; Shuchi Chawla 001 (Mach. Learn., 2004)

A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues. - Adam Wierman; Nikhil Bansal 001; Mor Harchol-Balter (Oper. Res. Lett., 2004)

A Tale of Two Dimensional Bin Packing. - Nikhil Bansal 001; Andrea Lodi 001; Maxim Sviridenko (FOCS, 2005)

Approximating the average response time in broadcast scheduling. - Nikhil Bansal 001; Moses Charikar; Sanjeev Khanna; Joseph Naor (SODA, 2005)

Speed Scaling to Manage Temperature. - Nikhil Bansal 001; Kirk Pruhs (STACS, 2005)

Minimizing Makespan in No-Wait Job Shops. - Nikhil Bansal 001; Mohammad Mahdian; Maxim Sviridenko (Math. Oper. Res., 2005)

On the average sojourn time under M/M/1/SRPT. - Nikhil Bansal 001 (Oper. Res. Lett., 2005)

Minimizing flow time on a constant number of machines with preemption. - Nikhil Bansal 001 (Oper. Res. Lett., 2005)

Minimizing Setup and Beam-On Times in Radiation Therapy. - Nikhil Bansal 001; Don Coppersmith; Baruch Schieber (APPROX-RANDOM, 2006)

Improved approximation algorithms for multidimensional bin packing problems. - Nikhil Bansal 001; Alberto Caprara; Maxim Sviridenko (FOCS, 2006)

A quasi-PTAS for unsplittable flow on line graphs. - Nikhil Bansal 001; Amit Chakrabarti; Amir Epstein; Baruch Schieber (STOC, 2006)

The Santa Claus problem. - Nikhil Bansal 001; Maxim Sviridenko (STOC, 2006)

Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. - Nikhil Bansal 001; José R. Correa; Claire Kenyon; Maxim Sviridenko (Math. Oper. Res., 2006)

Job Shop Scheduling with Unit Processing Times. - Nikhil Bansal 001; Tracy Kimbrel; Maxim Sviridenko (Math. Oper. Res., 2006)

Handling load with less stress. - Nikhil Bansal 001; David Gamarnik (Queueing Syst. Theory Appl., 2006)

An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. - Nikhil Bansal 001; Niv Buchbinder; Anupam Gupta 001; Joseph Naor (ESA, 2007)

Non-Preemptive Min-Sum Scheduling with Resource Augmentation. - Nikhil Bansal 001; Ho-Leung Chan; Rohit Khandekar; Kirk Pruhs; Clifford Stein 001; Baruch Schieber (FOCS, 2007)

Harmonic algorithm for 3-dimensional strip packing problem. - Nikhil Bansal 001; Xin Han; Kazuo Iwama; Maxim Sviridenko; Guochuan Zhang (SODA, 2007)

Finding submasses in weighted strings with Fast Fourier Transform. - Nikhil Bansal 001; Mark Cieliebak; Zsuzsanna Lipták (Discret. Appl. Math., 2007)

Two-dimensional bin packing with one-dimensional resource augmentation. - Nikhil Bansal 001; Maxim Sviridenko (Discret. Optim., 2007)

Speed scaling to manage energy and temperature. - Nikhil Bansal 001; Tracy Kimbrel; Kirk Pruhs (J. ACM, 2007)

Minimizing weighted flow time. - Nikhil Bansal 001; Kedar Dhamdhere (ACM Trans. Algorithms, 2007)

Scheduling for Speed Bounded Processors. - Nikhil Bansal 001; Ho-Leung Chan; Tak Wah Lam; Lap-Kei Lee (ICALP (1), 2008)

Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications. - Nikhil Bansal 001; Ranjita Bhagwan; Navendu Jain; Yoonho Park; Deepak S. Turaga; Chitra Venkatramani (INFOCOM, 2008)

Transport security using mobile technology. - P. Panjiyar; P. Mourya; Nikhil Bansal 001; P. Srivastava; A. Mukherjee (ISI, 2008)

SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems. - Joel L. Wolf; Nikhil Bansal 001; Kirsten Hildrum; Sujay S. Parekh; Deepak Rajan; Rohit Wagle; Kun-Lung Wu; Lisa Fleischer (Middleware, 2008)

Robust reductions from ranking to classification. - Maria-Florina Balcan; Nikhil Bansal 001; Alina Beygelzimer; Don Coppersmith; John Langford 001; Gregory B. Sorkin (Mach. Learn., 2008)

Improved Approximation Algorithms for Broadcast Scheduling. - Nikhil Bansal 001; Don Coppersmith; Maxim Sviridenko (SIAM J. Comput., 2008)

Approximation Schemes for Bin Packing. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2008)

Minimum Flow Time. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2008)

Multi-level Feedback Queues. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2008)

Oblivious Routing. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2008)

Shortest Elapsed Time First Scheduling. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2008)

Optimal Long Code Test with One Free Bit. - Nikhil Bansal 001; Subhash Khot (FOCS, 2009)

A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. - Nikhil Bansal 001; Alberto Caprara; Klaus Jansen; Lars Prädel; Maxim Sviridenko (ISAAC, 2009)

Job Admission and Resource Allocation in Distributed Streaming Systems. - Joel L. Wolf; Nikhil Bansal 001; Kirsten Hildrum; Sujay S. Parekh; Deepak Rajan; Rohit Wagle; Kun-Lung Wu (JSSPP, 2009)

Weighted flow time does not admit O(1)-competitive algorithms. - Nikhil Bansal 001; Ho-Leung Chan (SODA, 2009)

On k-Column Sparse Packing Programs - Nikhil Bansal 001; Nitish Korula; Viswanath Nagarajan (CoRR, 2009)

Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs. - Nikhil Bansal 001; Sergey Bravyi 001; Barbara M. Terhal (Quantum Inf. Comput., 2009)

A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. - Nikhil Bansal 001; Alberto Caprara; Maxim Sviridenko (SIAM J. Comput., 2009)

Additive Guarantees for Degree-Bounded Directed Network Design. - Nikhil Bansal 001; Rohit Khandekar; Viswanath Nagarajan (SIAM J. Comput., 2009)

Speed Scaling for Weighted Flow Time. - Nikhil Bansal 001; Kirk Pruhs; Clifford Stein 001 (SIAM J. Comput., 2009)

Speed scaling with a solar cell. - Nikhil Bansal 001; Ho-Leung Chan; Kirk Pruhs (Theor. Comput. Sci., 2009)

Bin-packing with fragile objects and frequency allocation in cellular networks. - Nikhil Bansal 001; Zhen Liu; Arvind Sankar (Wirel. Networks, 2009)

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). - Nikhil Bansal 001; Anupam Gupta 001; Jian Li 015; Julián Mestre; Viswanath Nagarajan; Atri Rudra (ESA (2), 2010)

Constructive Algorithms for Discrepancy Minimization. - Nikhil Bansal 001 (FOCS, 2010)

Metrical Task Systems and the k-Server Problem on HSTs. - Nikhil Bansal 001; Niv Buchbinder; Joseph Naor (ICALP (1), 2010)

Approximation Algorithms for Diversified Search Ranking. - Nikhil Bansal 001; Kamal Jain; Anna Kazeykina; Joseph Naor (ICALP (2), 2010)

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. - Nikhil Bansal 001; Subhash Khot (ICALP (1), 2010)

On k-Column Sparse Packing Programs. - Nikhil Bansal 001; Nitish Korula; Viswanath Nagarajan; Aravind Srinivasan (IPCO, 2010)

Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. - Nikhil Bansal 001; Niv Buchbinder; Joseph Naor (SODA, 2010)

A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. - Nikhil Bansal 001; Anupam Gupta 001; Ravishankar Krishnaswamy (SODA, 2010)

On the Longest Common Rigid Subsequence Problem. - Nikhil Bansal 001; Moshe Lewenstein; Bin Ma 002; Kaizhong Zhang (Algorithmica, 2010)

Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service. - Nikhil Bansal 001; Kirk Pruhs (SIAM J. Comput., 2010)

Dynamic pricing for impatient bidders. - Nikhil Bansal 001; Ning Chen 005; Neva Cherniavsky; Atri Rudra; Baruch Schieber; Maxim Sviridenko (ACM Trans. Algorithms, 2010)

On Capacitated Set Cover Problems. - Nikhil Bansal 001; Ravishankar Krishnaswamy; Barna Saha (APPROX-RANDOM, 2011)

A Polylogarithmic-Competitive Algorithm for the k-Server Problem. - Nikhil Bansal 001; Niv Buchbinder; Aleksander Madry; Joseph Naor (FOCS, 2011)

Average Rate Speed Scaling. - Nikhil Bansal 001; David P. Bunde; Ho-Leung Chan; Kirk Pruhs (Algorithmica, 2011)

Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. - Nikhil Bansal 001; Danny Z. Chen; Don Coppersmith; Xiaobo Sharon Hu; Shuang Luan; Ewa Misiolek; Baruch Schieber; Chao Wang 002 (Algorithmica, 2011)

Competitive Algorithms for Due Date Scheduling. - Nikhil Bansal 001; Ho-Leung Chan; Kirk Pruhs (Algorithmica, 2011)

Multicast Routing for Energy Minimization Using Speed Scaling. - Nikhil Bansal 001; Anupam Gupta 001; Ravishankar Krishnaswamy; Viswanath Nagarajan; Kirk Pruhs; Cliff Stein 001 (MedAlg, 2012)

Tight time-space tradeoff for mutual exclusion. - Nikhil Bansal 001; Vibhor Bhatt; Prasad Jayanti; Ranganath Kondapally (STOC, 2012)

The Primal-Dual Approach for Online Algorithms. - Nikhil Bansal 001 (WAOA, 2012)

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. - Nikhil Bansal 001; Anupam Gupta 001; Jian Li 015; Julián Mestre; Viswanath Nagarajan; Atri Rudra (Algorithmica, 2012)

A Primal-Dual Randomized Algorithm for Weighted Paging. - Nikhil Bansal 001; Niv Buchbinder; Joseph Naor (J. ACM, 2012)

Semidefinite optimization in discrepancy theory. - Nikhil Bansal 001 (Math. Program., 2012)

Randomized Competitive Algorithms for Generalized Caching. - Nikhil Bansal 001; Niv Buchbinder; Joseph Naor (SIAM J. Comput., 2012)

Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. - Nikhil Bansal 001; Ho-Leung Chan; Dmitriy Katz; Kirk Pruhs (Theory Comput., 2012)

Solving Packing Integer Programs via Randomized Rounding with Alterations. - Nikhil Bansal 001; Nitish Korula; Viswanath Nagarajan; Aravind Srinivasan (Theory Comput., 2012)

Regularity Lemmas and Combinatorial Algorithms. - Nikhil Bansal 001; Ryan Williams 001 (Theory Comput., 2012)

Deterministic Discrepancy Minimization. - Nikhil Bansal 001; Joel Spencer (Algorithmica, 2013)

On generalizations of network design problems with degree bounds. - Nikhil Bansal 001; Rohit Khandekar; Jochen Könemann; Viswanath Nagarajan; Britta Peis (Math. Program., 2013)

A Harmonic Algorithm for the 3D Strip Packing Problem. - Nikhil Bansal 001; Xin Han; Kazuo Iwama; Maxim Sviridenko; Guochuan Zhang (SIAM J. Comput., 2013)

Speed Scaling with an Arbitrary Power Function. - Nikhil Bansal 001; Ho-Leung Chan; Kirk Pruhs (ACM Trans. Algorithms, 2013)

New Developments in Iterated Rounding (Invited Talk). - Nikhil Bansal 001 (FSTTCS, 2014)

Approximating Real-Time Scheduling on Identical Machines. - Nikhil Bansal 001; Cyriel Rutten; Suzanne van der Ster; Tjark Vredeveld; Ruben van der Zwaan (LATIN, 2014)

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. - Nikhil Bansal 001; Tjark Vredeveld; Ruben van der Zwaan (LATIN, 2014)

Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. - Nikhil Bansal 001; Moses Charikar; Ravishankar Krishnaswamy; Shi Li 001 (SODA, 2014)

Improved Approximation Algorithm for Two-Dimensional Bin Packing. - Nikhil Bansal 001; Arindam Khan 001 (SODA, 2014)

A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. - Nikhil Bansal 001; Niv Buchbinder; Anupam Gupta 001; Joseph Naor (Algorithmica, 2014)

An entropy argument for counting matroids. - Nikhil Bansal 001; Rudi Pendavingh; Jorn G. van der Pol (J. Comb. Theory B, 2014)

Min-Max Graph Partitioning and Small Set Expansion. - Nikhil Bansal 001; Uriel Feige; Robert Krauthgamer; Konstantin Makarychev; Viswanath Nagarajan; Joseph Naor; Roy Schwartz 002 (SIAM J. Comput., 2014)

The Geometry of Scheduling. - Nikhil Bansal 001; Kirk Pruhs (SIAM J. Comput., 2014)

A logarithmic approximation for unsplittable flow on line graphs. - Nikhil Bansal 001; Zachary Friggstad; Rohit Khandekar; Mohammad R. Salavatipour (ACM Trans. Algorithms, 2014)

Better Scalable Algorithms for Broadcast Scheduling. - Nikhil Bansal 001; Ravishankar Krishnaswamy; Viswanath Nagarajan (ACM Trans. Algorithms, 2014)

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. - Nikhil Bansal 001; Anupam Gupta 001; Ravishankar Krishnaswamy; Kirk Pruhs; Kevin Schewior; Clifford Stein 001 (APPROX-RANDOM, 2015)

Approximating independent sets in sparse graphs. - Nikhil Bansal 001 (SODA, 2015)

Minimizing Flow-Time on Unrelated Machines. - Nikhil Bansal 001; Janardhan Kulkarni (STOC, 2015)

On the number of matroids. - Nikhil Bansal 001; Rudi Pendavingh; Jorn G. van der Pol (Comb., 2015)

A Polylogarithmic-Competitive Algorithm for the k-Server Problem. - Nikhil Bansal 001; Niv Buchbinder; Aleksander Madry; Joseph Naor (J. ACM, 2015)

On the adaptivity gap of stochastic orienteering. - Nikhil Bansal 001; Viswanath Nagarajan (Math. Program., 2015)

Minimum Congestion Mapping in a Cloud. - Nikhil Bansal 001; Kang-Won Lee; Viswanath Nagarajan; Murtaza Zafer (SIAM J. Comput., 2015)

Approximation-Friendly Discrepancy Rounding. - Nikhil Bansal 001; Viswanath Nagarajan (IPCO, 2016)

Improved Approximation for Vector Bin Packing. - Nikhil Bansal 001; Marek Eliás 001; Arindam Khan 001 (SODA, 2016)

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. - Nikhil Bansal 001; Tim Oosterwijk; Tjark Vredeveld; Ruben van der Zwaan (Algorithmica, 2016)

New Bounds for the $(h, k)$-Server Problem. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (CoRR, 2016)

Improved Algorithmic Bounds for Discrepancy of Sparse Set Systems. - Nikhil Bansal 001; Shashwat Garg (CoRR, 2016)

Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. - Nikhil Bansal 001; Daniel Reichman 001; Seeun William Umboh (CoRR, 2016)

Scheduling (Dagstuhl Seminar 16081). - Nikhil Bansal 001; Nicole Megow; Clifford Stein 001 (Dagstuhl Reports, 2016)

Weighted geometric set multi-cover via quasi-uniform sampling. - Nikhil Bansal 001; Kirk Pruhs (J. Comput. Geom., 2016)

Minimizing Maximum Flow-Time on Related Machines. - Nikhil Bansal 001; Bouke Cloostermans (Theory Comput., 2016)

Approximation Schemes for Bin Packing. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2016)

Minimum Flow Time. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2016)

Multilevel Feedback Queues. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2016)

Oblivious Routing. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2016)

Shortest Elapsed Time First Scheduling. - Nikhil Bansal 001 (Encyclopedia of Algorithms, 2016)

Weighted k-Server Bounds via Combinatorial Dichotomies. - Nikhil Bansal 001; Marek Eliás 001; Grigorios Koumoutsos (FOCS, 2017)

LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. - Nikhil Bansal 001; Daniel Reichman 001; Seeun William Umboh (SODA, 2017)

The (h, k)-Server Problem on Bounded Depth Trees. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (SODA, 2017)

Algorithmic discrepancy beyond partial coloring. - Nikhil Bansal 001; Shashwat Garg (STOC, 2017)

Faster space-efficient algorithms for subset sum and k-sum. - Nikhil Bansal 001; Shashwat Garg; Jesper Nederlof; Nikhil Vyas 001 (STOC, 2017)

Guest Editors' Foreword. - Nikhil Bansal 001; Irene Finocchi (Algorithmica, 2017)

Competitive Algorithms for Generalized k-Server in Uniform Metrics. - Nikhil Bansal 001; Marek Eliás 001; Grigorios Koumoutsos; Jesper Nederlof (CoRR, 2017)

Potential-Function Proofs for First-Order Methods. - Nikhil Bansal 001; Anupam Gupta 001 (CoRR, 2017)

Tight approximation bounds for dominating set on graphs of bounded arboricity. - Nikhil Bansal 001; Seeun William Umboh (Inf. Process. Lett., 2017)

The local-global conjecture for scheduling with non-linear cost. - Nikhil Bansal 001; Christoph Dürr; Kim Thang Nguyen; Óscar C. Vásquez 001 (J. Sched., 2017)

Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems. - Jian-Jia Chen; Nikhil Bansal 001; Samarjit Chakraborty; Georg von der Brüggen (ISAAC, 2018)

Achievable Performance of Blind Policies in Heavy Traffic. - Nikhil Bansal 001; Bart Kamphorst; Bert Zwart (Math. Oper. Res., 2018)

Tight Bounds for Double Coverage Against Weak Adversaries. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos; Kirk Pruhs (Theory Comput. Syst., 2018)

On the Lovász Theta Function for Independent Sets in Sparse Graphs. - Nikhil Bansal 001; Anupam Gupta 001; Guru Guruganesh (SIAM J. Comput., 2018)

Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems. - Nikhil Bansal 001; Shashwat Garg; Jesper Nederlof; Nikhil Vyas 001 (SIAM J. Comput., 2018)

New Notions and Constructions of Sparsification for Graphs and Hypergraphs. - Nikhil Bansal 001; Ola Svensson; Luca Trevisan 001 (FOCS, 2019)

New Tools and Connections for Exponential-Time Approximation. - Nikhil Bansal 001; Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai; Jesper Nederlof (Algorithmica, 2019)

Geometry of Scheduling on Multiple Machines. - Nikhil Bansal 001; Jatin Batra (CoRR, 2019)

An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. - Nikhil Bansal 001; Daniel Dadush; Shashwat Garg (SIAM J. Comput., 2019)

The (h, k)-Server Problem on Bounded Depth Trees. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (ACM Trans. Algorithms, 2019)

The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. - Nikhil Bansal 001; Daniel Dadush; Shashwat Garg; Shachar Lovett (Theory Comput., 2019)

Potential-Function Proofs for Gradient Methods. - Nikhil Bansal 001; Anupam Gupta 001 (Theory Comput., 2019)

Online vector balancing and geometric discrepancy. - Nikhil Bansal 001; Haotian Jiang; Sahil Singla 001; Makrand Sinha (STOC, 2020)

Nested Convex Bodies are Chaseable. - Nikhil Bansal 001; Martin Böhm 001; Marek Eliás 001; Grigorios Koumoutsos; Seeun William Umboh (Algorithmica, 2020)

An Asymptotic Lower Bound for Online Vector Bin Packing. - Nikhil Bansal 001; Ilan Reuven Cohen (CoRR, 2020)

Scale-Free Allocation, Amortized Convexity, and Myopic Weighted Paging. - Nikhil Bansal 001; Christian Coester; Ravi Kumar 001; Manish Purohit; Erik Vee (CoRR, 2020)

EATCS Distinguished Dissertation Award 2020 - Call for Nominations. - Susanne Albers; Nikhil Bansal 001; Elvira Mayordomo; Dale Miller 001; Jaroslav Nesetril; Damian Niwinski; David Peleg; Vladimiro Sassone; Alexandra Silva 001 (Bull. EATCS, 2020)

$k$-Forrelation Optimally Separates Quantum and Classical Query Complexity. - Nikhil Bansal 001; Makrand Sinha (Electron. Colloquium Comput. Complex., 2020)

On the discrepancy of random low degree set systems. - Nikhil Bansal 001; Raghu Meka (Random Struct. Algorithms, 2020)

On-line balancing of random inputs. - Nikhil Bansal 001; Joel H. Spencer (Random Struct. Algorithms, 2020)

Non-uniform Geometric Set Cover and Scheduling on Multiple Machines. - Nikhil Bansal 001; Jatin Batra (SODA, 2021)

Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. - Nikhil Bansal 001; Jatin Batra; Majid Farhadi; Prasad Tetali (SODA, 2021)

Online Discrepancy Minimization for Stochastic Arrivals. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka; Sahil Singla 001; Makrand Sinha (SODA, 2021)

Efficient Online Weighted Multi-Level Paging. - Nikhil Bansal 001; Joseph (Seffi) Naor; Ohad Talmon (SPAA, 2021)

Contention Resolution, Matrix Scaling and Fair Allocation. - Nikhil Bansal 001; Ilan Reuven Cohen (WAOA, 2021)

Well-Balanced Allocation on General Graphs. - Nikhil Bansal 001; Ohad N. Feldheim (CoRR, 2021)

Online metric allocation. - Nikhil Bansal 001; Christian Coester (CoRR, 2021)

Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. - Nikhil Bansal 001; Aravind Srinivasan; Ola Svensson (SIAM J. Comput., 2021)

A Unified Approach to Discrepancy Minimization. - Nikhil Bansal 001; Aditi Laddha; Santosh S. Vempala (APPROX/RANDOM, 2022)

Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. - Nikhil Bansal 001; Makrand Sinha; Ronald de Wolf (CCC, 2022)

Online Metric Allocation and Time-Varying Regularization. - Nikhil Bansal 001; Christian Coester (ESA, 2022)

Balanced Allocations: The Heavily Loaded Case with Deletions. - Nikhil Bansal 001; William Kuszmaul (FOCS, 2022)

Smoothed Analysis of the Komlós Conjecture. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka; Sahil Singla 001; Makrand Sinha (ICALP, 2022)

Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka; Sahil Singla 001; Makrand Sinha (ITCS, 2022)

Learning-Augmented Weighted Paging. - Nikhil Bansal 001; Christian Coester; Ravi Kumar 001; Manish Purohit; Erik Vee (SODA, 2022)

The power of two choices in graphical allocation. - Nikhil Bansal 001; Ohad N. Feldheim (STOC, 2022)

Flow time scheduling and prefix Beck-Fiala. - Nikhil Bansal 001; Lars Rohwedder; Ola Svensson (STOC, 2022)

A Nearly Tight Lower Bound for the d-Dimensional Cow-Path Problem. - Nikhil Bansal 001; John Kuszmaul; William Kuszmaul (CoRR, 2022)

Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. - Sepehr Abbasi Zadeh; Nikhil Bansal 001; Guru Guruganesh; Aleksandar Nikolov; Roy Schwartz 002; Mohit Singh (ACM Trans. Algorithms, 2022)

On Minimizing Generalized Makespan on Unrelated Machines. - Nikhil Ayyadevara; Nikhil Bansal 001; Milind Prabhu (APPROX/RANDOM, 2023)

Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka (STOC, 2023)

Almost Logarithmic Approximation for Cutwidth and Pathwidth. - Nikhil Bansal 001; Dor Katzelnick; Roy Schwartz 002 (CoRR, 2023)

Perseus: Removing Energy Bloat from Large Model Training. - Jae-Won Chung; Yile Gu; Insu Jang; Luoxi Meng; Nikhil Bansal 001; Mosharaf Chowdhury (CoRR, 2023)

EATCS Distinguished Dissertation Award for 2022. - Nikhil Bansal 001 (Bull. EATCS, 2023)

Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. - Nikhil Bansal 001; David G. Harris 001 (Random Struct. Algorithms, 2023)

Competitive Algorithms for Generalized k-Server in Uniform Metrics. - Nikhil Bansal 001; Marek Eliás 001; Grigorios Koumoutsos; Jesper Nederlof (ACM Trans. Algorithms, 2023)

On Min Sum Vertex Cover and Generalized Min Sum Set Cover. - Nikhil Bansal 001; Jatin Batra; Majid Farhadi; Prasad Tetali (SIAM J. Comput., 2023)

A nearly tight lower bound for the d-dimensional cow-path problem. - Nikhil Bansal 001; John Kuszmaul; William Kuszmaul (Inf. Process. Lett., 2023)

Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds. - Nikhil Bansal 001; Vincent Cohen-Addad; Milind Prabhu; David Saulpic; Chris Schwiegelshohn (FOCS, 2024)

On Approximating Cutwidth and Pathwidth. - Nikhil Bansal 001; Dor Katzelnick; Roy Schwartz 002 (FOCS, 2024)

Reducing Energy Bloat in Large Model Training. - Jae-Won Chung; Yile Gu; Insu Jang; Luoxi Meng; Nikhil Bansal 001; Mosharaf Chowdhury (SOSP, 2024)

On a Generalization of Iterated and Randomized Rounding. - Nikhil Bansal 001 (Theory Comput., 2024)

Quasi-Monte Carlo Beyond Hardy-Krause. - Nikhil Bansal 001; Haotian Jiang (SODA, 2025)

Cornstarch: Distributed Multimodal Training Must Be Multimodality-Aware. - Insu Jang; Runyu Lu; Nikhil Bansal 001; Ang Chen 001; Mosharaf Chowdhury (CoRR, 2025)