Nikhil Bansal
Title
Cited by
Cited by
Year
Correlation clustering
N Bansal, A Blum, S Chawla
Machine Learning 56 (1), 89-113, 2004
13772004
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
4842003
Analysis of SRPT scheduling: Investigating unfairness
N Bansal, M Harchol-Balter
Proceedings of the 2001 ACM SIGMETRICS International conference on …, 2001
4422001
Speed scaling to manage energy and temperature
N Bansal, T Kimbrel, K Pruhs
Journal of the ACM (JACM) 54 (1), 3, 2007
3892007
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
3792003
The santa claus problem
N Bansal, M Sviridenko
Symposium on Theory of Computing, 31-40, 2006
2582006
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
2222004
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
2142004
Speed scaling with an arbitrary power function
N Bansal, HL Chan, K Pruhs
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
1962009
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, ...
ACM/IFIP/USENIX International Conference on Distributed Systems Platforms …, 2008
1942008
Speed scaling for weighted flow time
N Bansal, K Pruhs, C Stein
SIAM Journal on Computing 39 (4), 1294-1308, 2010
1922010
A primal-dual randomized algorithm for weighted paging
N Bansal, N Buchbinder, J Naor
Journal of the ACM (JACM) 59 (4), 1-24, 2012
1382012
A primal-dual randomized algorithm for weighted paging
N Bansal, N Buchbinder, J Naor
Foundations of Computer Science, 2007. FOCS'07. 48th Annual IEEE Symposium …, 2007
138*2007
Constructive algorithms for discrepancy minimization
N Bansal
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 3-10, 2010
1262010
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 (4), 733-762, 2012
1242012
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
1232006
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
1162015
A polylogarithmic-competitive algorithm for the k-server problem
N Bansal, N Buchbinder, A Madry, J Naor
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 267-276, 2011
116*2011
The geometry of scheduling
N Bansal, K Pruhs
SIAM Journal on Computing 43 (5), 1684-1698, 2014
1112014
Scheduling for speed bounded processors
N Bansal, HL Chan, TW Lam, LK Lee
International Colloquium on Automata, Languages, and Programming, 409-420, 2008
1082008
The system can't perform the operation now. Try again later.
Articles 1–20