Kim S. Larsen

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 52

Top Venues

Publications

Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov
On the Online Weighted Non-Crossing Matching Problem. SWAT (2024)
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Complexity Classes for Online Problems with and without Predictions. CoRR (2024)
Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice complexity of adaptive priority algorithms. Theor. Comput. Sci. 984 (2024)
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Minimum Spanning Trees with Weight Predictions. WADS (2023)
Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen
Quotable Signatures for Authenticating Shared Quotes. LATINCRYPT (2023)
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
Paging with Succinct Predictions. ICML (2023)
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Minimum Spanning Trees with Weight Predictions. CoRR (2023)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Interval Scheduling with Predictions. CoRR (2023)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Interval Scheduling with Predictions. WADS (2023)
Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi, Larisa Safina
Implementing Choreography Extraction. CoRR (2022)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Unit Profit Knapsack with Untrusted Predictions. CoRR (2022)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Unit Profit Knapsack with Untrusted Predictions. SWAT (2022)
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Relaxing the Irrevocability Requirement for Online Graph Algorithms. Algorithmica 84 (7) (2022)
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
Paging with Succinct Predictions. CoRR (2022)
Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen
Quotable Signatures for Authenticating Shared Quotes. CoRR (2022)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Relative Worst-order Analysis: A Survey. ACM Comput. Surv. 54 (1) (2021)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Bin Covering with Advice. Algorithmica 83 (3) (2021)
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice Complexity of Priority Algorithms. Theory Comput. Syst. 64 (4) (2020)
Joan Boyar, Faith Ellen, Kim S. Larsen
Randomized distributed online algorithms against adaptive offline adversaries. Inf. Process. Lett. 161 (2020)
Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice Complexity of Adaptive Priority Algorithms. CoRR (2019)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Bin Covering with Advice. CoRR (2019)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Bin Covering with Advice. WADS (2019)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. Algorithmica 81 (5) (2019)
Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen
Heuristic Variants of A ^* Search for 3D Flight Planning. CPAIOR (2018)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Relative Worst-Order Analysis: A Survey. Adventures Between Lower Bounds and Higher Altitudes (2018)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online-bounded analysis. J. Sched. 21 (4) (2018)
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice Complexity of Priority Algorithms. CoRR (2018)
Joan Boyar, Faith Ellen, Kim S. Larsen
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing. CoRR (2018)
Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk
DNA-templated synthesis optimization. Nat. Comput. 17 (4) (2018)
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice Complexity of Priority Algorithms. WAOA (2018)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. Algorithmica 80 (11) (2018)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Relative Worst-Order Analysis: A Survey. CoRR (2018)
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Relaxing the Irrevocability Requirement for Online Graph Algorithms. WADS (2017)
Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen
Constraint Handling in Flight Planning. CP (2017)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
Online Algorithms with Advice: A Survey. ACM Comput. Surv. 50 (2) (2017)
Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp
How to Get More Out of Your Oracles. ITP (2017)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík
Relaxing the Irrevocability Requirement for Online Graph Algorithms. CoRR (2017)
Casper Kehlet Jensen, Marco Chiarandini, Kim S. Larsen
Flight Planning in Free Route Airspaces. ATMOS (2017)
Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi
The Paths to Choreography Extraction. FoSSaCS (2017)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
On the list update problem with advice. Inf. Comput. 253 (2017)
Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp
Formally Proving Size Optimality of Sorting Networks. J. Autom. Reason. 59 (4) (2017)
Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk
DNA-Templated Synthesis Optimization. DNA (2017)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
Online Bin Packing with Advice. Algorithmica 74 (1) (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CoRR (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CSR (2016)
Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi
The Paths to Choreography Extraction. CoRR (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. WAOA (2016)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. CoRR (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. CoRR (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
Online Algorithms with Advice: A Survey. SIGACT News 47 (3) (2016)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. SWAT (2016)
Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen
Vertical Optimization of Resource Dependent Flight Paths. ECAI (2016)
Joan Boyar, Sandy Irani, Kim S. Larsen
A Comparison of Performance Measures for Online Algorithms. Algorithmica 72 (4) (2015)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
The Frequent Items Problem in Online Streaming Under Various Performance Measures. Int. J. Found. Comput. Sci. 26 (4) (2015)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Relative interval analysis of paging algorithms on access graphs. Theor. Comput. Sci. 568 (2015)
Jan Christensen, Anders Nicolai Knudsen, Kim S. Larsen
Soccer is Harder Than Football. Int. J. Found. Comput. Sci. 26 (4) (2015)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online multi-coloring with advice. Theor. Comput. Sci. 596 (2015)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
A comparison of performance measures via online search. Theor. Comput. Sci. 532 (2014)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online Multi-Coloring with Advice. CoRR (2014)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
Online Bin Packing with Advice. STACS (2014)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online bin covering: Expectations vs. guarantees. Theor. Comput. Sci. 556 (2014)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online Multi-Coloring with Advice. WAOA (2014)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
On the List Update Problem with Advice. LATA (2014)
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
List Factoring and Relative Worst Order Analysis. Algorithmica 66 (2) (2013)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
The Frequent Items Problem in Online Streaming under Various Performance Measures. FCT (2013)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
The Frequent Items Problem in Online Streaming under Various Performance Measures. CoRR (2013)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online Bin Covering: Expectations vs. Guarantees. CoRR (2013)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Relative Interval Analysis of Paging Algorithms on Access Graphs. WADS (2013)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online Bin Covering: Expectations vs. Guarantees. COCOA (2013)
Martin R. Ehmsen, Kim S. Larsen
Better bounds on online unit clustering. Theor. Comput. Sci. 500 (2013)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Relative Interval Analysis of Paging Algorithms on Access Graphs CoRR (2013)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online multi-coloring on the path revisited. Acta Informatica 50 (5-6) (2013)
Martin R. Ehmsen, Kim S. Larsen
A Technique for Exact Computation of precoloring Extension on Interval Graphs. Int. J. Found. Comput. Sci. 24 (1) (2013)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
On the List Update Problem with Advice. CoRR (2013)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
A Comparison of Performance Measures via Online Search. FAW-AAIM (2012)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis CoRR (2012)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. SWAT (2012)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
Online Bin Packing with Advice CoRR (2012)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
A Comparison of Performance Measures via Online Search CoRR (2011)
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
List Factoring and Relative Worst Order Analysis CoRR (2010)
Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi
Priority algorithms for graph optimization problems. Theor. Comput. Sci. 411 (1) (2010)
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
A theoretical comparison of LRU and LRU-K. Acta Informatica 47 (7-8) (2010)
Martin R. Ehmsen, Kim S. Larsen
Better Bounds on Online Unit Clustering. SWAT (2010)
Kim S. Larsen, Sanne Wøhlk
Competitive analysis of the online inventory problem. Eur. J. Oper. Res. 207 (2) (2010)
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
List Factoring and Relative Worst Order Analysis. WAOA (2010)
Joan Boyar, Sandy Irani, Kim S. Larsen
A Comparison of Performance Measures for Online Algorithms. WADS (2009)
Joan Boyar, Sandy Irani, Kim S. Larsen
A Comparison of Performance Measures for Online Algorithms CoRR (2008)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
The relative worst-order ratio applied to paging. J. Comput. Syst. Sci. 73 (5) (2007)
Joan Boyar, Martin R. Ehmsen, Kim S. Larsen
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem. WAOA (2006)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
The maximum resource bin packing problem. Theor. Comput. Sci. 362 (1-3) (2006)
Marco Chiarandini, Thomas Stützle, Kim S. Larsen
Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem. Hybrid Metaheuristics (2006)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
The Maximum Resource Bin Packing Problem. FCT (2005)
Jens S. Kohrt, Kim S. Larsen
On-line seat reservations via off-line seating arrangements. Int. J. Found. Comput. Sci. 16 (2) (2005)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
The relative worst order ratio applied to paging. SODA (2005)
Lars Jacobsen, Kim S. Larsen
Exponentially decreasing number of operations in balanced trees. Acta Informatica 42 (1) (2005)
Allan Borodin, Joan Boyar, Kim S. Larsen
Priority Algorithms for Graph Optimization Problems. WAOA (2004)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
Extending the accommodating function. Acta Informatica 40 (1) (2003)
Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. J. Sched. 6 (2) (2003)
Kim S. Larsen
Relaxed multi-way trees with group updates. J. Comput. Syst. Sci. 66 (4) (2003)
Jens S. Frederiksen, Kim S. Larsen
Online Seat Reservations via Offine Seating Arrangements. WADS (2003)

Kim S. Larsen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kim S. Larsen