Kim S. Larsen

1. Relaxing the Irrevocability Requirement for Online Graph Algorithms
   2017/04/28 by Joan Boyar, Lene M. Favrholdt, Boyar, Joan +5 · 1 citation
   Computer Science · Decision Sciences · #68W27 #Auction Theory and Applications #Caching and Content Delivery #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
2. 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
3. Complexity Classes for Online Problems with and without Predictions
   2024/06/26 by Magnus Berg, Berg, Magnus, Joan Boyar +5 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Optimization and Search Problems