| 2009 |
|---|
| 73 | EE | Nikhil Bansal,
Ho-Leung Chan:
Weighted flow time does not admit O(1)-competitive algorithms.
SODA 2009: 1238-1244 |
| 72 | EE | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed scaling with an arbitrary power function.
SODA 2009: 693-701 |
| 71 | EE | Nikhil Bansal,
Zachary Friggstad,
Rohit Khandekar,
Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs.
SODA 2009: 702-709 |
| 2008 |
|---|
| 70 | EE | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed Scaling with a Solar Cell.
AAIM 2008: 15-26 |
| 69 | EE | Nikhil Bansal,
Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee:
Scheduling for Speed Bounded Processors.
ICALP (1) 2008: 409-420 |
| 68 | EE | Nikhil Bansal,
Ranjita Bhagwan,
Navendu Jain,
Yoonho Park,
Deepak S. Turaga,
Chitra Venkatramani:
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications.
INFOCOM 2008: 1319-1327 |
| 67 | EE | Nikhil Bansal,
David P. Bunde,
Ho-Leung Chan,
Kirk Pruhs:
Average Rate Speed Scaling.
LATIN 2008: 240-251 |
| 66 | EE | Joel L. Wolf,
Nikhil Bansal,
Kirsten Hildrum,
Sujay Parekh,
Deepak Rajan,
Rohit Wagle,
Kun-Lung Wu,
Lisa Fleischer:
SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems.
Middleware 2008: 306-325 |
| 65 | EE | Nikhil Bansal,
Niv Buchbinder,
Joseph Naor:
Randomized competitive algorithms for generalized caching.
STOC 2008: 235-244 |
| 64 | EE | Nikhil Bansal,
Rohit Khandekar,
Viswanath Nagarajan:
Additive guarantees for degree bounded directed network design.
STOC 2008: 769-778 |
| 63 | EE | Nikhil Bansal:
Approximation Schemes for Bin Packing.
Encyclopedia of Algorithms 2008 |
| 62 | EE | Nikhil Bansal:
Minimum Flow Time.
Encyclopedia of Algorithms 2008 |
| 61 | EE | Nikhil Bansal:
Multi-level Feedback Queues.
Encyclopedia of Algorithms 2008 |
| 60 | EE | Nikhil Bansal:
Oblivious Routing.
Encyclopedia of Algorithms 2008 |
| 59 | EE | Nikhil Bansal:
Shortest Elapsed Time First Scheduling.
Encyclopedia of Algorithms 2008 |
| 58 | EE | Maria-Florina Balcan,
Nikhil Bansal,
Alina Beygelzimer,
Don Coppersmith,
John Langford,
Gregory B. Sorkin:
Robust reductions from ranking to classification.
Machine Learning 72(1-2): 139-153 (2008) |
| 57 | EE | Nikhil Bansal,
Don Coppersmith,
Maxim Sviridenko:
Improved Approximation Algorithms for Broadcast Scheduling.
SIAM J. Comput. 38(3): 1157-1174 (2008) |
| 2007 |
|---|
| 56 | | Nikhil Bansal,
Kirk Pruhs,
Clifford Stein:
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007
SIAM 2007 |
| 55 | EE | Maria-Florina Balcan,
Nikhil Bansal,
Alina Beygelzimer,
Don Coppersmith,
John Langford,
Gregory B. Sorkin:
Robust Reductions from Ranking to Classification.
COLT 2007: 604-619 |
| 54 | EE | Nikhil Bansal,
Niv Buchbinder,
Anupam Gupta,
Joseph Naor:
An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching.
ESA 2007: 522-533 |
| 53 | EE | Nikhil Bansal,
Niv Buchbinder,
Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging.
FOCS 2007: 507-517 |
| 52 | EE | Nikhil Bansal,
Ho-Leung Chan,
Rohit Khandekar,
Kirk Pruhs,
Clifford Stein,
Baruch Schieber:
Non-Preemptive Min-Sum Scheduling with Resource Augmentation.
FOCS 2007: 614-624 |
| 51 | EE | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling.
ICALP 2007: 28-39 |
| 50 | EE | Nikhil Bansal,
Xin Han,
Kazuo Iwama,
Maxim Sviridenko,
Guochuan Zhang:
Harmonic algorithm for 3-dimensional strip packing problem.
SODA 2007: 1197-1206 |
| 49 | EE | Nikhil Bansal,
Ning Chen,
Neva Cherniavsky,
Atri Rudra,
Baruch Schieber,
Maxim Sviridenko:
Dynamic pricing for impatient bidders.
SODA 2007: 726-735 |
| 48 | EE | Nikhil Bansal,
Kirk Pruhs,
Clifford Stein:
Speed scaling for weighted flow time.
SODA 2007: 805-813 |
| 47 | EE | Nikhil Bansal,
Kanishka Lahiri,
Anand Raghunathan:
Automatic Power Modeling of Infrastructure IP for System-on-Chip Power Analysis.
VLSI Design 2007: 513-520 |
| 46 | EE | Nikhil Bansal,
Kedar Dhamdhere:
Minimizing weighted flow time.
ACM Transactions on Algorithms 3(4): (2007) |
| 45 | EE | Nikhil Bansal,
Mark Cieliebak,
Zsuzsanna Lipták:
Finding submasses in weighted strings with Fast Fourier Transform.
Discrete Applied Mathematics 155(6-7): 707-718 (2007) |
| 44 | EE | Nikhil Bansal,
Maxim Sviridenko:
Two-dimensional bin packing with one-dimensional resource augmentation.
Discrete Optimization 4(2): 143-153 (2007) |
| 43 | EE | Nikhil Bansal,
Tracy Kimbrel,
Kirk Pruhs:
Speed scaling to manage energy and temperature.
J. ACM 54(1): (2007) |
| 2006 |
|---|
| 42 | EE | Nikhil Bansal,
Don Coppersmith,
Baruch Schieber:
Minimizing Setup and Beam-On Times in Radiation Therapy.
APPROX-RANDOM 2006: 27-38 |
| 41 | EE | Nikhil Bansal,
Alberto Caprara,
Maxim Sviridenko:
Improved approximation algorithms for multidimensional bin packing problems.
FOCS 2006: 697-708 |
| 40 | EE | Nikhil Bansal,
Don Coppersmith,
Maxim Sviridenko:
Improved approximation algorithms for broadcast scheduling.
SODA 2006: 344-353 |
| 39 | EE | Nikhil Bansal,
Maxim Sviridenko:
The Santa Claus problem.
STOC 2006: 31-40 |
| 38 | EE | Nikhil Bansal,
Amit Chakrabarti,
Amir Epstein,
Baruch Schieber:
A quasi-PTAS for unsplittable flow on line graphs.
STOC 2006: 721-729 |
| 37 | EE | Nikhil Bansal,
David Gamarnik:
Handling load with less stress.
Queueing Syst. 54(1): 45-54 (2006) |
| 2005 |
|---|
| 36 | EE | Nikhil Bansal,
Andrea Lodi,
Maxim Sviridenko:
A Tale of Two Dimensional Bin Packing.
FOCS 2005: 657-666 |
| 35 | EE | Nikhil Bansal,
Tracy Kimbrel,
Maxim Sviridenko:
Job shop scheduling with unit processing times.
SODA 2005: 207-214 |
| 34 | EE | Nikhil Bansal,
Moses Charikar,
Sanjeev Khanna,
Joseph Naor:
Approximating the average response time in broadcast scheduling.
SODA 2005: 215-221 |
| 33 | EE | Nikhil Bansal,
Kirk Pruhs:
Speed Scaling to Manage Temperature.
STACS 2005: 460-471 |
| 32 | EE | Nikhil Bansal,
Kanishka Lahiri,
Anand Raghunathan,
Srimat T. Chakradhar:
Power Monitors: A Framework for System-Level Power Estimation Using Heterogeneous Power Models.
VLSI Design 2005: 579-585 |
| 31 | EE | Nikhil Bansal:
On the average sojourn time under M/M/1/SRPT.
Oper. Res. Lett. 33(2): 195-200 (2005) |
| 30 | EE | Nikhil Bansal:
Minimizing flow time on a constant number of machines with preemption.
Oper. Res. Lett. 33(3): 267-273 (2005) |
| 2004 |
|---|
| 29 | EE | Nikhil Bansal,
Mark Cieliebak,
Zsuzsanna Lipták:
Efficient Algorithms for Finding Submasses in Weighted Strings.
CPM 2004: 194-204 |
| 28 | EE | Nikhil Bansal,
Sumit Gupta,
Nikil Dutt,
Alexandru Nicolau,
Rajesh Gupta:
Network Topology Exploration of Mesh-Based Coarse-Grain Reconfigurable Architectures.
DATE 2004: 474-479 |
| 27 | EE | Nikhil Bansal,
Tracy Kimbrel,
Kirk Pruhs:
Dynamic Speed Scaling to Manage Energy and Temperature.
FOCS 2004: 520-529 |
| 26 | EE | Nikhil Bansal,
Sumit Gupta,
Nikil D. Dutt,
Alexandru Nicolau,
Rajesh K. Gupta:
Interconnect-Aware Mapping of Applications to Coarse-Grain Reconfigurable Architectures.
FPL 2004: 891-899 |
| 25 | EE | Nikhil Bansal,
Lisa Fleischer,
Tracy Kimbrel,
Mohammad Mahdian,
Baruch Schieber,
Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering.
ICALP 2004: 196-207 |
| 24 | EE | Nikhil Bansal,
Kirk Pruhs:
Server Scheduling in the Weighted lp Norm.
LATIN 2004: 434-443 |
| 23 | EE | Nikhil Bansal,
Maxim Sviridenko:
New approximability and inapproximability results for 2-dimensional Bin Packing.
SODA 2004: 196-203 |
| 22 | EE | Nikhil Bansal:
On minimizing the total flow time on multiple machines.
SODA 2004: 572-574 |
| 21 | EE | Nikhil Bansal,
Avrim Blum,
Shuchi Chawla,
Adam Meyerson:
Approximation algorithms for deadline-TSP and vehicle routing with time-windows.
STOC 2004: 166-174 |
| 20 | EE | Nikhil Bansal,
Kedar Dhamdhere,
Jochen Könemann,
Amitabh Sinha:
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown.
Algorithmica 40(4): 305-318 (2004) |
| 19 | EE | Nikhil Bansal,
Avrim Blum,
Shuchi Chawla:
Correlation Clustering.
Machine Learning 56(1-3): 89-113 (2004) |
| 18 | EE | Adam Wierman,
Nikhil Bansal,
Mor Harchol-Balter:
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues.
Oper. Res. Lett. 32(1): 73-76 (2004) |
| 2003 |
|---|
| 17 | EE | Mehrdad Reshadi,
Nikhil Bansal,
Prabhat Mishra,
Nikil D. Dutt:
An efficient retargetable framework for instruction-set simulation.
CODES+ISSS 2003: 13-18 |
| 16 | EE | Nikhil Bansal,
Avrim Blum,
Shuchi Chawla,
Kedar Dhamdhere:
Scheduling for Flow-Time with Admission Control.
ESA 2003: 43-54 |
| 15 | EE | Nikhil Bansal,
Zhen Liu:
Capacity, Delay and Mobility in Wireless Ad-Hoc Networks.
INFOCOM 2003 |
| 14 | EE | Mukesh Agrawal,
Amit Manjhi,
Nikhil Bansal,
Srinivasan Seshan:
Improving Web Performance in Broadcast-Unicast Networks.
INFOCOM 2003 |
| 13 | EE | Nikhil Bansal,
Kedar Dhamdhere:
Minimizing weighted flow time.
SODA 2003: 508-516 |
| 12 | EE | Nikhil Bansal,
Avrim Blum,
Shuchi Chawla,
Adam Meyerson:
Online oblivious routing.
SPAA 2003: 44-49 |
| 11 | EE | Nikhil Bansal,
Kedar Dhamdhere,
Jochen Könemann,
Amitabh Sinha:
Non-clairvoyant Scheduling for Minimizing Mean Slowdown.
STACS 2003: 260-270 |
| 10 | EE | Nikhil Bansal,
Kirk Pruhs:
Server scheduling in the Lp norm: a rising tide lifts all boat.
STOC 2003: 242-250 |
| 9 | EE | Mor Harchol-Balter,
Bianca Schroeder,
Nikhil Bansal,
Mukesh Agrawal:
Size-based scheduling to improve web performance.
ACM Trans. Comput. Syst. 21(2): 207-233 (2003) |
| 8 | EE | Nikhil Bansal:
Analysis of the M/G/1 processor-sharing queue with bulk arrivals.
Oper. Res. Lett. 31(3): 401-405 (2003) |
| 7 | EE | Nikhil Bansal:
On the average sojourn time under M/M/1/SRPT.
SIGMETRICS Performance Evaluation Review 31(2): 34-35 (2003) |
| 2002 |
|---|
| 6 | EE | Nikhil Bansal,
Avrim Blum,
Shuchi Chawla:
Correlation Clustering.
FOCS 2002: 238- |
| 5 | | Nikhil Bansal,
Zhen Liu,
Arvind Sankar:
Bin-Packing with Fragile Objects.
IFIP TCS 2002: 38-46 |
| 2001 |
|---|
| 4 | EE | Mor Harchol-Balter,
Nikhil Bansal,
Bianca Schroeder,
Mukesh Agrawal:
SRPT Scheduling for Web Servers.
JSSPP 2001: 11-20 |
| 3 | EE | Nikhil Bansal,
Mor Harchol-Balter:
Analysis of SRPT scheduling: investigating unfairness.
SIGMETRICS/Performance 2001: 279-290 |
| 2 | EE | Nikhil Bansal,
Mor Harchol-Balter:
Analysis of M/G/1/SRPT under transient overload.
SIGMETRICS Performance Evaluation Review 29(3): 12-14 (2001) |
| 1999 |
|---|
| 1 | EE | Nikhil Bansal,
Venkatesh Raman:
Upper Bounds for MaxSat: Further Improved.
ISAAC 1999: 247-258 |
