Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA 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)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c111]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. ITCS 2022: 13:1-13:22- [c110]Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee:
Learning-Augmented Weighted Paging. SODA 2022: 67-89 - [i50]Nikhil Bansal, Lars Rohwedder, Ola Svensson:
Flow Time Scheduling and Prefix Beck-Fiala. CoRR abs/2202.02217 (2022) - [i49]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) - [i48]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Smoothed Analysis of the Komlós Conjecture. CoRR abs/2204.11427 (2022) - [i47]Nikhil Bansal, Aditi Laddha, Santosh S. Vempala:
A Unified Approach to Discrepancy Minimization. CoRR abs/2205.01023 (2022) - [i46]Nikhil Bansal, William Kuszmaul:
Balanced Allocations: The Heavily Loaded Case with Deletions. CoRR abs/2205.06558 (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. 27: 127 (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, Ser. 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]