Nikhil Bansal - Google Scholar

Cited by

	All	Since 2015
Citations	8880	3681
h-index	45	32
i10-index	114	82

700

350

175

525

200220032004200520062007200820092010201120122013201420152016201720182019202049 124 217 261 290 281 364 482 508 566 595 626 684 642 622 622 589 652 546

Co-authors

Kirk PruhsProfessor of Computer Science, University of PittsburghVerified email at cs.pitt.edu
Maxim SviridenkoYahoo! ResearchVerified email at yahoo-inc.com
Joseph Seffi NaorTechnionVerified email at cs.technion.ac.il
Viswanath NagarajanUniversity of MichiganVerified email at umich.edu
niv buchbinderTel Aviv universityVerified email at post.tau.ac.il
Mor Harchol-BalterProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Joel WolfPrincipal Research Staff Member, IBM T.J. Watson Research, retiredVerified email at us.ibm.com
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at ChicagoVerified email at ttic.edu
Shuchi ChawlaUniversity of Wisconsin - MadisonVerified email at cs.wisc.edu
Anupam GuptaProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Tracy KimbrelVerified email at nsf.gov
Clifford SteinProfessor of IEOR and CS, Columbia UniversityVerified email at ieor.columbia.edu
Ravishankar KrishnaswamyMicrosoft ResearchVerified email at cs.cmu.edu
Rohit KhandekarKCG Holdings Inc.Verified email at kcg.com
Bianca SchroederProfessor of Computer Science, University of TorontoVerified email at cs.cmu.edu
Alberto CapraraUniversita' di BolognaVerified email at unibo.it
Kedar DhamdhereGoogleVerified email at google.com
Atri RudraProfessor, CSE, University at BuffaloVerified email at buffalo.edu
Adam MeyersonGoogle, Inc.Verified email at google.com
Jochen KoenemannUniversity of WaterlooVerified email at uwaterloo.ca

Nikhil Bansal

CWI and TU Eindhoven

Verified email at tue.nl - Homepage

Algorithm Design Theoretical Computer Science Discrete Math


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Correlation clustering N Bansal, A Blum, S Chawla Machine Learning 56 (1), 89-113, 2004	1338	2004
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	480	2003
Analysis of SRPT scheduling: Investigating unfairness N Bansal, M Harchol-Balter Proceedings of the 2001 ACM SIGMETRICS international conference on …, 2001	428	2001
Speed scaling to manage energy and temperature N Bansal, T Kimbrel, K Pruhs Journal of the ACM (JACM) 54 (1), 3, 2007	378	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	374	2003
The santa claus problem N Bansal, M Sviridenko Symposium on Theory of Computing, 31-40, 2006	253	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	209	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	204	2004
Speed scaling with an arbitrary power function N Bansal, HL Chan, K Pruhs Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009	190	2009
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	188	2008
Speed scaling for weighted flow time N Bansal, K Pruhs, C Stein SIAM Journal on Computing 39 (4), 1294-1308, 2010	185	2010
A primal-dual randomized algorithm for weighted paging N Bansal, N Buchbinder, J Naor Journal of the ACM (JACM) 59 (4), 1-24, 2012	130	2012
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	130*	2007
Constructive algorithms for discrepancy minimization N Bansal 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 3-10, 2010	124	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	117	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 (4), 733-762, 2012	111	2012
Scheduling for speed bounded processors N Bansal, HL Chan, TW Lam, LK Lee International Colloquium on Automata, Languages, and Programming, 409-420, 2008	109	2008
The geometry of scheduling N Bansal, K Pruhs SIAM Journal on Computing 43 (5), 1684-1698, 2014	108	2014
Upper bounds for MaxSat: Further improved N Bansal, V Raman International symposium on algorithms and computation, 247-258, 1999	103	1999
Additive guarantees for degree-bounded directed network design N Bansal, R Khandekar, V Nagarajan SIAM Journal on Computing 39 (4), 1413-1431, 2010	98	2010

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors