| No. |
Title |
Author |
Year |
| 1 |
On Minimizing Generalized Makespan on Unrelated Machines |
Ayyadevara, Nikhil et al. |
2023 |
| 2 |
A Unified Approach to Discrepancy Minimization |
Bansal, Nikhil et al. |
2022 |
| 3 |
Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms |
Bansal, Nikhil et al. |
2022 |
| 4 |
Online Metric Allocation and Time-Varying Regularization |
Bansal, Nikhil et al. |
2022 |
| 5 |
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing |
Bansal, Nikhil et al. |
2022 |
| 6 |
Smoothed Analysis of the Komlós Conjecture |
Bansal, Nikhil et al. |
2022 |
| 7 |
Front Matter, Table of Contents, Preface, Conference Organization |
Bansal, Nikhil et al. |
2021 |
| 8 |
LIPIcs, Volume 198, ICALP 2021, Complete Volume |
Bansal, Nikhil et al. |
2021 |
| 9 |
Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems |
Chen, Jian-Jia et al. |
2018 |
| 10 |
Scheduling (Dagstuhl Seminar 16081) |
Bansal, Nikhil et al. |
2016 |
| 11 |
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs |
Bansal, Nikhil et al. |
2015 |
| 12 |
Minimizing Maximum Flow-time on Related Machines |
Bansal, Nikhil et al. |
2015 |
| 13 |
New Developments in Iterated Rounding (Invited Talk) |
Bansal, Nikhil |
2014 |
