The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Nikhil Bansal" ( http://dblp.L3S.de/Authors/Nikhil_Bansal )

URL (Homepage):  http://www.win.tue.nl/~nikhil/  Author page on DBLP  Author page in RDF  Community of Nikhil Bansal in ASPL-2

Publication years (Num. hits)
1999-2003 (17) 2004-2005 (20) 2006-2007 (22) 2008 (15) 2009 (15) 2010 (18) 2011-2012 (22) 2013-2014 (19) 2015 (15) 2016 (19) 2017-2018 (26) 2019 (8)
Publication types (Num. hits)
article(99) incollection(10) inproceedings(105) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 64 occurrences of 49 keywords

Results
Found 217 publication records. Showing 216 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Nikhil Bansal, Marek Eliés, Lukasz Jez, Grigorios Koumoutsos The (h, k)-Server Problem on Bounded Depth Trees. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof New Tools and Connections for Exponential-Time Approximation. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Jatin Batra Geometry of Scheduling on Multiple Machines. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Nikhil Bansal, Ola Svensson, Luca Trevisan New Notions and Constructions of Sparsification for Graphs and Hypergraphs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Nikhil Bansal, Joel H. Spencer On-Line Balancing of Random Inputs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Nikhil Bansal, Daniel Dadush, Shashwat Garg An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Raghu Meka On the discrepancy of random low degree set systems. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal On a generalization of iterated and randomized rounding. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Marek Eliás 0001, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs Tight Bounds for Double Coverage Against Weak Adversaries. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Raghu Meka On the discrepancy of random low degree set systems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Nikhil Bansal On a generalization of iterated and randomized rounding. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, Georg von der Brüggen Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Nikhil Bansal, Bart Kamphorst, Bert Zwart Achievable Performance of Blind Policies in Heavy Traffic. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Anupam Gupta, Guru Guruganesh On the Lovász Theta Function for Independent Sets in Sparse Graphs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas 0001 Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, Georg von der Brüggen Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems. Search on Bibsonomy ISAAC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Marek Eliás 0001, Grigorios Koumoutsos, Jesper Nederlof Competitive Algorithms for Generalized k-Server in Uniform Metrics. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Martin Böhm, Marek Eliás 0001, Grigorios Koumoutsos, Seeun William Umboh Nested Convex Bodies are Chaseable. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett The gram-schmidt walk: a cure for the Banaszczyk blues. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Seeun William Umboh Tight approximation bounds for dominating set on graphs of bounded arboricity. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Irene Finocchi Guest Editors' Foreword. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Anupam Gupta Potential-Function Proofs for First-Order Methods. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof New Tools and Connections for Exponential-time Approximation. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Nikhil Bansal, Marek Eliás 0001, Grigorios Koumoutsos, Jesper Nederlof Competitive Algorithms for Generalized k-Server in Uniform Metrics. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Nikhil Bansal, Marek Eliás 0001, Grigorios Koumoutsos Weighted k-Server Bounds via Combinatorial Dichotomies. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Nikhil Bansal, Martin Böhm, Marek Eliás 0001, Grigorios Koumoutsos, Seeun William Umboh Nested Convex Bodies are Chaseable. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Nikhil Bansal, Christoph Dürr, Nguyen Kim Thang, Óscar C. Vásquez The local-global conjecture for scheduling with non-linear cost. Search on Bibsonomy J. Scheduling The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Daniel Reichman 0001, Seeun William Umboh LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Marek Eliás 0001, Lukasz Jez, Grigorios Koumoutsos The (h, k)-Server Problem on Bounded Depth Trees. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Marek Eliás 0001, Grigorios Koumoutsos Weighted k-Server Bounds via Combinatorial Dichotomies. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Shashwat Garg Algorithmic discrepancy beyond partial coloring. Search on Bibsonomy STOC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas 0001 Faster space-efficient algorithms for subset sum and k-sum. Search on Bibsonomy STOC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal Approximation Schemes for Bin Packing. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal Multilevel Feedback Queues. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal Oblivious Routing. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal Shortest Elapsed Time First Scheduling. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal Minimum Flow Time. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Nicole Megow, Clifford Stein Scheduling (Dagstuhl Seminar 16081). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Bouke Cloostermans Minimizing Maximum Flow-Time on Related Machines. Search on Bibsonomy Theory of Computing The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Tim Oosterwijk, Tjark Vredeveld, Ruben van der Zwaan Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas 0001 Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nikhil Bansal, Daniel Dadush, Shashwat Garg An Algorithm for Komlós Conjecture Matching Banaszczyk's bound. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nikhil Bansal, Shashwat Garg Improved Algorithmic Bounds for Discrepancy of Sparse Set Systems. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nikhil Bansal, Daniel Reichman 0001, Seeun William Umboh Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nikhil Bansal, Shashwat Garg Algorithmic Discrepancy Beyond Partial Coloring. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nikhil Bansal, Marek Eliás 0001, Lukasz Jez, Grigorios Koumoutsos New Bounds for the $(h, k)$-Server Problem. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nikhil Bansal, Kirk Pruhs Weighted geometric set multi-cover via quasi-uniform sampling. Search on Bibsonomy JoCG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Viswanath Nagarajan Approximation-Friendly Discrepancy Rounding. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Marek Eliás 0001, Arindam Khan 0001 Improved Approximation for Vector Bin Packing. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Daniel Dadush, Shashwat Garg An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Aravind Srinivasan, Ola Svensson Lift-and-round to improve weighted completion time on unrelated machines. Search on Bibsonomy STOC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol On the number of matroids. Search on Bibsonomy Combinatorica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor A Polylogarithmic-Competitive Algorithm for the k-Server Problem. Search on Bibsonomy J. ACM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Viswanath Nagarajan Approximation-Friendly Discrepancy Rounding. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Nikhil Bansal, Anupam Gupta, Guru Guruganesh On the Lovász Theta function for Independent Sets in Sparse Graphs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Nikhil Bansal, Ola Svensson, Aravind Srinivasan Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Nikhil Bansal, Bart Kamphorst, Bert Zwart Achievable Performance of Blind Policies in Heavy Traffic. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Nikhil Bansal, Viswanath Nagarajan On the adaptivity gap of stochastic orienteering. Search on Bibsonomy Math. Program. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer Minimum Congestion Mapping in a Cloud. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal Approximating independent sets in sparse graphs. Search on Bibsonomy SODA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Irene Finocchi (eds.) Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings Search on Bibsonomy ESA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Marek Eliás 0001, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs Tight Bounds for Double Coverage Against Weak Adversaries. Search on Bibsonomy WAOA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Anupam Gupta, Guru Guruganesh On the Lovász Theta function for Independent Sets in Sparse Graphs. Search on Bibsonomy STOC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Janardhan Kulkarni Minimizing Flow-Time on Unrelated Machines. Search on Bibsonomy STOC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Bouke Cloostermans Minimizing Maximum Flow-time on Related Machines. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour A logarithmic approximation for unsplittable flow on line graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan Better Scalable Algorithms for Broadcast Scheduling. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Janardhan Kulkarni Minimizing Flow-Time on Unrelated Machines. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol An entropy argument for counting matroids. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Kirk Pruhs The Geometry of Scheduling. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz Min-Max Graph Partitioning and Small Set Expansion. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Viswanath Nagarajan On the Adaptivity Gap of Stochastic Orienteering. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Arindam Khan 0001 Improved Approximation Algorithm for Two-Dimensional Bin Packing. Search on Bibsonomy SODA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. Search on Bibsonomy SODA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Tjark Vredeveld, Ruben van der Zwaan Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Search on Bibsonomy LATIN The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Cyriel Rutten, Suzanne van der Ster, Tjark Vredeveld, Ruben van der Zwaan Approximating Real-Time Scheduling on Identical Machines. Search on Bibsonomy LATIN The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal New Developments in Iterated Rounding (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs Speed Scaling with an Arbitrary Power Function. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Joel Spencer Deterministic Discrepancy Minimization. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Viswanath Nagarajan On the Adaptivity Gap of Stochastic Orienteering. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis On generalizations of network design problems with degree bounds. Search on Bibsonomy Math. Program. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang A Harmonic Algorithm for the 3D Strip Packing Problem. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol On the number of matroids. Search on Bibsonomy SODA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, Kirk Pruhs Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. Search on Bibsonomy Theory of Computing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Ryan Williams 0001 Regularity Lemmas and Combinatorial Algorithms. Search on Bibsonomy Theory of Computing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan Solving Packing Integer Programs via Randomized Rounding with Alterations. Search on Bibsonomy Theory of Computing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil 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. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor A Primal-Dual Randomized Algorithm for Weighted Paging. Search on Bibsonomy J. ACM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol An entropy argument for counting matroids Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Nikhil Bansal Semidefinite optimization in discrepancy theory. Search on Bibsonomy Math. Program. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor Randomized Competitive Algorithms for Generalized Caching. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Kirk Pruhs Weighted Geometric Set Multi-cover via Quasi-uniform Sampling. Search on Bibsonomy ESA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal The Primal-Dual Approach for Online Algorithms. Search on Bibsonomy WAOA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Vibhor Bhatt, Prasad Jayanti, Ranganath Kondapally Tight time-space tradeoff for mutual exclusion. Search on Bibsonomy STOC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein Multicast Routing for Energy Minimization Using Speed Scaling. Search on Bibsonomy MedAlg The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs Competitive Algorithms for Due Date Scheduling. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 216 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license