The SCEAS System
| |||||||

## Search the dblp DataBase
Nikhil Bansal:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Nikhil Bansal, Don Coppersmith, Baruch Schieber
**Minimizing Setup and Beam-On Times in Radiation Therapy.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:27-38 [Conf] - Mehrdad Reshadi, Nikhil Bansal, Prabhat Mishra, Nikil D. Dutt
**An efficient retargetable framework for instruction-set simulation.**[Citation Graph (0, 0)][DBLP] CODES+ISSS, 2003, pp:13-18 [Conf] - Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták
**Efficient Algorithms for Finding Submasses in Weighted Strings.**[Citation Graph (0, 0)][DBLP] CPM, 2004, pp:194-204 [Conf] - Nikhil Bansal, Sumit Gupta, Nikil Dutt, Alexandru Nicolau, Rajesh Gupta
**Network Topology Exploration of Mesh-Based Coarse-Grain Reconfigurable Architectures.**[Citation Graph (0, 0)][DBLP] DATE, 2004, pp:474-479 [Conf] - Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere
**Scheduling for Flow-Time with Admission Control.**[Citation Graph (0, 0)][DBLP] ESA, 2003, pp:43-54 [Conf] - Nikhil Bansal, Avrim Blum, Shuchi Chawla
**Correlation Clustering.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:238-0 [Conf] - Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs
**Dynamic Speed Scaling to Manage Energy and Temperature.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:520-529 [Conf] - Nikhil Bansal, Andrea Lodi, Maxim Sviridenko
**A Tale of Two Dimensional Bin Packing.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:657-666 [Conf] - Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
**Improved approximation algorithms for multidimensional bin packing problems.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:697-708 [Conf] - Nikhil Bansal, Sumit Gupta, Nikil D. Dutt, Alexandru Nicolau, Rajesh K. Gupta
**Interconnect-Aware Mapping of Applications to Coarse-Grain Reconfigurable Architectures.**[Citation Graph (0, 0)][DBLP] FPL, 2004, pp:891-899 [Conf] - Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
**Further Improvements in Competitive Guarantees for QoS Buffering.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:196-207 [Conf] - Nikhil Bansal, Zhen Liu, Arvind Sankar
**Bin-Packing with Fragile Objects.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:38-46 [Conf] - Mukesh Agrawal, Amit Manjhi, Nikhil Bansal, Srinivasan Seshan
**Improving Web Performance in Broadcast-Unicast Networks.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2003, pp:- [Conf] - Nikhil Bansal, Zhen Liu
**Capacity, Delay and Mobility in Wireless Ad-Hoc Networks.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2003, pp:- [Conf] - Nikhil Bansal, Venkatesh Raman
**Upper Bounds for MaxSat: Further Improved.**[Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:247-258 [Conf] - Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, Mukesh Agrawal
**SRPT Scheduling for Web Servers.**[Citation Graph (0, 0)][DBLP] JSSPP, 2001, pp:11-20 [Conf] - Nikhil Bansal, Kirk Pruhs
**Server Scheduling in the Weighted l**[Citation Graph (0, 0)][DBLP]_{p}Norm. LATIN, 2004, pp:434-443 [Conf] - Nikhil Bansal, Mor Harchol-Balter
**Analysis of SRPT scheduling: investigating unfairness.**[Citation Graph (0, 0)][DBLP] SIGMETRICS/Performance, 2001, pp:279-290 [Conf] - Nikhil Bansal
**On minimizing the total flow time on multiple machines.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:572-574 [Conf] - Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor
**Approximating the average response time in broadcast scheduling.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:215-221 [Conf] - Nikhil Bansal, Don Coppersmith, Maxim Sviridenko
**Improved approximation algorithms for broadcast scheduling.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:344-353 [Conf] - Nikhil Bansal, Kedar Dhamdhere
**Minimizing weighted flow time.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:508-516 [Conf] - Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko
**Job shop scheduling with unit processing times.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:207-214 [Conf] - Nikhil Bansal, Maxim Sviridenko
**New approximability and inapproximability results for 2-dimensional Bin Packing.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:196-203 [Conf] - Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson
**Online oblivious routing.**[Citation Graph (0, 0)][DBLP] SPAA, 2003, pp:44-49 [Conf] - Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha
**Non-clairvoyant Scheduling for Minimizing Mean Slowdown.**[Citation Graph (0, 0)][DBLP] STACS, 2003, pp:260-270 [Conf] - Nikhil Bansal, Kirk Pruhs
**Speed Scaling to Manage Temperature.**[Citation Graph (0, 0)][DBLP] STACS, 2005, pp:460-471 [Conf] - Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson
**Approximation algorithms for deadline-TSP and vehicle routing with time-windows.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:166-174 [Conf] - Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber
**A quasi-PTAS for unsplittable flow on line graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:721-729 [Conf] - Nikhil Bansal, Kirk Pruhs
**Server scheduling in the L**[Citation Graph (0, 0)][DBLP]_{p}norm: a rising tide lifts all boat. STOC, 2003, pp:242-250 [Conf] - Nikhil Bansal, Maxim Sviridenko
**The Santa Claus problem.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:31-40 [Conf] - Nikhil Bansal, Kanishka Lahiri, Anand Raghunathan, Srimat T. Chakradhar
**Power Monitors: A Framework for System-Level Power Estimation Using Heterogeneous Power Models.**[Citation Graph (0, 0)][DBLP] VLSI Design, 2005, pp:579-585 [Conf] - Nikhil Bansal, Kanishka Lahiri, Anand Raghunathan
**Automatic Power Modeling of Infrastructure IP for System-on-Chip Power Analysis.**[Citation Graph (0, 0)][DBLP] VLSI Design, 2007, pp:513-520 [Conf] - Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha
**Non-Clairvoyant Scheduling for Minimizing Mean Slowdown.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:40, n:4, pp:305-318 [Journal] - Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták
**Finding submasses in weighted strings with Fast Fourier Transform.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:707-718 [Journal] - Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs
**Speed scaling to manage energy and temperature.**[Citation Graph (0, 0)][DBLP] J. ACM, 2007, v:54, n:1, pp:- [Journal] - Nikhil Bansal, Avrim Blum, Shuchi Chawla
**Correlation Clustering.**[Citation Graph (0, 0)][DBLP] Machine Learning, 2004, v:56, n:1-3, pp:89-113 [Journal] - Nikhil Bansal
**Analysis of the M/G/1 processor-sharing queue with bulk arrivals.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:401-405 [Journal] - Nikhil Bansal
**On the average sojourn time under M/M/1/SRPT.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2005, v:33, n:2, pp:195-200 [Journal] - Nikhil Bansal
**Minimizing flow time on a constant number of machines with preemption.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2005, v:33, n:3, pp:267-273 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2004, v:32, n:1, pp:73-76 [Journal] - Nikhil Bansal, David Gamarnik
**Handling load with less stress.**[Citation Graph (0, 0)][DBLP] Queueing Syst., 2006, v:54, n:1, pp:45-54 [Journal] - Nikhil Bansal
**On the average sojourn time under M/M/1/SRPT.**[Citation Graph (0, 0)][DBLP] SIGMETRICS Performance Evaluation Review, 2003, v:31, n:2, pp:34-35 [Journal] - Nikhil Bansal, Mor Harchol-Balter
**Analysis of M/G/1/SRPT under transient overload.**[Citation Graph (0, 0)][DBLP] SIGMETRICS Performance Evaluation Review, 2001, v:29, n:3, pp:12-14 [Journal] - Mor Harchol-Balter, Bianca Schroeder, Nikhil Bansal, Mukesh Agrawal
**Size-based scheduling to improve web performance.**[Citation Graph (0, 0)][DBLP] ACM Trans. Comput. Syst., 2003, v:21, n:2, pp:207-233 [Journal] - Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin
**Robust Reductions from Ranking to Classification.**[Citation Graph (0, 0)][DBLP] COLT, 2007, pp:604-619 [Conf] - Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
**An**[Citation Graph (0, 0)][DBLP]*O*(log^{2}*k*)-Competitive Algorithm for Metric Bipartite Matching. ESA, 2007, pp:522-533 [Conf] - Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
**Competitive Algorithms for Due Date Scheduling.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:28-39 [Conf] - Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
**Dynamic pricing for impatient bidders.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:726-735 [Conf] - Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang
**Harmonic algorithm for 3-dimensional strip packing problem.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1197-1206 [Conf] - Nikhil Bansal, Kirk Pruhs, Clifford Stein
**Speed scaling for weighted flow time.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:805-813 [Conf] **Speed Scaling with a Solar Cell.**[Citation Graph (, )][DBLP]**When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract).**[Citation Graph (, )][DBLP]**Non-Preemptive Min-Sum Scheduling with Resource Augmentation.**[Citation Graph (, )][DBLP]**A Primal-Dual Randomized Algorithm for Weighted Paging.**[Citation Graph (, )][DBLP]**Optimal Long Code Test with One Free Bit.**[Citation Graph (, )][DBLP]**Regularity Lemmas and Combinatorial Algorithms.**[Citation Graph (, )][DBLP]**Scheduling for Speed Bounded Processors.**[Citation Graph (, )][DBLP]**Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule.**[Citation Graph (, )][DBLP]**Metrical Task Systems and the**[Citation Graph (, )][DBLP]*k*-Server Problem on HSTs.**Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems.**[Citation Graph (, )][DBLP]**Better Scalable Algorithms for Broadcast Scheduling.**[Citation Graph (, )][DBLP]**Approximation Algorithms for Diversified Search Ranking.**[Citation Graph (, )][DBLP]**Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications.**[Citation Graph (, )][DBLP]**On**[Citation Graph (, )][DBLP]*k*-Column Sparse Packing Programs.**On Generalizations of Network Design Problems with Degree Bounds.**[Citation Graph (, )][DBLP]**Job Admission and Resource Allocation in Distributed Streaming Systems.**[Citation Graph (, )][DBLP]**Average Rate Speed Scaling.**[Citation Graph (, )][DBLP]**SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems.**[Citation Graph (, )][DBLP]**Speed scaling with an arbitrary power function.**[Citation Graph (, )][DBLP]**A logarithmic approximation for unsplittable flow on line graphs.**[Citation Graph (, )][DBLP]**Weighted flow time does not admit O(1)-competitive algorithms.**[Citation Graph (, )][DBLP]**Towards the Randomized k-Server Conjecture: A Primal-Dual Approach.**[Citation Graph (, )][DBLP]**A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover.**[Citation Graph (, )][DBLP]**Additive guarantees for degree bounded directed network design.**[Citation Graph (, )][DBLP]**Randomized competitive algorithms for generalized caching.**[Citation Graph (, )][DBLP]**On the Longest Common Rigid Subsequence Problem.**[Citation Graph (, )][DBLP]**On k-Column Sparse Packing Programs**[Citation Graph (, )][DBLP]**Constructive Algorithms for Discrepancy Minimization**[Citation Graph (, )][DBLP]**When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings**[Citation Graph (, )][DBLP]**On Generalizations of Network Design Problems with Degree Bounds**[Citation Graph (, )][DBLP]**The Geometry of Scheduling**[Citation Graph (, )][DBLP]**When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings**[Citation Graph (, )][DBLP]
Search in 0.047secs, Finished in 0.053secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |