Epstein, Leah

1. A new and improved algorithm for online bin packing
   2017/07/06 by Balogh, János, Békési, József, Dósa, György +2 · 3 citations
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
2. Improved Bounds for Online Preemptive Matching
   2012/07/07 by Leah Epstein, Epstein, Leah, Asaf Levin +5 · 4 citations
   Computer Science · Decision Sciences · #05C70 #68R10 #Advanced Bandit Algorithms Research #Caching and Content Delivery #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.2 #Optimization and Search Problems
3. Online bin packing with cardinality constraints resolved
   2016/08/23 by Balogh, János, Békési, József, Dósa, György +2 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. A new lower bound for classic online bin packing
   2018/07/15 by Balogh, János, Békési, József, Dósa, György +2 · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
5. Several methods of analysis for cardinality constrained bin packing
   2021/07/19 by Epstein, Leah · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
6. Online Bounded Analysis
   2016/02/22 by Joan Boyar, Boyar, Joan, Leah Epstein +7 · 2 citations
   Computer Science · Decision Sciences · #Optimization and Search Problems #Auction Theory and Applications #Advanced Bandit Algorithms Research