default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikhil Bansal 0001
Person information
- affiliation: University of Michigan, USA
- affiliation (former): Eindhoven University of Technology, The Netherlands
Other persons with the same name
- Nikhil Bansal 0002 — Indian Institute of Technology - Kanpur, India
- Nikhil Bansal 0003 — Microsoft, India (and 2 more)
- Nikhil Bansal 0004 — International Institute of Information Technology Hyderabad, Hyderabad, India
- Nikhil Bansal 0005 — A*STAR, Institute of High Performance Computing, Singapore (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i57]Nikhil Bansal, Vincent Cohen-Addad, Milind Prabhu, David Saulpic, Chris Schwiegelshohn:
Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds. CoRR abs/2405.01339 (2024)- [i56]Nikhil Bansal, Haotian Jiang:
Quasi-Monte Carlo Beyond Hardy-Krause. CoRR abs/2408.06475 (2024) - 2023
- [j78]Nikhil Bansal:
EATCS Distinguished Dissertation Award for 2022. Bull. EATCS 140 (2023) - [j77]Nikhil Bansal, John Kuszmaul, William Kuszmaul
:
A nearly tight lower bound for the d-dimensional cow-path problem. Inf. Process. Lett. 182: 106389 (2023) - [j76]Nikhil Bansal, David G. Harris:
Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. Random Struct. Algorithms 62(1): 52-67 (2023) - [j75]Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali:
On Min Sum Vertex Cover and Generalized Min Sum Set Cover. SIAM J. Comput. 52(2): 327-357 (2023) - [j74]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. ACM Trans. Algorithms 19(1): 8:1-8:15 (2023) - [c120]Nikhil Ayyadevara, Nikhil Bansal, Milind Prabhu:
On Minimizing Generalized Makespan on Unrelated Machines. APPROX/RANDOM 2023: 21:1-21:13 - [c119]Nikhil Bansal, Haotian Jiang, Raghu Meka:
Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank. STOC 2023: 1814-1819 - [e4]Nikhil Bansal, Viswanath Nagarajan:
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. SIAM 2023, ISBN 978-1-61197-755-4 [contents] - [i55]Nikhil Ayyadevara, Nikhil Bansal, Milind Prabhu:
On Minimizing Generalized Makespan on Unrelated Machines. CoRR abs/2307.13937 (2023) - [i54]Nikhil Bansal, Dor Katzelnick, Roy Schwartz:
Almost Logarithmic Approximation for Cutwidth and Pathwidth. CoRR abs/2311.15639 (2023) - [i53]Jae-Won Chung, Yile Gu, Insu Jang, Luoxi Meng, Nikhil Bansal, Mosharaf Chowdhury:
Perseus: Removing Energy Bloat from Large Model Training. CoRR abs/2312.06902 (2023) - 2022
- [j73]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. ACM Trans. Algorithms 18(4): 33:1-33:50 (2022) - [c118]Nikhil Bansal, Aditi Laddha, Santosh S. Vempala:
A Unified Approach to Discrepancy Minimization. APPROX/RANDOM 2022: 1:1-1:22 - [c117]Nikhil Bansal, Makrand Sinha, Ronald de Wolf:
Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. CCC 2022: 28:1-28:21 - [c116]Nikhil Bansal, Christian Coester:
Online Metric Allocation and Time-Varying Regularization. ESA 2022: 13:1-13:13 - [c115]Nikhil Bansal, William Kuszmaul:
Balanced Allocations: The Heavily Loaded Case with Deletions. FOCS 2022: 801-812 - [c114]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Smoothed Analysis of the Komlós Conjecture. ICALP 2022: 14:1-14:12 - [c113]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. ITCS 2022: 13:1-13:22 - [c112]Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee:
Learning-Augmented Weighted Paging. SODA 2022: 67-89 - [c111]Nikhil Bansal, Ohad N. Feldheim:
The power of two choices in graphical allocation. STOC 2022: 52-63 - [c110]Nikhil Bansal, Lars Rohwedder, Ola Svensson:
Flow time scheduling and prefix Beck-Fiala. STOC 2022: 331-342 - [i52]Nikhil Bansal, Lars Rohwedder, Ola Svensson:
Flow Time Scheduling and Prefix Beck-Fiala. CoRR abs/2202.02217 (2022) - [i51]Nikhil Bansal, Makrand Sinha, Ronald de Wolf:
Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms. CoRR abs/2203.00212 (2022) - [i50]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Smoothed Analysis of the Komlós Conjecture. CoRR abs/2204.11427 (2022) - [i49]Nikhil Bansal, Aditi Laddha, Santosh S. Vempala:
A Unified Approach to Discrepancy Minimization. CoRR abs/2205.01023 (2022) - [i48]Nikhil Bansal, William Kuszmaul:
Balanced Allocations: The Heavily Loaded Case with Deletions. CoRR abs/2205.06558 (2022) - [i47]Nikhil Bansal, Haotian Jiang, Raghu Meka:
Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank. CoRR abs/2208.11286 (2022) - [i46]Nikhil Bansal, John Kuszmaul, William Kuszmaul:
A Nearly Tight Lower Bound for the d-Dimensional Cow-Path Problem. CoRR abs/2209.08427 (2022) - 2021
- [j72]Nikhil Bansal, Aravind Srinivasan, Ola Svensson:
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. SIAM J. Comput. 50(3) (2021) - [c109]Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali:
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. SODA 2021: 998-1005 - [c108]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Online Discrepancy Minimization for Stochastic Arrivals. SODA 2021: 2842-2861 - [c107]Nikhil Bansal, Jatin Batra:
Non-uniform Geometric Set Cover and Scheduling on Multiple Machines. SODA 2021: 3011-3021 - [c106]Nikhil Bansal, Joseph (Seffi) Naor, Ohad Talmon:
Efficient Online Weighted Multi-Level Paging. SPAA 2021: 94-104 - [c105]Nikhil Bansal, Makrand Sinha:
k-forrelation optimally separates Quantum and classical query complexity. STOC 2021: 1303-1316 - [c104]Nikhil Bansal, Ilan Reuven Cohen:
Contention Resolution, Matrix Scaling and Fair Allocation. WAOA 2021: 252-274 - [e3]Nikhil Bansal, Emanuela Merelli, James Worrell:
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). LIPIcs 198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-195-5 [contents] - [i45]Nikhil Bansal, Ohad N. Feldheim:
Well-Balanced Allocation on General Graphs. CoRR abs/2106.06051 (2021) - [i44]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. CoRR abs/2111.07049 (2021) - [i43]Nikhil Bansal, Christian Coester:
Online metric allocation. CoRR abs/2111.15169 (2021) - 2020
- [j71]Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. Algorithmica 82(6): 1640-1653 (2020) - [j70]Susanne Albers, Nikhil Bansal, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, David Peleg, Vladimiro Sassone, Alexandra Silva:
EATCS Distinguished Dissertation Award 2020 - Call for Nominations. Bull. EATCS 132 (2020) - [j69]Nikhil Bansal, Raghu Meka:
On the discrepancy of random low degree set systems. Random Struct. Algorithms 57(3): 695-705 (2020) - [j68]Nikhil Bansal, Joel H. Spencer:
On-line balancing of random inputs. Random Struct. Algorithms 57(4): 879-891 (2020) - [c103]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. SODA 2020: 854-873 - [c102]Nikhil Bansal, Haotian Jiang, Sahil Singla, Makrand Sinha:
Online vector balancing and geometric discrepancy. STOC 2020: 1139-1152 - [i42]Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali:
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. CoRR abs/2007.09172 (2020) - [i41]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Online Discrepancy Minimization for Stochastic Arrivals. CoRR abs/2007.10622 (2020) - [i40]Nikhil Bansal, Ilan Reuven Cohen:
An Asymptotic Lower Bound for Online Vector Bin Packing. CoRR abs/2007.15709 (2020) - [i39]Nikhil Bansal, Makrand Sinha:
k-Forrelation Optimally Separates Quantum and Classical Query Complexity. CoRR abs/2008.07003 (2020) - [i38]Nikhil Bansal, David G. Harris:
Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. CoRR abs/2011.07097 (2020) - [i37]Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee:
Scale-Free Allocation, Amortized Convexity, and Myopic Weighted Paging. CoRR abs/2011.09076 (2020) - [i36]Nikhil Bansal, Makrand Sinha:
$k$-Forrelation Optimally Separates Quantum and Classical Query Complexity. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j67]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81(10): 3993-4009 (2019) - [j66]Nikhil Bansal, Daniel Dadush, Shashwat Garg:
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. SIAM J. Comput. 48(2): 534-553 (2019) - [j65]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
The (h, k)-Server Problem on Bounded Depth Trees. ACM Trans. Algorithms 15(2): 28:1-28:26 (2019) - [j64]Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett:
The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. Theory Comput. 15: 1-27 (2019) - [j63]Nikhil Bansal, Anupam Gupta:
Potential-Function Proofs for Gradient Methods. Theory Comput. 15: 1-32 (2019) - [c101]Nikhil Bansal, Ola Svensson, Luca Trevisan:
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. FOCS 2019: 910-928 - [c100]Nikhil Bansal, Raghu Meka:
On the discrepancy of random low degree set systems. SODA 2019: 2557-2564 - [c99]Nikhil Bansal:
On a generalization of iterated and randomized rounding. STOC 2019: 1125-1135 - [i35]Nikhil Bansal, Joel H. Spencer:
On-Line Balancing of Random Inputs. CoRR abs/1903.06898 (2019) - [i34]Nikhil Bansal, Ola Svensson, Luca Trevisan:
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. CoRR abs/1905.01495 (2019) - [i33]Nikhil Bansal, Jatin Batra:
Geometry of Scheduling on Multiple Machines. CoRR abs/1907.05473 (2019) - [i32]Nikhil Bansal, Haotian Jiang, Sahil Singla, Makrand Sinha:
Online Vector Balancing and Geometric Discrepancy. CoRR abs/1912.03350 (2019) - 2018
- [j62]Nikhil Bansal, Bart Kamphorst, Bert Zwart:
Achievable Performance of Blind Policies in Heavy Traffic. Math. Oper. Res. 43(3): 949-964 (2018) - [j61]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs:
Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62(2): 349-365 (2018) - [j60]Nikhil Bansal, Anupam Gupta, Guru Guruganesh:
On the Lovász Theta Function for Independent Sets in Sparse Graphs. SIAM J. Comput. 47(3): 1039-1055 (2018) - [j59]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems. SIAM J. Comput. 47(5): 1755-1777 (2018) - [c98]Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, Georg von der Brüggen:
Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems. ISAAC 2018: 71:1-71:14 - [c97]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. SODA 2018: 992-1001 - [c96]Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. SODA 2018: 1253-1260 - [c95]Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett:
The gram-schmidt walk: a cure for the Banaszczyk blues. STOC 2018: 587-597 - [i31]Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, Georg von der Brüggen:
Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems. CoRR abs/1809.04355 (2018) - [i30]Nikhil Bansal, Raghu Meka:
On the discrepancy of random low degree set systems. CoRR abs/1810.03374 (2018) - [i29]Nikhil Bansal:
On a generalization of iterated and randomized rounding. CoRR abs/1811.01597 (2018) - [i28]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. CoRR abs/1812.07769 (2018) - 2017
- [j58]Nikhil Bansal, Irene Finocchi:
Guest Editors' Foreword. Algorithmica 78(4): 1107-1108 (2017) - [j57]Nikhil Bansal, Seeun William Umboh:
Tight approximation bounds for dominating set on graphs of bounded arboricity. Inf. Process. Lett. 122: 21-24 (2017) - [j56]Nikhil Bansal, Christoph Dürr, Kim Thang Nguyen, Óscar C. Vásquez:
The local-global conjecture for scheduling with non-linear cost. J. Sched. 20(3): 239-254 (2017) - [c94]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos:
Weighted k-Server Bounds via Combinatorial Dichotomies. FOCS 2017: 493-504 - [c93]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
The (h, k)-Server Problem on Bounded Depth Trees. SODA 2017: 1022-1037 - [c92]Nikhil Bansal, Daniel Reichman, Seeun William Umboh:
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. SODA 2017: 1964-1979 - [c91]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster space-efficient algorithms for subset sum and k-sum. STOC 2017: 198-209 - [c90]Nikhil Bansal, Shashwat Garg:
Algorithmic discrepancy beyond partial coloring. STOC 2017: 914-926 - [i27]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos:
Weighted k-Server Bounds via Combinatorial Dichotomies. CoRR abs/1704.03318 (2017) - [i26]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. CoRR abs/1707.04519 (2017) - [i25]Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. CoRR abs/1707.05527 (2017) - [i24]Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett:
The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. CoRR abs/1708.01079 (2017) - [i23]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-time Approximation. CoRR abs/1708.03515 (2017) - [i22]Nikhil Bansal, Anupam Gupta:
Potential-Function Proofs for First-Order Methods. CoRR abs/1712.04581 (2017) - 2016
- [j55]Nikhil Bansal, Tim Oosterwijk, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Algorithmica 76(4): 1077-1096 (2016) - [j54]Nikhil Bansal, Kirk Pruhs:
Weighted geometric set multi-cover via quasi-uniform sampling. J. Comput. Geom. 7(1): 221-236 (2016) - [j53]Nikhil Bansal, Bouke Cloostermans:
Minimizing Maximum Flow-Time on Related Machines. Theory Comput. 12(1): 1-14 (2016) - [c89]Nikhil Bansal, Daniel Dadush, Shashwat Garg:
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. FOCS 2016: 788-799 - [c88]Nikhil Bansal, Viswanath Nagarajan:
Approximation-Friendly Discrepancy Rounding. IPCO 2016: 375-386 - [c87]Nikhil Bansal, Marek Eliás, Arindam Khan:
Improved Approximation for Vector Bin Packing. SODA 2016: 1561-1579 - [c86]Nikhil Bansal, Aravind Srinivasan, Ola Svensson:
Lift-and-round to improve weighted completion time on unrelated machines. STOC 2016: 156-167 - [r10]Nikhil Bansal:
Approximation Schemes for Bin Packing. Encyclopedia of Algorithms 2016: 123-126 - [r9]Nikhil Bansal:
Minimum Flow Time. Encyclopedia of Algorithms 2016: 1312-1315 - [r8]Nikhil Bansal:
Multilevel Feedback Queues. Encyclopedia of Algorithms 2016: 1373-1375 - [r7]Nikhil Bansal:
Oblivious Routing. Encyclopedia of Algorithms 2016: 1426-1430 - [r6]Nikhil Bansal:
Shortest Elapsed Time First Scheduling. Encyclopedia of Algorithms 2016: 1966-1969 - [i21]Nikhil Bansal, Shashwat Garg:
Improved Algorithmic Bounds for Discrepancy of Sparse Set Systems. CoRR abs/1601.03311 (2016) - [i20]Nikhil Bansal, Daniel Dadush, Shashwat Garg:
An Algorithm for Komlós Conjecture Matching Banaszczyk's bound. CoRR abs/1605.02882 (2016) - [i19]Nikhil Bansal, Daniel Reichman, Seeun William Umboh:
Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. CoRR abs/1606.05198 (2016) - [i18]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
New Bounds for the $(h, k)$-Server Problem. CoRR abs/1608.08527 (2016) - [i17]Nikhil Bansal, Shashwat Garg:
Algorithmic Discrepancy Beyond Partial Coloring. CoRR abs/1611.01805 (2016) - [i16]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems. CoRR abs/1612.02788 (2016) - [i15]Nikhil Bansal, Nicole Megow, Clifford Stein:
Scheduling (Dagstuhl Seminar 16081). Dagstuhl Reports 6(2): 97-118 (2016) - 2015
- [j52]Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
On the number of matroids. Comb. 35(3): 253-277 (2015) - [j51]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. J. ACM 62(5): 40:1-40:49 (2015) - [j50]Nikhil Bansal, Viswanath Nagarajan:
On the adaptivity gap of stochastic orienteering. Math. Program. 154(1-2): 145-172 (2015) - [j49]Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer:
Minimum Congestion Mapping in a Cloud. SIAM J. Comput. 44(3): 819-843 (2015) - [c85]Nikhil Bansal, Bouke Cloostermans:
Minimizing Maximum Flow-time on Related Machines. APPROX-RANDOM 2015: 85-95 - [c84]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein:
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. APPROX-RANDOM 2015: 96-109 - [c83]Nikhil Bansal:
Approximating independent sets in sparse graphs. SODA 2015: 1-8 - [c82]Nikhil Bansal, Anupam Gupta, Guru Guruganesh:
On the Lovász Theta function for Independent Sets in Sparse Graphs. STOC 2015: 193-200 - [c81]Nikhil Bansal, Janardhan Kulkarni:
Minimizing Flow-Time on Unrelated Machines. STOC 2015: 851-860 - [c80]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs:
Tight Bounds for Double Coverage Against Weak Adversaries. WAOA 2015: 47-58 - [e2]Nikhil Bansal, Irene Finocchi:
Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Lecture Notes in Computer Science 9294, Springer 2015, ISBN 978-3-662-48349-7 [contents] - [i14]Nikhil Bansal, Anupam Gupta, Guru Guruganesh:
On the Lovász Theta function for Independent Sets in Sparse Graphs. CoRR abs/1504.04767 (2015) - [i13]Nikhil Bansal, Ola Svensson, Aravind Srinivasan:
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. CoRR abs/1511.07826 (2015) - [i12]Nikhil Bansal, Viswanath Nagarajan:
Approximation-Friendly Discrepancy Rounding. CoRR abs/1512.02254 (2015) - [i11]Nikhil Bansal, Bart Kamphorst, Bert Zwart:
Achievable Performance of Blind Policies in Heavy Traffic. CoRR abs/1512.07771 (2015) - 2014
- [j48]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica 68(2): 390-403 (2014) - [j47]Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
An entropy argument for counting matroids. J. Comb. Theory B 109: 258-262 (2014) - [j46]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43(2): 872-904 (2014) - [j45]Nikhil Bansal, Kirk Pruhs:
The Geometry of Scheduling. SIAM J. Comput. 43(5): 1684-1698 (2014) - [j44]Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs. ACM Trans. Algorithms 10(1): 1:1-1:15 (2014) - [j43]Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan:
Better Scalable Algorithms for Broadcast Scheduling. ACM Trans. Algorithms 11(1): 3:1-3:24 (2014) - [c79]Nikhil Bansal:
New Developments in Iterated Rounding (Invited Talk). FSTTCS 2014: 1-10 - [c78]Nikhil Bansal, Viswanath Nagarajan:
On the Adaptivity Gap of Stochastic Orienteering. IPCO 2014: 114-125 - [c77]Nikhil Bansal, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. LATIN 2014: 47-59 - [c76]Nikhil Bansal, Cyriel Rutten, Suzanne van der Ster, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Real-Time Scheduling on Identical Machines. LATIN 2014: 550-561 - [c75]Nikhil Bansal, Arindam Khan:
Improved Approximation Algorithm for Two-Dimensional Bin Packing. SODA 2014: 13-25 - [c74]Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li:
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. SODA 2014: 55-71 - [i10]Nikhil Bansal, Janardhan Kulkarni:
Minimizing Flow-Time on Unrelated Machines. CoRR abs/1401.7284 (2014) - 2013
- [j42]Nikhil Bansal, Joel Spencer:
Deterministic Discrepancy Minimization. Algorithmica 67(4): 451-471 (2013) - [j41]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On generalizations of network design problems with degree bounds. Math. Program. 141(1-2): 479-506 (2013) - [j40]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
A Harmonic Algorithm for the 3D Strip Packing Problem. SIAM J. Comput. 42(2): 579-592 (2013) - [j39]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed Scaling with an Arbitrary Power Function. ACM Trans. Algorithms 9(2): 18:1-18:14 (2013) - [c73]Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
On the number of matroids. SODA 2013: 675-694 - [i9]Nikhil Bansal, Viswanath Nagarajan:
On the Adaptivity Gap of Stochastic Orienteering. CoRR abs/1311.3623 (2013) - 2012
- [j38]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica 63(4): 733-762 (2012) - [j37]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM 59(4): 19:1-19:24 (2012) - [j36]Nikhil Bansal:
Semidefinite optimization in discrepancy theory. Math. Program. 134(1): 5-22 (2012) - [j35]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41(2): 391-414 (2012) - [j34]Nikhil Bansal, Ryan Williams:
Regularity Lemmas and Combinatorial Algorithms. Theory Comput. 8(1): 69-94 (2012) - [j33]Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, Kirk Pruhs:
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. Theory Comput. 8(1): 209-229 (2012) - [j32]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan:
Solving Packing Integer Programs via Randomized Rounding with Alterations. Theory Comput. 8(1): 533-565 (2012) - [c72]Nikhil Bansal, Kirk Pruhs:
Weighted Geometric Set Multi-cover via Quasi-uniform Sampling. ESA 2012: 145-156 - [c71]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg 2012: 37-51 - [c70]Nikhil Bansal, Vibhor Bhatt, Prasad Jayanti, Ranganath Kondapally:
Tight time-space tradeoff for mutual exclusion. STOC 2012: 971-982 - [c69]Nikhil Bansal:
The Primal-Dual Approach for Online Algorithms. WAOA 2012: 1 - [i8]Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
An entropy argument for counting matroids. CoRR abs/1210.6581 (2012) - 2011
- [j31]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling. Algorithmica 59(4): 569-582 (2011) - [j30]Nikhil Bansal, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Baruch Schieber, Chao Wang:
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Algorithmica 60(2): 421-450 (2011) - [j29]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs:
Average Rate Speed Scaling. Algorithmica 60(4): 877-889 (2011) - [c68]Nikhil Bansal, Ravishankar Krishnaswamy, Barna Saha:
On Capacitated Set Cover Problems. APPROX-RANDOM 2011: 38-49 - [c67]Nikhil Bansal, Joel Spencer:
Deterministic Discrepancy Minimization. ESA 2011: 408-420 - [c66]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26 - [c65]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276 - [c64]Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer:
Minimum congestion mapping in a cloud. PODC 2011: 267-276 - [i7]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. CoRR abs/1110.1580 (2011) - [i6]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. CoRR abs/1110.4319 (2011) - 2010
- [j28]Nikhil Bansal, Moshe Lewenstein, Bin Ma, Kaizhong Zhang:
On the Longest Common Rigid Subsequence Problem. Algorithmica 56(2): 270-280 (2010) - [j27]Nikhil Bansal, Kirk Pruhs:
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service. SIAM J. Comput. 39(7): 3311-3335 (2010) - [j26]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
Dynamic pricing for impatient bidders. ACM Trans. Algorithms 6(2): 35:1-35:21 (2010) - [c63]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). ESA (2) 2010: 218-229 - [c62]Nikhil Bansal:
Constructive Algorithms for Discrepancy Minimization. FOCS 2010: 3-10 - [c61]Nikhil Bansal, Kirk Pruhs:
The Geometry of Scheduling. FOCS 2010: 407-414 - [c60]Nikhil Bansal, Subhash Khot:
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. ICALP (1) 2010: 250-261 - [c59]Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor:
Approximation Algorithms for Diversified Search Ranking. ICALP (2) 2010: 273-284 - [c58]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Metrical Task Systems and the k-Server Problem on HSTs. ICALP (1) 2010: 287-298 - [c57]Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan:
Better Scalable Algorithms for Broadcast Scheduling. ICALP (1) 2010: 324-335 - [c56]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123 - [c55]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan:
On k-Column Sparse Packing Programs. IPCO 2010: 369-382 - [c54]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA 2010: 40-55 - [c53]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy:
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. SODA 2010: 1539-1545 - [i5]Nikhil Bansal:
Constructive Algorithms for Discrepancy Minimization. CoRR abs/1002.2259 (2010) - [i4]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. CoRR abs/1003.2977 (2010) - [i3]Nikhil Bansal, Kirk Pruhs:
The Geometry of Scheduling. CoRR abs/1008.4889 (2010) - [i2]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. CoRR abs/1008.5356 (2010)
2000 – 2009
- 2009
- [j25]Nikhil Bansal, Sergey Bravyi, Barbara M. Terhal:
Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs. Quantum Inf. Comput. 9(7&8): 701-720 (2009) - [j24]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko:
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. SIAM J. Comput. 39(4): 1256-1278 (2009) - [j23]Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Speed Scaling for Weighted Flow Time. SIAM J. Comput. 39(4): 1294-1308 (2009) - [j22]Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan:
Additive Guarantees for Degree-Bounded Directed Network Design. SIAM J. Comput. 39(4): 1413-1431 (2009) - [j21]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed scaling with a solar cell. Theor. Comput. Sci. 410(45): 4580-4587 (2009) - [j20]Nikhil Bansal, Zhen Liu, Arvind Sankar:
Bin-packing with fragile objects and frequency allocation in cellular networks. Wirel. Networks 15(6): 821-830 (2009) - [c52]Nikhil Bansal, Subhash Khot:
Optimal Long Code Test with One Free Bit. FOCS 2009: 453-462 - [c51]Nikhil Bansal, Ryan Williams:
Regularity Lemmas and Combinatorial Algorithms. FOCS 2009: 745-754 - [c50]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy Katz:
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. ICALP (1) 2009: 144-155 - [c49]Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko:
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ISAAC 2009: 77-86 - [c48]Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Sujay S. Parekh, Deepak Rajan, Rohit Wagle, Kun-Lung Wu:
Job Admission and Resource Allocation in Distributed Streaming Systems. JSSPP 2009: 169-189 - [c47]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed scaling with an arbitrary power function. SODA 2009: 693-701 - [c46]Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs. SODA 2009: 702-709 - [c45]Nikhil Bansal, Ho-Leung Chan:
Weighted flow time does not admit O(1)-competitive algorithms. SODA 2009: 1238-1244 - [i1]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan:
On k-Column Sparse Packing Programs. CoRR abs/0908.2256 (2009) - 2008
- [j19]Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin:
Robust reductions from ranking to classification. Mach. Learn. 72(1-2): 139-153 (2008) - [j18]Nikhil Bansal, Don Coppersmith, Maxim Sviridenko:
Improved Approximation Algorithms for Broadcast Scheduling. SIAM J. Comput. 38(3): 1157-1174 (2008) - [c44]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed Scaling with a Solar Cell. AAIM 2008: 15-26 - [c43]Nikhil Bansal, Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee:
Scheduling for Speed Bounded Processors. ICALP (1) 2008: 409-420 - [c42]Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoonho Park, Deepak S. Turaga, Chitra Venkatramani:
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications. INFOCOM 2008: 1319-1327 - [c41]P. Panjiyar, P. Mourya, Nikhil Bansal, P. Srivastava, A. Mukherjee:
Transport security using mobile technology. ISI 2008: 275-276 - [c40]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs:
Average Rate Speed Scaling. LATIN 2008: 240-251 - [c39]Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Sujay S. Parekh, Deepak Rajan, Rohit Wagle, Kun-Lung Wu, Lisa Fleischer:
SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems. Middleware 2008: 306-325 - [c38]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Randomized competitive algorithms for generalized caching. STOC 2008: 235-244 - [c37]Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan:
Additive guarantees for degree bounded directed network design. STOC 2008: 769-778 - [r5]Nikhil Bansal:
Approximation Schemes for Bin Packing. Encyclopedia of Algorithms 2008 - [r4]Nikhil Bansal:
Minimum Flow Time. Encyclopedia of Algorithms 2008 - [r3]Nikhil Bansal:
Multi-level Feedback Queues. Encyclopedia of Algorithms 2008 - [r2]Nikhil Bansal:
Oblivious Routing. Encyclopedia of Algorithms 2008 - [r1]Nikhil Bansal:
Shortest Elapsed Time First Scheduling. Encyclopedia of Algorithms 2008 - 2007
- [j17]Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták:
Finding submasses in weighted strings with Fast Fourier Transform. Discret. Appl. Math. 155(6-7): 707-718 (2007) - [j16]Nikhil Bansal, Maxim Sviridenko:
Two-dimensional bin packing with one-dimensional resource augmentation. Discret. Optim. 4(2): 143-153 (2007) - [j15]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs:
Speed scaling to manage energy and temperature. J. ACM 54(1): 3:1-3:39 (2007) - [j14]Nikhil Bansal, Kedar Dhamdhere:
Minimizing weighted flow time. ACM Trans. Algorithms 3(4): 39 (2007) - [c36]Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin:
Robust Reductions from Ranking to Classification. COLT 2007: 604-619 - [c35]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. ESA 2007: 522-533 - [c34]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS 2007: 507-517 - [c33]Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber:
Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS 2007: 614-624 - [c32]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling. ICALP 2007: 28-39 - [c31]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
Dynamic pricing for impatient bidders. SODA 2007: 726-735 - [c30]Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Speed scaling for weighted flow time. SODA 2007: 805-813 - [c29]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
Harmonic algorithm for 3-dimensional strip packing problem. SODA 2007: 1197-1206 - [e1]Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. SIAM 2007, ISBN 978-0-898716-24-5 [contents] - 2006
- [j13]Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko:
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. Math. Oper. Res. 31(1): 31-49 (2006) - [j12]Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko:
Job Shop Scheduling with Unit Processing Times. Math. Oper. Res. 31(2): 381-389 (2006) - [j11]Nikhil Bansal, David Gamarnik:
Handling load with less stress. Queueing Syst. Theory Appl. 54(1): 45-54 (2006) - [c28]Nikhil Bansal, Don Coppersmith, Baruch Schieber:
Minimizing Setup and Beam-On Times in Radiation Therapy. APPROX-RANDOM 2006: 27-38 - [c27]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko:
Improved approximation algorithms for multidimensional bin packing problems. FOCS 2006: 697-708 - [c26]Nikhil Bansal, Don Coppersmith, Maxim Sviridenko:
Improved approximation algorithms for broadcast scheduling. SODA 2006: 344-353 - [c25]Nikhil Bansal, Maxim Sviridenko:
The Santa Claus problem. STOC 2006: 31-40 - [c24]Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber:
A quasi-PTAS for unsplittable flow on line graphs. STOC 2006: 721-729 - 2005
- [j10]Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko:
Minimizing Makespan in No-Wait Job Shops. Math. Oper. Res. 30(4): 817-831 (2005) - [j9]Nikhil Bansal:
On the average sojourn time under M/M/1/SRPT. Oper. Res. Lett. 33(2): 195-200 (2005) - [j8]Nikhil Bansal:
Minimizing flow time on a constant number of machines with preemption. Oper. Res. Lett. 33(3): 267-273 (2005) - [c23]Nikhil Bansal, Andrea Lodi, Maxim Sviridenko:
A Tale of Two Dimensional Bin Packing. FOCS 2005: 657-666 - [c22]Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko:
Job shop scheduling with unit processing times. SODA 2005: 207-214 - [c21]Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor:
Approximating the average response time in broadcast scheduling. SODA 2005: 215-221 - [c20]Nikhil Bansal, Kirk Pruhs:
Speed Scaling to Manage Temperature. STACS 2005: 460-471 - 2004
- [j7]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha:
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4): 305-318 (2004) - [j6]Nikhil Bansal, Avrim Blum, Shuchi Chawla:
Correlation Clustering. Mach. Learn. 56(1-3): 89-113 (2004) - [j5]Adam Wierman, Nikhil Bansal, Mor Harchol-Balter:
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues. Oper. Res. Lett. 32(1): 73-76 (2004) - [c19]Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták:
Efficient Algorithms for Finding Submasses in Weighted Strings. CPM 2004: 194-204 - [c18]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs:
Dynamic Speed Scaling to Manage Energy and Temperature. FOCS 2004: 520-529 - [c17]Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207 - [c16]Nikhil Bansal, Kirk Pruhs:
Server Scheduling in the Weighted lp Norm. LATIN 2004: 434-443 - [c15]Nikhil Bansal, Maxim Sviridenko:
New approximability and inapproximability results for 2-dimensional Bin Packing. SODA 2004: 196-203 - [c14]Nikhil Bansal:
On minimizing the total flow time on multiple machines. SODA 2004: 572-574 - [c13]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson:
Approximation algorithms for deadline-TSP and vehicle routing with time-windows. STOC 2004: 166-174 - 2003
- [j4]Nikhil Bansal:
Analysis of the M/G/1 processor-sharing queue with bulk arrivals. Oper. Res. Lett. 31(3): 401-405 (2003) - [j3]Nikhil Bansal:
On the average sojourn time under M/M/1/SRPT. SIGMETRICS Perform. Evaluation Rev. 31(2): 34-35 (2003) - [j2]Mor Harchol-Balter, Bianca Schroeder, Nikhil Bansal, Mukesh Agrawal:
Size-based scheduling to improve web performance. ACM Trans. Comput. Syst. 21(2): 207-233 (2003) - [c12]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere:
Scheduling for Flow-Time with Admission Control. ESA 2003: 43-54 - [c11]Mukesh Agrawal, Amit Manjhi, Nikhil Bansal, Srinivasan Seshan:
Improving Web Performance in Broadcast-Unicast Networks. INFOCOM 2003: 229-239 - [c10]Nikhil Bansal, Zhen Liu:
Capacity, Delay and Mobility in Wireless Ad-Hoc Networks. INFOCOM 2003: 1553-1563 - [c9]Nikhil Bansal, Kedar Dhamdhere:
Minimizing weighted flow time. SODA 2003: 508-516 - [c8]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson:
Online oblivious routing. SPAA 2003: 44-49 - [c7]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha:
Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003: 260-270 - [c6]Nikhil Bansal, Kirk Pruhs:
Server scheduling in the Lp norm: a rising tide lifts all boat. STOC 2003: 242-250 - 2002
- [c5]Nikhil Bansal, Avrim Blum, Shuchi Chawla:
Correlation Clustering. FOCS 2002: 238- - [c4]Nikhil Bansal, Zhen Liu, Arvind Sankar:
Bin-Packing with Fragile Objects. IFIP TCS 2002: 38-46 - 2001
- [j1]Nikhil Bansal, Mor Harchol-Balter:
Analysis of M/G/1/SRPT under transient overload. SIGMETRICS Perform. Evaluation Rev. 29(3): 12-14 (2001) - [c3]Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, Mukesh Agrawal:
SRPT Scheduling for Web Servers. JSSPP 2001: 11-20 - [c2]Nikhil Bansal, Mor Harchol-Balter:
Analysis of SRPT scheduling: investigating unfairness. SIGMETRICS/Performance 2001: 279-290
1990 – 1999
- 1999
- [c1]Nikhil Bansal, Venkatesh Raman:
Upper Bounds for MaxSat: Further Improved. ISAAC 1999: 247-258
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 00:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
