Obserwuj
Nikhil Bansal
Tytuł
Cytowane przez
Cytowane przez
Rok
Correlation clustering
N Bansal, A Blum, S Chawla
Machine Learning 56 (1), 89-113, 2004
15622004
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
4902003
Analysis of SRPT scheduling: Investigating unfairness
N Bansal, M Harchol-Balter
Proceedings of the 2001 ACM SIGMETRICS International conference on …, 2001
4662001
Speed scaling to manage energy and temperature
N Bansal, T Kimbrel, K Pruhs
Journal of the ACM (JACM) 54 (1), 3, 2007
4162007
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
4092003
The santa claus problem
N Bansal, M Sviridenko
Symposium on Theory of Computing, 31-40, 2006
2822006
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
2512004
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
2122004
Speed scaling with an arbitrary power function
N Bansal, HL Chan, K Pruhs
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
2072009
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
2002008
Speed scaling for weighted flow time
N Bansal, K Pruhs, C Stein
SIAM Journal on Computing 39 (4), 1294-1308, 2010
1992010
A primal-dual randomized algorithm for weighted paging
N Bansal, N Buchbinder, J Naor
Journal of the ACM (JACM) 59 (4), 1-24, 2012
1602012
Constructive algorithms for discrepancy minimization
N Bansal
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 3-10, 2010
1552010
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
1472012
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
1392006
The geometry of scheduling
N Bansal, K Pruhs
SIAM Journal on Computing 43 (5), 1684-1698, 2014
1182014
Scheduling for speed bounded processors
N Bansal, HL Chan, TW Lam, LK Lee
International Colloquium on Automata, Languages, and Programming, 409-420, 2008
1162008
A quasi-PTAS for unsplittable flow on line graphs
N Bansal, A Chakrabarti, A Epstein, B Schieber
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
1122006
Upper bounds for MaxSat: Further improved
N Bansal, V Raman
International symposium on algorithms and computation, 247-258, 1999
1081999
Improved approximation algorithms for multidimensional bin packing problems
N Bansal, A Caprara, M Sviridenko
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
1072006
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20