Fully abstract models for a process language with refinement. - Mogens Nielsen; Uffe Engberg; Kim S. Larsen (REX Workshop, 1988)

A New Formalism for Relational Algebra. - Kim S. Larsen; Michael I. Schwartzbach; Erik Meineche Schmidt (Inf. Process. Lett., 1992)

Bounds on Certain Multiplications of Affine Combinations. - Joan Boyar; Faith E. Fich; Kim S. Larsen (Discret. Appl. Math., 1994)

Efficient Rebalancing of Chromatic Search Trees. - Joan Boyar; Kim S. Larsen (J. Comput. Syst. Sci., 1994)

Injectivity of Composite Functions. - Kim S. Larsen; Michael I. Schwartzbach (J. Symb. Comput., 1994)

B-trees with relaxed balance. - Kim S. Larsen; Rolf Fagerberg (IPPS, 1995)

Efficient Simplification of Bisimulation Formulas. - Uffe Engberg; Kim S. Larsen (TACAS, 1995)

Efficient Rebalancing of B-Trees with Relaxed Balance. - Kim S. Larsen; Rolf Fagerberg (Int. J. Found. Comput. Sci., 1996)

Relaxed Balance through Standard Rotations. - Kim S. Larsen; Eljas Soisalon-Soininen; Peter Widmayer (WADS, 1997)

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. - Joan Boyar; Rolf Fagerberg; Kim S. Larsen (J. Comput. Syst. Sci., 1997)

Amortized Constant Relaxed Rebalancing Using Standard Rotations. - Kim S. Larsen (Acta Informatica, 1998)

Sort Order Problems in Relational Databases. - Kim S. Larsen (Int. J. Found. Comput. Sci., 1998)

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy. - Kim S. Larsen (Inf. Process. Lett., 1998)

Parametric Permutation Routing via Matchings. - Peter Høyer; Kim S. Larsen (Nord. J. Comput., 1998)

The Seat Reservation Problem. - Joan Boyar; Kim S. Larsen (Algorithmica, 1999)

Partially persistent search trees with transcript operations. - Kim S. Larsen (Discret. Math. Theor. Comput. Sci., 1999)

On Grouping in Relational Algebra. - Kim S. Larsen (Int. J. Found. Comput. Sci., 1999)

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. - Eric Bach 001; Joan Boyar; Tao Jiang 001; Kim S. Larsen; Guo-Hui Lin (COCOON, 2000)

Fair versus Unrestricted Bin Packing. - Yossi Azar; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen (SWAT, 2000)

AVL Trees with Relaxed Balance. - Kim S. Larsen (J. Comput. Syst. Sci., 2000)

Complexity of Layered Binary Search Trees with Relaxed Balance. - Lars Jacobsen; Kim S. Larsen (ICTCS, 2001)

Search Trees with Relaxed Balance and Near-Optimal Height. - Rolf Fagerberg; Rune E. Jensen; Kim S. Larsen (WADS, 2001)

Relaxed balance for search trees with local rebalancing. - Kim S. Larsen; Thomas Ottmann; Eljas Soisalon-Soininen (Acta Informatica, 2001)

Relaxed Balance Using Standard Rotations. - Kim S. Larsen; Eljas Soisalon-Soininen; Peter Widmayer (Algorithmica, 2001)

Variants of (A, B)-Trees with Relaxed Balance. - Lars Jacobsen; Kim S. Larsen (Int. J. Found. Comput. Sci., 2001)

The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen (Nord. J. Comput., 2001)

The Accommodating Function: A Generalization of the Competitive Ratio. - Joan Boyar; Kim S. Larsen; Morten N. Nielsen (SIAM J. Comput., 2001)

Packet Bundling. - Jens S. Frederiksen; Kim S. Larsen (SWAT, 2002)

Relaxed red-black trees with group updates. - Kim S. Larsen (Acta Informatica, 2002)

Fair versus Unrestricted Bin Packing. - Yossi Azar; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen; Leah Epstein (Algorithmica, 2002)

On the existence and construction of non-extreme (a, b)-trees. - Lars Jacobsen; Kim S. Larsen; Morten N. Nielsen (Inf. Process. Lett., 2002)

Online Seat Reservations via Offine Seating Arrangements. - Jens S. Frederiksen; Kim S. Larsen (WADS, 2003)

Extending the accommodating function. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen (Acta Informatica, 2003)

Dynamic TCP acknowledgment in the LogP model. - Jens S. Frederiksen; Kim S. Larsen; John Noga; Patchrawat Uthaisombut (J. Algorithms, 2003)

Relaxed multi-way trees with group updates. - Kim S. Larsen (J. Comput. Syst. Sci., 2003)

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. - Eric Bach 001; Joan Boyar; Leah Epstein; Lene M. Favrholdt; Tao Jiang 001; Kim S. Larsen; Guo-Hui Lin; Rob van Stee (J. Sched., 2003)

Priority Algorithms for Graph Optimization Problems. - Allan Borodin; Joan Boyar; Kim S. Larsen (WAOA, 2004)

Balanced Binary Search Trees. - Arne Andersson; Rolf Fagerberg; Kim S. Larsen (Handbook of Data Structures and Applications, 2004)

Exponentially decreasing number of operations in balanced trees. - Lars Jacobsen; Kim S. Larsen (Acta Informatica, 2005)

On-line seat reservations via off-line seating arrangements. - Jens S. Kohrt; Kim S. Larsen (Int. J. Found. Comput. Sci., 2005)

Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem. - Marco Chiarandini; Thomas Stützle; Kim S. Larsen (Hybrid Metaheuristics, 2006)

Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem. - Joan Boyar; Martin R. Ehmsen; Kim S. Larsen (WAOA, 2006)

The maximum resource bin packing problem. - Joan Boyar; Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt; Kim S. Larsen; Morten Monrad Pedersen; Sanne Wøhlk (Theor. Comput. Sci., 2006)

The relative worst-order ratio applied to paging. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (J. Comput. Syst. Sci., 2007)

A theoretical comparison of LRU and LRU-K. - Joan Boyar; Martin R. Ehmsen; Jens S. Kohrt; Kim S. Larsen (Acta Informatica, 2010)

Competitive analysis of the online inventory problem. - Kim S. Larsen; Sanne Wøhlk (Eur. J. Oper. Res., 2010)

Priority algorithms for graph optimization problems. - Allan Borodin; Joan Boyar; Kim S. Larsen; Nazanin Mirmohammadi (Theor. Comput. Sci., 2010)

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. - Joan Boyar; Sushmita Gupta; Kim S. Larsen (SWAT, 2012)

Online multi-coloring on the path revisited. - Marie G. Christ; Lene M. Favrholdt; Kim S. Larsen (Acta Informatica, 2013)

List Factoring and Relative Worst Order Analysis. - Martin R. Ehmsen; Jens S. Kohrt; Kim S. Larsen (Algorithmica, 2013)

A Technique for Exact Computation of precoloring Extension on Interval Graphs. - Martin R. Ehmsen; Kim S. Larsen (Int. J. Found. Comput. Sci., 2013)

Better bounds on online unit clustering. - Martin R. Ehmsen; Kim S. Larsen (Theor. Comput. Sci., 2013)

A comparison of performance measures via online search. - Joan Boyar; Kim S. Larsen; Abyayananda Maiti (Theor. Comput. Sci., 2014)

Online bin covering: Expectations vs. guarantees. - Marie G. Christ; Lene M. Favrholdt; Kim S. Larsen (Theor. Comput. Sci., 2014)

A Comparison of Performance Measures for Online Algorithms. - Joan Boyar; Sandy Irani; Kim S. Larsen (Algorithmica, 2015)

The Frequent Items Problem in Online Streaming Under Various Performance Measures. - Joan Boyar; Kim S. Larsen; Abyayananda Maiti (Int. J. Found. Comput. Sci., 2015)

Soccer is Harder Than Football. - Jan Christensen; Anders Nicolai Knudsen; Kim S. Larsen (Int. J. Found. Comput. Sci., 2015)

Relative interval analysis of paging algorithms on access graphs. - Joan Boyar; Sushmita Gupta; Kim S. Larsen (Theor. Comput. Sci., 2015)

Online multi-coloring with advice. - Marie G. Christ; Lene M. Favrholdt; Kim S. Larsen (Theor. Comput. Sci., 2015)

Vertical Optimization of Resource Dependent Flight Paths. - Anders Nicolai Knudsen; Marco Chiarandini; Kim S. Larsen (ECAI, 2016)

Online Bin Packing with Advice. - Joan Boyar; Shahin Kamali; Kim S. Larsen; Alejandro López-Ortiz (Algorithmica, 2016)

Online Algorithms with Advice: A Survey. - Joan Boyar; Lene M. Favrholdt; Christian Kudahl; Kim S. Larsen; Jesper W. Mikkelsen (SIGACT News, 2016)

Flight Planning in Free Route Airspaces. - Casper Kehlet Jensen; Marco Chiarandini; Kim S. Larsen (ATMOS, 2017)

Constraint Handling in Flight Planning. - Anders Nicolai Knudsen; Marco Chiarandini; Kim S. Larsen (CP, 2017)

The Paths to Choreography Extraction. - Luís Cruz-Filipe; Kim S. Larsen; Fabrizio Montesi (FoSSaCS, 2017)

How to Get More Out of Your Oracles. - Luís Cruz-Filipe; Kim S. Larsen; Peter Schneider-Kamp (ITP, 2017)

On the list update problem with advice. - Joan Boyar; Shahin Kamali; Kim S. Larsen; Alejandro López-Ortiz (Inf. Comput., 2017)

Formally Proving Size Optimality of Sorting Networks. - Luís Cruz-Filipe; Kim S. Larsen; Peter Schneider-Kamp (J. Autom. Reason., 2017)

Heuristic Variants of A ^* Search for 3D Flight Planning. - Anders Nicolai Knudsen; Marco Chiarandini; Kim S. Larsen (CPAIOR, 2018)

Batch Coloring of Graphs. - Joan Boyar; Leah Epstein; Lene M. Favrholdt; Kim S. Larsen; Asaf Levin (Algorithmica, 2018)

The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing. - Joan Boyar; Faith Ellen; Kim S. Larsen (CoRR, 2018)

DNA-templated synthesis optimization. - Bjarke N. Hansen; Kim S. Larsen; Daniel Merkle; Alexei Mihalchuk (Nat. Comput., 2018)

Online-bounded analysis. - Joan Boyar; Leah Epstein; Lene M. Favrholdt; Kim S. Larsen; Asaf Levin (J. Sched., 2018)

Online Dominating Set. - Joan Boyar; Stephan J. Eidenbenz; Lene M. Favrholdt; Michal Kotrbcík; Kim S. Larsen (Algorithmica, 2019)

Randomized distributed online algorithms against adaptive offline adversaries. - Joan Boyar; Faith Ellen; Kim S. Larsen (Inf. Process. Lett., 2020)

Advice Complexity of Priority Algorithms. - Allan Borodin; Joan Boyar; Kim S. Larsen; Denis Pankratov (Theory Comput. Syst., 2020)

Online Bin Covering with Advice. - Joan Boyar; Lene M. Favrholdt; Shahin Kamali; Kim S. Larsen (Algorithmica, 2021)

Online Unit Profit Knapsack with Untrusted Predictions. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (SWAT, 2022)

Relaxing the Irrevocability Requirement for Online Graph Algorithms. - Joan Boyar; Lene M. Favrholdt; Michal Kotrbcík; Kim S. Larsen (Algorithmica, 2022)

Implementing Choreography Extraction. - Luís Cruz-Filipe; Kim S. Larsen; Fabrizio Montesi; Larisa Safina (CoRR, 2022)

Relative Worst-order Analysis: A Survey. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (ACM Comput. Surv., 2022)

Paging with Succinct Predictions. - Antonios Antoniadis 001; Joan Boyar; Marek Eliás 001; Lene Monrad Favrholdt; Ruben Hoeksma; Kim S. Larsen; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Quotable Signatures for Authenticating Shared Quotes. - Joan Boyar; Simon Erfurth; Kim S. Larsen; Ruben Niederhagen (LATINCRYPT, 2023)

Online Minimum Spanning Trees with Weight Predictions. - Magnus Berg; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (WADS, 2023)

Online Interval Scheduling with Predictions. - Joan Boyar; Lene M. Favrholdt; Shahin Kamali; Kim S. Larsen (WADS, 2023)

On the Online Weighted Non-Crossing Matching Problem. - Joan Boyar; Shahin Kamali; Kim S. Larsen; Ali Mohammad Lavasani; Yaqiao Li; Denis Pankratov (SWAT, 2024)

Advice complexity of adaptive priority algorithms. - Joan Boyar; Kim S. Larsen; Denis Pankratov (Theor. Comput. Sci., 2024)

Online Unit Profit Knapsack with Predictions. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (Algorithmica, 2024)

Complexity Classes for Online Problems with and Without Predictions. - Magnus Berg; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (IJTCS-FAW, 2025)

Brief Announcement: Distributed Graph Algorithms with Predictions. - Joan Boyar; Faith Ellen; Kim S. Larsen (PODC, 2025)

Distributed Graph Algorithms with Predictions. - Joan Boyar; Faith Ellen; Kim S. Larsen (CoRR, 2025)