The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Niv Buchbinder" ( http://dblp.L3S.de/Authors/Niv_Buchbinder )

  Author page on DBLP  Author page in RDF  Community of Niv Buchbinder in ASPL-2

Publication years (Num. hits)
2001-2008 (15) 2009-2011 (17) 2012 (2)
Publication types (Num. hits)
article(10) inproceedings(24)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15 occurrences of 11 keywords

Results
Found 34 publication records. Showing 34 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. Search on Bibsonomy IEEE/ACM Trans. Netw. 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, Niv Buchbinder, Aleksander Madry, Joseph Naor A Polylogarithmic-Competitive Algorithm for the k-Server Problem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Niv Buchbinder, Navendu Jain, Ishai Menache Online Job-Migration for Reducing the Electricity Bill in the Cloud. Search on Bibsonomy Networking The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor Frequency Capping in Online Advertising. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor A Polylogarithmic-Competitive Algorithm for the k-Server Problem. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda Non-Cooperative Cost Sharing Games via Subsidies. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yossi Azar, Niv Buchbinder, Kamal Jain How to Allocate Goods in an Online Market? Search on Bibsonomy ESA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  BibTeX  RDF
1Niv Buchbinder, Kamal Jain, Mohit Singh Incentives in Online Auctions via Linear Programming. Search on Bibsonomy WINE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor Metrical Task Systems and the k-Server Problem on HSTs. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. Search on Bibsonomy INFOCOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Kamal Jain, Mohit Singh Secretary Problems via Linear Programming. Search on Bibsonomy IPCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton A Regularization Approach to Metrical Task Systems. Search on Bibsonomy ALT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Joseph Naor The Design of Competitive Online Algorithms via a Primal-Dual Approach. Search on Bibsonomy Foundations and Trends in Theoretical Computer Science The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Joseph Naor Online Primal-Dual Algorithms for Covering and Packing. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Kamal Jain, Mohit Singh Secretary problems and incentives via linear programming. Search on Bibsonomy SIGecom Exchanges The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor The Online Set Cover Problem. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. Search on Bibsonomy INFOCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko Online make-to-order joint replenishment model: primal dual competitive algorithms. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda Non-cooperative Cost Sharing Games Via Subsidies. Search on Bibsonomy SAGT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor Randomized competitive algorithms for generalized caching. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF arbitrary sizes, arbitrary weights, knapsack cover inequalities, primal-dual analysis, caching, online algorithms
1Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Kamal Jain, Joseph Naor Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor A Primal-Dual Randomized Algorithm for Weighted Paging. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Erez Petrank Lower and upper bounds on obtaining history independence. Search on Bibsonomy Inf. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor A general approach to online network optimization problems. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding
1Niv Buchbinder, Joseph Naor Fair online load balancing. Search on Bibsonomy SPAA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF scheduling, load balancing, online algorithms, competitive analysis, greedy algorithm
1Niv Buchbinder, Joseph Naor Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Joseph Naor Online Primal-Dual Algorithms for Covering and Packing Problems. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor A general approach to online network optimization problems. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Erez Petrank Lower and Upper Bounds on Obtaining History Independence. Search on Bibsonomy CRYPTO The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor The online set cover problem. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF competitive analysis, on-line algorithms, set-cover, derandomization, randomized rounding
1Katherine Barabash, Niv Buchbinder, Tamar Domani, Elliot K. Kolodner, Yoav Ossia, Shlomit S. Pinter, Janice C. Shepherd, Ron Sivan, Victor Umansky Mostly Accurate Stack Scanning. Search on Bibsonomy Java™ Virtual Machine Research and Technology Symposium The full citation details ... 2001 DBLP  BibTeX  RDF
Displaying result #1 - #34 of 34 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.