Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Bansal, Nikhil - IBM T.J. Watson Research Center
Available online at www.sciencedirect.com Operations Research Letters 32 (2004) 7376
Minimizing Weighted Flow Time N. Bansal K. Dhamdhere y
RC23468 (W0412-040) December 15, 2004 Computer Science
Achievable sojourn times by non-size based policies in a GI/GI/1 Nikhil Bansal
RC23277 (W0407-048) July 20, 2004 Mathematics
Improving Web Performance in Broadcast-Unicast Mukesh Agrawal, Amit Manjhi, Nikhil Bansal, Srinivasan Seshan
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
Minimizing makespan in nowait job shops Nikhil Bansal # Mohammad Mahdian + Maxim Sviridenko #
Speed Scaling to Manage Temperature Nikhil Bansal Kirk Pruhs y
Analysis of SRPT Scheduling: Investigating Unfairness \Lambda Nikhil Bansal and Mor HarcholBalter
Online Oblivious Routing # Nikhil Bansal Avrim Blum Shuchi Chawla Adam Meyerson
On minimizing the total ow time on multiple machines Nikhil Bansal
Schedul ing for Web Servers HarcholB alter,
BINPACKING WITH FRAGILE OBJECTS Nikhil Bansal
Approximating the Average Response Time in Broadcast Scheduling Nikhil Bansal Moses Charikar y Sanjeev Khanna z Joseph (Se) Naor x
Further Improvements in Competitive Guarantees for QoS Bu#ering
Upper Bounds for MaxSat: Further Improved ? Nikhil Bansal 1 and Venkatesh Raman 2
Two dimensional Bin Packing with one dimensional resource augmentation
Job shop scheduling with unit processing times Nikhil Bansal # Tracy Kimbrel # Maxim Sviridenko #
Size-based Scheduling to Improve Web Performance MOR HARCHOL-BALTER
Server Scheduling in the Weighted # p Norm Nikhil Bansal
On the average sojourn time under M/M/1/SRPT Nikhil Bansal
Analysis of the M/G/1 Processor-Sharing Queue with Bulk Nikhil Bansal y
Scheduling for Flow-Time with Admission Nikhil Bansal 1 , Avrim Blum 1 , Shuchi Chawla 1 , and Kedar Dhamdhere 1
