| Correlation clustering N Bansal, A Blum, S Chawla Machine Learning 56 (1), 89-113, 2004 | 1242 | 2004 |
| Speed scaling to manage energy and temperature N Bansal, T Kimbrel, K Pruhs Journal of the ACM (JACM) 54 (1), 3, 2007 | 555* | 2007 |
| 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 | 471 | 2003 |
| Analysis of SRPT scheduling: Investigating unfairness N Bansal, M Harchol-Balter Proceedings of the 2001 ACM SIGMETRICS international conference on …, 2001 | 416 | 2001 |
| 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 | 361 | 2003 |
| The santa claus problem N Bansal, M Sviridenko Symposium on Theory of Computing, 31-40, 2006 | 233 | 2006 |
| Speed scaling with an arbitrary power function N Bansal, HL Chan, K Pruhs ACM Transactions on Algorithms (TALG) 9 (2), 1-14, 2013 | 206* | 2013 |
| 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 | 197 | 2004 |
| Speed scaling for weighted flow time N Bansal, K Pruhs, C Stein SIAM Journal on Computing 39 (4), 1294-1308, 2010 | 180 | 2010 |
| 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 | 180 | 2008 |
| A new approximation method for set covering problems, with applications to multidimensional bin packing N Bansal, A Caprara, M Sviridenko SIAM Journal on Computing 39 (4), 1256, 2010 | 168* | 2010 |
| 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 | 152* | 2006 |
| 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 | 119* | 2007 |
| 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 | 109* | 2015 |
| Constructive algorithms for discrepancy minimization N Bansal 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 3-10, 2010 | 108 | 2010 |
| Scheduling for speed bounded processors N Bansal, HL Chan, TW Lam, LK Lee International Colloquium on Automata, Languages, and Programming, 409-420, 2008 | 107 | 2008 |
| The geometry of scheduling N Bansal, K Pruhs SIAM Journal on Computing 43 (5), 1684-1698, 2014 | 104 | 2014 |
| Upper bounds for MaxSat: Further improved N Bansal, V Raman International symposium on algorithms and computation, 247-258, 1999 | 100 | 1999 |
| 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 | 99 | 2012 |
| Additive guarantees for degree-bounded directed network design N Bansal, R Khandekar, V Nagarajan SIAM Journal on Computing 39 (4), 1413-1431, 2010 | 96 | 2010 |
Kirk PruhsProfessor of Computer Science, University of PittsburghDirección de correo verificada de cs.pitt.edu
