vix.ing · top · new · best · stats · spec

Feldman, Moran

  1. Online Contention Resolution Schemes
    2015/08/01 by Feldman, Moran, Svensson, Ola, Zenklusen, Rico · 6 citations
    #68R05 (Secondary) #68W27 (Primary) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.1
  2. The Submodular Secretary Problem Goes Linear
    2015/07/30 by Moran Feldman, Rico Zenklusen, Feldman, Moran +1 · 1 voice · 1 citation
    #cs.DS #cs.DM
  3. O(depth)-Competitive Algorithm for Online Multi-level Aggregation
    2017/01/08 by Niv Buchbinder, Moran Feldman, Buchbinder, Niv +5 · 3 citations
    Computer Science · Business, Management and Accounting · Engineering · #Optimization and Search Problems #Facility Location and Emergency Management #Vehicle Routing Optimization Methods
  4. The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness
    2020/03/30 by Moran Feldman, Feldman, Moran, Ashkan Norouzi-Fard +5 · 3 citations
    Computer Science · #68Q25 (Secondary) #68R05 (Primary) 68W27 #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.1
  5. A Simple O(\log\log(\rank))-Competitive Algorithm for the\n Matroid Secretary Problem
    2014/04/17 by Moran Feldman, Ola Svensson, Feldman, Moran +3 · 2 citations
    Computer Science · #Optimization and Search Problems #Complexity and Algorithms in Graphs #Cryptography and Data Security
  6. Constrained Submodular Maximization via New Bounds for DR-Submodular Functions
    2023/11/02 by Buchbinder, Niv, Feldman, Moran · 5 citations
    #68W25 (Secondary) #90C27 (Primary) 90C26 #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.1
  7. Online Submodular Maximization with Preemption
    2015/01/23 by Buchbinder, Niv, Feldman, Moran, Schwartz, Roy · 2 citations
    #68R05 #68W27 #68W40 #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.1
  8. Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications
    2019/04/19 by Christopher Harshaw, Harshaw, Christopher, Moran Feldman +5 · 2 citations
    Computer Science · Engineering · Mathematics · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Low-power high-performance VLSI design #Machine Learning (cs.LG) #Markov Chains and Monte Carlo Methods #Optimization and Control (math.OC)
  9. Online Submodular Maximization: Beating 1/2 Made Simple
    2018/07/15 by Niv Buchbinder, Buchbinder, Niv, Moran Feldman +4 · 2 citations
    Business, Management and Accounting · Computer Science · Decision Sciences · #68W27 #Auction Theory and Applications #Consumer Market Behavior and Pricing #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
  10. Streaming Submodular Maximization under Matroid Constraints
    2021/07/15 by Feldman, Moran, Liu, Paul, Norouzi-Fard, Ashkan +2 · 2 citations
    #68Q11 (Secondary) #68W27 (Primary) 68R05 #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.1
  11. Constrained Submodular Maximization via a Non-symmetric Technique
    2016/11/10 by Niv Buchbinder, Buchbinder, Niv, Moran Feldman +1 · 3 citations
    Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Computational Geometry and Mesh Generation
  12. A Framework for the Secretary Problem on the Intersection of Matroids
    2017/04/09 by Feldman, Moran, Svensson, Ola, Zenklusen, Rico · 1 citation
    #68W27 (Primary) 68R05 #68W40 (Secondary) #Data Structures and Algorithms (cs.DS) #F.1.2 #F.2.2 #FOS: Computer and information sciences
  13. Streaming Weak Submodularity: Interpreting Neural Networks on the Fly
    2017/03/08 by Ethan R. Elenberg, Elenberg, Ethan R., Alexandros G. Dimakis +5 · 1 citation
    Computer Science · #Adversarial Robustness in Machine Learning #FOS: Computer and information sciences #Information Theory (cs.IT) #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and Algorithms #Stochastic Gradient Optimization Techniques
  14. Do Less, Get More: Streaming Submodular Maximization with Subsampling
    2018/02/20 by Feldman, Moran, Karbasi, Amin, Kazemi, Ehsan · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
  15. Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid
    2018/07/15 by Buchbinder, Niv, Feldman, Moran, Garg, Mohit · 1 citation
    #68W25 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  16. Guess Free Maximization of Submodular and Linear Sums
    2018/10/09 by Feldman, Moran · 1 citation
    #68R05 (Secondary) #68W25 (Primary) 90C27 #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.1
  17. Unconstrained Submodular Maximization with Constant Adaptive Complexity
    2018/11/15 by Chen, Lin, Feldman, Moran, Karbasi, Amin · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
  18. Submodular Maximization in Clean Linear Time
    2020/06/16 by Li, Wenxin, Feldman, Moran, Kazemi, Ehsan +1 · 1 citation
    #68R05 (Secondary) #90C27 (Primary) 68Q32 #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.1 #I.2.6 #Machine Learning (cs.LG)
  19. Gödel Test: Can Large Language Models Solve Easy Conjectures?
    2025/09/22 by Moran Feldman, Amin Karbasi, Feldman, Moran +1 · 1 voice · 5 citations
    Computer Science · #Artificial Intelligence (cs.AI) #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning and Algorithms
  20. Mechanism Design with Strategic Mediators
    2015/01/19 by Babaioff, Moshe, Feldman, Moran, Tennenholtz, Moshe · 1 citation
    #68R05 #68W20 #68W25 #91A40 #91A46 #Computer Science and Game Theory (cs.GT) #F.2.2 #FOS: Computer and information sciences #G.2.1 #K.4
  21. Submodular Maximization Subject to Matroid Intersection on the Fly
    2022/04/11 by Feldman, Moran, Norouzi-Fard, Ashkan, Svensson, Ola +1 · 1 citation
    #68Q25 #68R05 (Primary) 68W27 #90C27 (Secondary) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.1
  22. Using Partial Monotonicity in Submodular Maximization
    2022/02/07 by Mualem, Loay, Feldman, Moran · 1 citation
    #68R05 (Primary) 90C26 #68T20 #68W40 (Secondary) #90C20 #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #I.2.m #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Optimization and Control (math.OC)
  23. Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
    2024/08/07 by Buchbinder, Niv, Feldman, Moran · 1 citation
    #68W25 (Secondary) #90C27 (Primary) 68W05 #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.1