Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Niv
    Last name: Buchbinder
    DBLP: 48/4123
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 65 of 65  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia.
    Fair Coin Flipping: Tighter Analysis and the Many-Party Case.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Niv Buchbinder, Roy Schwartz, Baruch Weizman.
    Simplex Transformations and the Multiway Cut Problem.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon.
    O(depth)-Competitive Algorithm for Online Multi-level Aggregation.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Niv Buchbinder, Moran Feldman.
    Deterministic Algorithms for Submodular Maximization Problems.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Yossi Azar, Niv Buchbinder, Kamal Jain.
    How to Allocate Goods in an Online Market?
    Algorithmica 2016, Volume 74 (0) 2016
    Conference paper
    Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir.
    Unified Algorithms for Online Learning and Competitive Analysis.
    Math. Oper. Res. 2016, Volume 41 (0) 2016
    Conference paper
    Niv Buchbinder, Moran Feldman.
    Constrained Submodular Maximization via a Non-symmetric Technique.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang 0002, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi.
    Online Algorithms for Covering and Packing Problems with Convex Objectives.
    IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA 2016 (0) 2016
    Conference paper
    Niv Buchbinder, Moran Feldman, Roy Schwartz.
    Online Submodular Maximization with Preemption.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Conference paper
    Niv Buchbinder, Moran Feldman, Roy Schwartz.
    Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Conference paper
    Niv Buchbinder, Moran Feldman, Roy Schwartz.
    Online Submodular Maximization with Preemption.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Niv Buchbinder, Rica Gonen.
    Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach.
    Algorithmica 2015, Volume 72 (0) 2015
    Journal article
    Niv Buchbinder, Moran Feldman.
    Deterministic Algorithms for Submodular Maximization Problems.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor.
    A Polylogarithmic-Competitive Algorithm for the
    J. ACM 2015, Volume 62 (0) 2015
    Conference paper
    Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz.
    A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization.
    SIAM J. Comput. 2015, Volume 44 (0) 2015
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor.
    A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching.
    Algorithmica 2014, Volume 68 (0) 2014
    Conference paper
    Niv Buchbinder, Shahar Chen, Joseph Naor.
    Competitive Analysis via Regularization.
    Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 2014 (0) 2014
    Conference paper
    Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz.
    Submodular Maximization with Cardinality Constraints.
    Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 2014 (0) 2014
    Conference paper
    Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor.
    Frequency capping in online advertising.
    J. Scheduling 2014, Volume 17 (0) 2014
    Journal article
    Niv Buchbinder, Kamal Jain, Mohit Singh.
    Secretary Problems via Linear Programming.
    Math. Oper. Res. 2014, Volume 39 (0) 2014
    Conference paper
    Niv Buchbinder, Shahar Chen, Joseph Naor.
    Competitive Algorithms for Restricted Caching and Matroid Caching.
    Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings 2014 (0) 2014
    Journal article
    Niv Buchbinder, Moran Feldman, Roy Schwartz.
    Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor.
    Online Packing and Covering Framework with Convex Objectives.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Niv Buchbinder, Joseph Naor.
    Fair online load balancing.
    J. Scheduling 2013, Volume 16 (0) 2013
    Conference paper
    Niv Buchbinder, Joseph Naor, Roy Schwartz.
    Simplex partitioning via exponential clocks and the multiway cut problem.
    Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013 2013 (0) 2013
    Conference paper
    Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko.
    Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms.
    Operations Research 2013, Volume 61 (0) 2013
    Conference paper
    Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda.
    Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach.
    IEEE/ACM Trans. Netw. 2012, Volume 20 (0) 2012
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Joseph Naor.
    Randomized Competitive Algorithms for Generalized Caching.
    SIAM J. Comput. 2012, Volume 41 (0) 2012
    Conference paper
    Niv Buchbinder, Joseph Naor, R. Ravi 0001, Mohit Singh.
    Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012 (0) 2012
    Conference paper
    Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh.
    Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir.
    Unified Algorithms for Online Learning and Competitive Analysis.
    COLT 2012 - The 25th Annual Conference on Learning Theory, June 25-27, 2012, Edinburgh, Scotland 2012 (0) 2012
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Joseph Naor.
    A Primal-Dual Randomized Algorithm for Weighted Paging.
    J. ACM 2012, Volume 59 (0) 2012
    Conference paper
    Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz.
    A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization.
    53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012 2012 (0) 2012
    Conference paper
    Niv Buchbinder, Navendu Jain, Ishai Menache.
    Online Job-Migration for Reducing the Electricity Bill in the Cloud.
    NETWORKING 2011 - 10th International IFIP TC 6 Networking Conference, Valencia, Spain, May 9-13, 2011, Proceedings, Part I 2011 (0) 2011
    Conference paper
    Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor.
    Frequency Capping in Online Advertising.
    Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor.
    A Polylogarithmic-Competitive Algorithm for the k-Server Problem
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor.
    A Polylogarithmic-Competitive Algorithm for the k-Server Problem.
    IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 2011 (0) 2011
    Conference paper
    Niv Buchbinder, Kamal Jain, Mohit Singh.
    Secretary Problems via Linear Programming.
    Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Joseph Naor.
    Metrical Task Systems and the
    Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I 2010 (0) 2010
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Joseph Naor.
    Towards the Randomized k-Server Conjecture: A Primal-Dual Approach.
    Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010 (0) 2010
    Conference paper
    Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda.
    Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case.
    INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 15-19 March 2010, San Diego, CA, USA 2010 (0) 2010
    Conference paper
    Jacob D. Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton.
    A Regularization Approach to Metrical Task Systems.
    Algorithmic Learning Theory, 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Yossi Azar, Niv Buchbinder, Kamal Jain.
    How to Allocate Goods in an Online Market?
    Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II 2010 (0) 2010
    Conference paper
    Niv Buchbinder, Kamal Jain, Mohit Singh.
    Incentives in Online Auctions via Linear Programming.
    Internet and Network Economics - 6th International Workshop, WINE 2010, Stanford, CA, USA, December 13-17, 2010. Proceedings 2010 (0) 2010
    Journal article
    Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda.
    Non-Cooperative Cost Sharing Games via Subsidies.
    Theory Comput. Syst. 2010, Volume 47 (0) 2010
    Conference paper
    Niv Buchbinder, Kamal Jain, Mohit Singh.
    Secretary problems and incentives via linear programming.
    SIGecom Exchanges 2009, Volume 8 (0) 2009
    Conference paper
    Niv Buchbinder, Joseph Naor.
    Online Primal-Dual Algorithms for Covering and Packing.
    Math. Oper. Res. 2009, Volume 34 (0) 2009
    Conference paper
    Niv Buchbinder, Joseph Naor.
    The Design of Competitive Online Algorithms via a Primal-Dual Approach.
    Foundations and Trends in Theoretical Computer Science 2008, Volume 3 (0) 2009
    Journal article
    Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor.
    The Online Set Cover Problem.
    SIAM J. Comput. 2009, Volume 39 (0) 2009
    Conference paper
    Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda.
    Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach.
    INFOCOM 2009. 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 19-25 April 2009, Rio de Janeiro, Brazil 2009 (0) 2009
    Conference paper
    Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko.
    Online make-to-order joint replenishment model: primal dual competitive algorithms.
    Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008 2008 (0) 2008
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Joseph Naor.
    Randomized competitive algorithms for generalized caching.
    Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 2008 (0) 2008
    Conference paper
    Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda.
    Non-cooperative Cost Sharing Games Via Subsidies.
    Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor.
    An
    Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Niv Buchbinder, Kamal Jain, Joseph Naor.
    Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue.
    Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Joseph Naor.
    A Primal-Dual Randomized Algorithm for Weighted Paging.
    48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings 2007 (0) 2007
    Conference paper
    Niv Buchbinder, Joseph Naor.
    Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach.
    47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings 2006 (0) 2006
    Conference paper
    Niv Buchbinder, Joseph Naor.
    Fair online load balancing.
    SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006 2006 (0) 2006
    Conference paper
    Niv Buchbinder, Erez Petrank.
    Lower and upper bounds on obtaining history independence.
    Inf. Comput. 2006, Volume 204 (0) 2006
    Conference paper
    Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor.
    A general approach to online network optimization problems.
    ACM Transactions on Algorithms 2006, Volume 2 (0) 2006
    Conference paper
    Niv Buchbinder, Joseph Naor.
    Online Primal-Dual Algorithms for Covering and Packing Problems.
    Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor.
    A general approach to online network optimization problems.
    Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004 (0) 2004
    Conference paper
    Niv Buchbinder, Erez Petrank.
    Lower and Upper Bounds on Obtaining History Independence.
    Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor.
    The online set cover problem.
    Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA 2003 (0) 2003
    Conference paper
    Katherine Barabash, Niv Buchbinder, Tamar Domani, Elliot K. Kolodner, Yoav Ossia, Shlomit S. Pinter, Janice C. Shepherd, Ron Sivan, Victor Umansky.
    Mostly Accurate Stack Scanning.
    Proceedings of the 1st Java Virtual Machine Research and Technology Symposium, April 23-24, 2001, Monterey, CA, USA 2001 (0) 2001
    Show item 1 to 65 of 65  

    Your query returned 65 matches in the database.