Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nikhil Bansal
2010 – today
- 2013
[j40]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang: A Harmonic Algorithm for the 3D Strip Packing Problem. SIAM J. Comput. 42(2): 579-592 (2013)- [j39]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed Scaling with an Arbitrary Power Function. ACM Transactions on Algorithms 9(2): 18 (2013)
- [c78]
- 2012
- [j38]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica 63(4): 733-762 (2012)
- [j37]Nikhil Bansal, Niv Buchbinder, Joseph Naor: A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM 59(4): 19 (2012)
- [j36]
- [j35]Nikhil Bansal, Niv Buchbinder, Joseph Naor: Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41(2): 391-414 (2012)
- [j34]Nikhil Bansal, Ryan Williams: Regularity Lemmas and Combinatorial Algorithms. Theory of Computing 8(1): 69-94 (2012)
- [j33]Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, Kirk Pruhs: Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. Theory of Computing 8(1): 209-229 (2012)
- [j32]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan: Solving Packing Integer Programs via Randomized Rounding with Alterations. Theory of Computing 8(1): 533-565 (2012)
- [c77]Nikhil Bansal, Kirk Pruhs: Weighted Geometric Set Multi-cover via Quasi-uniform Sampling. ESA 2012: 145-156
- [c76]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein: Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg 2012: 37-51
- [c75]Nikhil Bansal, Vibhor Bhatt, Prasad Jayanti, Ranganath Kondapally: Tight time-space tradeoff for mutual exclusion. STOC 2012: 971-982
- [c74]
- [i9]Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol: An entropy argument for counting matroids. CoRR abs/1210.6581 (2012)
- 2011
- [j31]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Competitive Algorithms for Due Date Scheduling. Algorithmica 59(4): 569-582 (2011)
- [j30]Nikhil Bansal, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Baruch Schieber, Chao Wang: Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Algorithmica 60(2): 421-450 (2011)
- [j29]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs: Average Rate Speed Scaling. Algorithmica 60(4): 877-889 (2011)
- [c73]Nikhil Bansal, Ravishankar Krishnaswamy, Barna Saha: On Capacitated Set Cover Problems. APPROX-RANDOM 2011: 38-49
- [c72]
- [c71]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26
- [c70]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor: A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276
- [c69]Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer: Minimum congestion mapping in a cloud. PODC 2011: 267-276
- [i8]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor: A Polylogarithmic-Competitive Algorithm for the k-Server Problem. CoRR abs/1110.1580 (2011)
- [i7]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-Max Graph Partitioning and Small Set Expansion. CoRR abs/1110.4319 (2011)
- 2010
- [j28]Nikhil Bansal, Moshe Lewenstein, Bin Ma, Kaizhong Zhang: On the Longest Common Rigid Subsequence Problem. Algorithmica 56(2): 270-280 (2010)
- [j27]Nikhil Bansal, Kirk Pruhs: Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service. SIAM J. Comput. 39(7): 3311-3335 (2010)
- [j26]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko: Dynamic pricing for impatient bidders. ACM Transactions on Algorithms 6(2) (2010)
- [c68]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). ESA (2) 2010: 218-229
- [c67]
- [c66]
- [c65]Nikhil Bansal, Subhash Khot: Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. ICALP (1) 2010: 250-261
- [c64]Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor: Approximation Algorithms for Diversified Search Ranking. ICALP (2) 2010: 273-284
- [c63]Nikhil Bansal, Niv Buchbinder, Joseph Naor: Metrical Task Systems and the k-Server Problem on HSTs. ICALP (1) 2010: 287-298
- [c62]Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan: Better Scalable Algorithms for Broadcast Scheduling. ICALP (1) 2010: 324-335
- [c61]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123
- [c60]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan: On k-Column Sparse Packing Programs. IPCO 2010: 369-382
- [c59]Nikhil Bansal, Niv Buchbinder, Joseph Naor: Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA 2010: 40-55
- [c58]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy: A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. SODA 2010: 1539-1545
- [i6]
- [i5]Nikhil Bansal, Anupam Gupta, Viswanath Nagarajan, Atri Rudra: When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings. CoRR abs/1003.0167 (2010)
- [i4]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. CoRR abs/1003.2977 (2010)
- [i3]
- [i2]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. CoRR abs/1008.5356 (2010)
2000 – 2009
- 2009
- [j25]Nikhil Bansal, Sergey Bravyi, Barbara M. Terhal: Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs. Quantum Information & Computation 9(7): 701-720 (2009)
- [j24]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko: A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. SIAM J. Comput. 39(4): 1256-1278 (2009)
- [j23]Nikhil Bansal, Kirk Pruhs, Clifford Stein: Speed Scaling for Weighted Flow Time. SIAM J. Comput. 39(4): 1294-1308 (2009)
- [j22]Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan: Additive Guarantees for Degree-Bounded Directed Network Design. SIAM J. Comput. 39(4): 1413-1431 (2009)
- [j21]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed scaling with a solar cell. Theor. Comput. Sci. 410(45): 4580-4587 (2009)
- [j20]Nikhil Bansal, Zhen Liu, Arvind Sankar: Bin-packing with fragile objects and frequency allocation in cellular networks. Wireless Networks 15(6): 821-830 (2009)
- [c57]
- [c56]
- [c55]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy Katz: Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. ICALP (1) 2009: 144-155
- [c54]Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko: A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ISAAC 2009: 77-86
- [c53]Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Rohit Wagle, Kun-Lung Wu: Job Admission and Resource Allocation in Distributed Streaming Systems. JSSPP 2009: 169-189
- [c52]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed scaling with an arbitrary power function. SODA 2009: 693-701
- [c51]Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour: A logarithmic approximation for unsplittable flow on line graphs. SODA 2009: 702-709
- [c50]Nikhil Bansal, Ho-Leung Chan: Weighted flow time does not admit O(1)-competitive algorithms. SODA 2009: 1238-1244
- [i1]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan: On k-Column Sparse Packing Programs. CoRR abs/0908.2256 (2009)
- 2008
- [j19]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)
- [j18]Nikhil Bansal, Don Coppersmith, Maxim Sviridenko: Improved Approximation Algorithms for Broadcast Scheduling. SIAM J. Comput. 38(3): 1157-1174 (2008)
- [c49]
- [c48]Nikhil Bansal, Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee: Scheduling for Speed Bounded Processors. ICALP (1) 2008: 409-420
- [c47]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
- [c46]P. Panjiyar, P. Mourya, Nikhil Bansal, P. Srivastava, A. Mukherjee: Transport security using mobile technology. ISI 2008: 275-276
- [c45]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs: Average Rate Speed Scaling. LATIN 2008: 240-251
- [c44]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
- [c43]Nikhil Bansal, Niv Buchbinder, Joseph Naor: Randomized competitive algorithms for generalized caching. STOC 2008: 235-244
- [c42]Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan: Additive guarantees for degree bounded directed network design. STOC 2008: 769-778
- [r5]
- [r4]
- [r3]
- [r2]
- [r1]
- 2007
- [j17]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)
- [j16]Nikhil Bansal, Maxim Sviridenko: Two-dimensional bin packing with one-dimensional resource augmentation. Discrete Optimization 4(2): 143-153 (2007)
- [j15]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs: Speed scaling to manage energy and temperature. J. ACM 54(1) (2007)
- [j14]Nikhil Bansal, Kedar Dhamdhere: Minimizing weighted flow time. ACM Transactions on Algorithms 3(4) (2007)
- [c41]Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin: Robust Reductions from Ranking to Classification. COLT 2007: 604-619
- [c40]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor: An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. ESA 2007: 522-533
- [c39]Nikhil Bansal, Niv Buchbinder, Joseph Naor: A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS 2007: 507-517
- [c38]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
- [c37]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Competitive Algorithms for Due Date Scheduling. ICALP 2007: 28-39
- [c36]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko: Dynamic pricing for impatient bidders. SODA 2007: 726-735
- [c35]
- [c34]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang: Harmonic algorithm for 3-dimensional strip packing problem. SODA 2007: 1197-1206
- [c33]Nikhil Bansal, Kanishka Lahiri, Anand Raghunathan: Automatic Power Modeling of Infrastructure IP for System-on-Chip Power Analysis. VLSI Design 2007: 513-520
- [e1]Nikhil Bansal, Kirk Pruhs, Clifford Stein (Eds.): Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. SIAM 2007, ISBN 978-0-898716-24-5
- 2006
- [j13]Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. Math. Oper. Res. 31(1): 31-49 (2006)
- [j12]Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko: Job Shop Scheduling with Unit Processing Times. Math. Oper. Res. 31(2): 381-389 (2006)
- [j11]
- [c32]Nikhil Bansal, Don Coppersmith, Baruch Schieber: Minimizing Setup and Beam-On Times in Radiation Therapy. APPROX-RANDOM 2006: 27-38
- [c31]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko: Improved approximation algorithms for multidimensional bin packing problems. FOCS 2006: 697-708
- [c30]Nikhil Bansal, Don Coppersmith, Maxim Sviridenko: Improved approximation algorithms for broadcast scheduling. SODA 2006: 344-353
- [c29]
- [c28]Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber: A quasi-PTAS for unsplittable flow on line graphs. STOC 2006: 721-729
- 2005
- [j10]Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko: Minimizing Makespan in No-Wait Job Shops. Math. Oper. Res. 30(4): 817-831 (2005)
- [j9]
- [j8]Nikhil Bansal: Minimizing flow time on a constant number of machines with preemption. Oper. Res. Lett. 33(3): 267-273 (2005)
- [c27]Nikhil Bansal, Andrea Lodi, Maxim Sviridenko: A Tale of Two Dimensional Bin Packing. FOCS 2005: 657-666
- [c26]Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko: Job shop scheduling with unit processing times. SODA 2005: 207-214
- [c25]Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor: Approximating the average response time in broadcast scheduling. SODA 2005: 215-221
- [c24]
- [c23]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
- 2004
- [j7]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4): 305-318 (2004)
- [j6]Nikhil Bansal, Avrim Blum, Shuchi Chawla: Correlation Clustering. Machine Learning 56(1-3): 89-113 (2004)
- [j5]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)
- [c22]Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták: Efficient Algorithms for Finding Submasses in Weighted Strings. CPM 2004: 194-204
- [c21]Nikhil Bansal, Sumit Gupta, Nikil Dutt, Alexandru Nicolau, Rajesh Gupta: Network Topology Exploration of Mesh-Based Coarse-Grain Reconfigurable Architectures. DATE 2004: 474-479
- [c20]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs: Dynamic Speed Scaling to Manage Energy and Temperature. FOCS 2004: 520-529
- [c19]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
- [c18]Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko: Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207
- [c17]
- [c16]Nikhil Bansal, Maxim Sviridenko: New approximability and inapproximability results for 2-dimensional Bin Packing. SODA 2004: 196-203
- [c15]
- [c14]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. STOC 2004: 166-174
- 2003
- [j4]Nikhil Bansal: Analysis of the M/G/1 processor-sharing queue with bulk arrivals. Oper. Res. Lett. 31(3): 401-405 (2003)
- [j3]Nikhil Bansal: On the average sojourn time under M/M/1/SRPT. SIGMETRICS Performance Evaluation Review 31(2): 34-35 (2003)
- [j2]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)
- [c13]Mehrdad Reshadi, Nikhil Bansal, Prabhat Mishra, Nikil D. Dutt: An efficient retargetable framework for instruction-set simulation. CODES+ISSS 2003: 13-18
- [c12]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere: Scheduling for Flow-Time with Admission Control. ESA 2003: 43-54
- [c11]Mukesh Agrawal, Amit Manjhi, Nikhil Bansal, Srinivasan Seshan: Improving Web Performance in Broadcast-Unicast Networks. INFOCOM 2003
- [c10]
- [c9]
- [c8]
- [c7]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003: 260-270
- [c6]Nikhil Bansal, Kirk Pruhs: Server scheduling in the Lp norm: a rising tide lifts all boat. STOC 2003: 242-250
- 2002
- [c5]
- [c4]
- 2001
- [j1]Nikhil Bansal, Mor Harchol-Balter: Analysis of M/G/1/SRPT under transient overload. SIGMETRICS Performance Evaluation Review 29(3): 12-14 (2001)
- [c3]Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, Mukesh Agrawal: SRPT Scheduling for Web Servers. JSSPP 2001: 11-20
- [c2]Nikhil Bansal, Mor Harchol-Balter: Analysis of SRPT scheduling: investigating unfairness. SIGMETRICS/Performance 2001: 279-290
1990 – 1999
- 1999
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-05 21:25 CEST by the dblp team