Nikhil Bansal
Cited by
Cited by
Correlation clustering
N Bansal, A Blum, S Chawla
Machine learning 56, 89-113, 2004
Analysis of SRPT scheduling: Investigating unfairness
N Bansal, M Harchol-Balter
Proceedings of the 2001 ACM SIGMETRICS International conference on …, 2001
Capacity, delay and mobility in wireless ad-hoc networks
N Bansal, Z Liu
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE …, 2003
Speed scaling to manage energy and temperature
N Bansal, T Kimbrel, K Pruhs
Journal of the ACM (JACM) 54 (1), 1-39, 2007
Size-based scheduling to improve web performance
M Harchol-Balter, B Schroeder, N Bansal, M Agrawal
ACM Transactions on Computer Systems (TOCS) 21 (2), 207-233, 2003
The santa claus problem
N Bansal, M Sviridenko
Symposium on Theory of Computing, 31-40, 2006
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
N Bansal, A Blum, S Chawla, A Meyerson
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
Dynamic speed scaling to manage energy and temperature
N Bansal, T Kimbrel, K Pruhs
45th annual IEEE symposium on foundations of computer science, 520-529, 2004
SODA: An optimizing scheduler for large-scale stream-based distributed computer systems
J Wolf, N Bansal, K Hildrum, S Parekh, D Rajan, R Wagle, KL Wu, ...
Middleware 2008: ACM/IFIP/USENIX 9th International Middleware Conference …, 2008
Speed scaling for weighted flow time
N Bansal, K Pruhs, C Stein
SIAM Journal on Computing 39 (4), 1294-1308, 2010
Speed scaling with an arbitrary power function
N Bansal, HL Chan, K Pruhs
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
Constructive algorithms for discrepancy minimization
N Bansal
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 3-10, 2010
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
N Bansal, N Buchbinder, A Madry, J Naor
Journal of the ACM (JACM) 62 (5), 1-49, 2015
A primal-dual randomized algorithm for weighted paging
N Bansal, N Buchbinder, J Naor
Journal of the ACM (JACM) 59 (4), 1-24, 2012
Bin packing in multiple dimensions: inapproximability results and approximation schemes
N Bansal, JR Correa, C Kenyon, M Sviridenko
Mathematics of operations research 31 (1), 31-49, 2006
When LP is the cure for your matching woes: Improved bounds for stochastic matchings
N Bansal, A Gupta, J Li, J Mestre, V Nagarajan, A Rudra
Algorithmica 63, 733-762, 2012
The geometry of scheduling
N Bansal, K Pruhs
SIAM Journal on Computing 43 (5), 1684-1698, 2014
Upper bounds for MaxSat: Further improved
A Aggarwal, CP Rangan, N Bansal, V Raman
Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai …, 1999
Optimal long code test with one free bit
N Bansal, S Khot
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 453-462, 2009
Scheduling for speed bounded processors
N Bansal, HL Chan, TW Lam, LK Lee
Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008
The system can't perform the operation now. Try again later.
Articles 1–20