We stand with Ukraine

We stand with Ukraine

Kim S. Larsen

Orcid: 0000-0003-0560-3794

According to our database¹, Kim S. Larsen authored at least 86 papers between 1988 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org
on imada.sdu.dk

On csauthors.net:

Bibliography

2024

Advice complexity of adaptive priority algorithms.

[BibT_eX]

[DOI]

,

,

Denis Pankratov

Theor. Comput. Sci., February, 2024

2023

Online Interval Scheduling with Predictions.

[BibT_eX]

[DOI]

,

Lene M. Favrholdt

,

,

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Online Minimum Spanning Trees with Weight Predictions.

[BibT_eX]

[DOI]

,

,

Lene M. Favrholdt

,

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Quotable Signatures for Authenticating Shared Quotes.

[BibT_eX]

[DOI]

,

,

,

Ruben Niederhagen

Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

Paging with Succinct Predictions.

[BibT_eX]

[DOI]

Antonios Antoniadis

,

,

,

Lene Monrad Favrholdt

,

,

,

,

Proceedings of the International Conference on Machine Learning, 2023

2022

Relative Worst-order Analysis: A Survey.

[BibT_eX]

[DOI]

,

Lene M. Favrholdt

,

ACM Comput. Surv., 2022

Implementing Choreography Extraction.

[BibT_eX]

[DOI]

Luís Cruz-Filipe

,

,

Fabrizio Montesi

,

CoRR, 2022

Relaxing the Irrevocability Requirement for Online Graph Algorithms.

[BibT_eX]

[DOI]

,

Lene M. Favrholdt

,

Michal Kotrbcík

,

Algorithmica, 2022

Online Unit Profit Knapsack with Untrusted Predictions.

[BibT_eX]

[DOI]

,

Lene M. Favrholdt

,

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

Online Bin Covering with Advice.

[BibT_eX]

[DOI]

,

Lene M. Favrholdt

,

,

Algorithmica, 2021

2020

Advice Complexity of Priority Algorithms.

[BibT_eX]

[DOI]

,

,

,

Denis Pankratov

Theory Comput. Syst., 2020

Randomized distributed online algorithms against adaptive offline adversaries.

[BibT_eX]

[DOI]

,

,

Inf. Process. Lett., 2020

2019

Online Dominating Set.

[BibT_eX]

[DOI]

,

Stephan J. Eidenbenz

,

Lene M. Favrholdt

,

Michal Kotrbcík

,

Algorithmica, 2019

2018

Online-bounded analysis.

[BibT_eX]

[DOI]

,

,

Lene M. Favrholdt

,

,

J. Sched., 2018

DNA-templated synthesis optimization.

[BibT_eX]

[DOI]

Bjarke N. Hansen

,

,

,

Alexei Mihalchuk

Nat. Comput., 2018

The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing.

[BibT_eX]

[DOI]

,

,

CoRR, 2018

Batch Coloring of Graphs.

[BibT_eX]

[DOI]

,

,

Lene M. Favrholdt

,

,

Algorithmica, 2018

Heuristic Variants of A ^* Search for 3D Flight Planning.

[BibT_eX]

[DOI]

Anders Nicolai Knudsen

,

Marco Chiarandini

,

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017

Formally Proving Size Optimality of Sorting Networks.

[BibT_eX]

[DOI]

Luís Cruz-Filipe

,

,

Peter Schneider-Kamp

J. Autom. Reason., 2017

On the list update problem with advice.

[BibT_eX]

[DOI]

,

,

,

Alejandro López-Ortiz

Inf. Comput., 2017

Online Algorithms with Advice: A Survey.

[BibT_eX]

[DOI]

,

Lene M. Favrholdt

,

Christian Kudahl

,

,

Jesper W. Mikkelsen

ACM Comput. Surv., 2017

How to Get More Out of Your Oracles.

[BibT_eX]

[DOI]

Luís Cruz-Filipe

,

,

Peter Schneider-Kamp

Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

The Paths to Choreography Extraction.

[BibT_eX]

[DOI]

Luís Cruz-Filipe

,

,

Fabrizio Montesi

Proceedings of the Foundations of Software Science and Computation Structures, 2017

Constraint Handling in Flight Planning.

[BibT_eX]

[DOI]

Anders Nicolai Knudsen

,

Marco Chiarandini

,

Proceedings of the Principles and Practice of Constraint Programming, 2017

Flight Planning in Free Route Airspaces.

[BibT_eX]

[DOI]

Casper Kehlet Jensen

,

Marco Chiarandini

,

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016

Online Bin Packing with Advice.

[BibT_eX]

[DOI]

,

,

,

Alejandro López-Ortiz

Algorithmica, 2016

Vertical Optimization of Resource Dependent Flight Paths.

[BibT_eX]

[DOI]

Anders Nicolai Knudsen

,

Marco Chiarandini

,

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

Online multi-coloring with advice.

[BibT_eX]

[DOI]

Marie G. Christ

,

Lene M. Favrholdt

,

Theor. Comput. Sci., 2015

Relative interval analysis of paging algorithms on access graphs.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2015

Soccer is Harder Than Football.

[BibT_eX]

[DOI]

Jan Christensen

,

Anders Nicolai Knudsen

,

Int. J. Found. Comput. Sci., 2015

The Frequent Items Problem in Online Streaming Under Various Performance Measures.

[BibT_eX]

[DOI]

,

,

Abyayananda Maiti

Int. J. Found. Comput. Sci., 2015

A Comparison of Performance Measures for Online Algorithms.

[BibT_eX]

[DOI]

,

,

Algorithmica, 2015

2014

Online bin covering: Expectations vs. guarantees.

[BibT_eX]

[DOI]

Marie G. Christ

,

Lene M. Favrholdt

,

Theor. Comput. Sci., 2014

A comparison of performance measures via online search.

[BibT_eX]

[DOI]

,

,

Abyayananda Maiti

Theor. Comput. Sci., 2014

2013

Better bounds on online unit clustering.

[BibT_eX]

[DOI]

Martin R. Ehmsen

,

Theor. Comput. Sci., 2013

A Technique for Exact Computation of precoloring Extension on Interval Graphs.

[BibT_eX]

[DOI]

Martin R. Ehmsen

,

Int. J. Found. Comput. Sci., 2013

List Factoring and Relative Worst Order Analysis.

[BibT_eX]

[DOI]

Martin R. Ehmsen

,

,

Algorithmica, 2013

Online multi-coloring on the path revisited.

[BibT_eX]

[DOI]

Marie G. Christ

,

Lene M. Favrholdt

,

Acta Informatica, 2013

2012

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.

[BibT_eX]

[DOI]

,

,

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2010

Priority algorithms for graph optimization problems.

[BibT_eX]

[DOI]

,

,

,

Nazanin Mirmohammadi

Theor. Comput. Sci., 2010

Competitive analysis of the online inventory problem.

[BibT_eX]

[DOI]

,

Eur. J. Oper. Res., 2010

A theoretical comparison of LRU and LRU-K.

[BibT_eX]

[DOI]

,

Martin R. Ehmsen

,

,

Acta Informatica, 2010

2007

The relative worst-order ratio applied to paging.

[BibT_eX]

[DOI]

,

Lene M. Favrholdt

,

J. Comput. Syst. Sci., 2007

2006

The maximum resource bin packing problem.

[BibT_eX]

[DOI]

,

,

Lene M. Favrholdt

,

,

,

Morten Monrad Pedersen

,

Theor. Comput. Sci., 2006

Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.

[BibT_eX]

[DOI]

,

Martin R. Ehmsen

,

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem.

[BibT_eX]

[DOI]

Marco Chiarandini

,

Thomas Stützle

,

Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006

2005

On-line seat reservations via off-line seating arrangements.

[BibT_eX]

[DOI]

,

Int. J. Found. Comput. Sci., 2005

Exponentially decreasing number of operations in balanced trees.

[BibT_eX]

[DOI]

,

Acta Informatica, 2005

2004

Balanced Binary Search Trees.

[BibT_eX]

[DOI]

,

,

Proceedings of the Handbook of Data Structures and Applications., 2004

Priority Algorithms for Graph Optimization Problems.

[BibT_eX]

[DOI]

,

,

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2003

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.

[BibT_eX]

[DOI]

,

,

,

Lene M. Favrholdt

,

,

,

,

J. Sched., 2003

Relaxed multi-way trees with group updates.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Dynamic TCP acknowledgment in the LogP model.

[BibT_eX]

[DOI]

Jens S. Frederiksen

,

,

,

Patchrawat Uthaisombut

J. Algorithms, 2003

Extending the accommodating function.

[BibT_eX]

[DOI]

,

Lene M. Favrholdt

,

,

Morten N. Nielsen

Acta Informatica, 2003

Online Seat Reservations via Offine Seating Arrangements.

[BibT_eX]

[DOI]

Jens S. Frederiksen

,

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002

On the existence and construction of non-extreme (a, b)-trees.

[BibT_eX]

[DOI]

,

,

Morten N. Nielsen

Inf. Process. Lett., 2002

Fair versus Unrestricted Bin Packing.

[BibT_eX]

[DOI]

,

,

Lene M. Favrholdt

,

,

Morten N. Nielsen

,

Algorithmica, 2002

Relaxed red-black trees with group updates.

[BibT_eX]

[DOI]

Acta Informatica, 2002

Packet Bundling.

[BibT_eX]

[DOI]

Jens S. Frederiksen

,

Proceedings of the Algorithm Theory, 2002

2001

The Accommodating Function: A Generalization of the Competitive Ratio.

[BibT_eX]

[DOI]

,

,

Morten N. Nielsen

SIAM J. Comput., 2001

The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences.

[BibT_eX]

[DOI]

,

Lene M. Favrholdt

,

,

Morten N. Nielsen

Nord. J. Comput., 2001

Variants of (A, B)-Trees with Relaxed Balance.

[BibT_eX]

[DOI]

,

Int. J. Found. Comput. Sci., 2001

Relaxed Balance Using Standard Rotations.

[BibT_eX]

[DOI]

,

Eljas Soisalon-Soininen

,

Algorithmica, 2001

Relaxed balance for search trees with local rebalancing.

[BibT_eX]

[DOI]

,

,

Eljas Soisalon-Soininen

Acta Informatica, 2001

Search Trees with Relaxed Balance and Near-Optimal Height.

[BibT_eX]

[DOI]

,

,

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Complexity of Layered Binary Search Trees with Relaxed Balance.

[BibT_eX]

[DOI]

,

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000

AVL Trees with Relaxed Balance.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

Fair versus Unrestricted Bin Packing.

[BibT_eX]

[DOI]

,

,

Lene M. Favrholdt

,

,

Morten N. Nielsen

Proceedings of the Algorithm Theory, 2000

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

On Grouping in Relational Algebra.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

Partially persistent search trees with transcript operations.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 1999

The Seat Reservation Problem.

[BibT_eX]

[DOI]

,

Algorithmica, 1999

1998

Parametric Permutation Routing via Matchings.

[BibT_eX]

,

Nord. J. Comput., 1998

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Sort Order Problems in Relational Databases.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1998

Amortized Constant Relaxed Rebalancing Using Standard Rotations.

[BibT_eX]

[DOI]

Acta Informatica, 1998

1997

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.

[BibT_eX]

[DOI]

,

,

J. Comput. Syst. Sci., 1997

Relaxed Balance through Standard Rotations.

[BibT_eX]

[DOI]

,

Eljas Soisalon-Soininen

,

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

1996

Efficient Rebalancing of B-Trees with Relaxed Balance.

[BibT_eX]

[DOI]

,

Int. J. Found. Comput. Sci., 1996

1995

Efficient Simplification of Bisimulation Formulas.

[BibT_eX]

[DOI]

,

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1995

B-trees with relaxed balance.

[BibT_eX]

[DOI]

,

Proceedings of IPPS '95, 1995

1994

Injectivity of Composite Functions.

[BibT_eX]

[DOI]

,

Michael I. Schwartzbach

J. Symb. Comput., 1994

Efficient Rebalancing of Chromatic Search Trees.

[BibT_eX]

[DOI]

,

J. Comput. Syst. Sci., 1994

Bounds on Certain Multiplications of Affine Combinations.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 1994

1992

A New Formalism for Relational Algebra.

[BibT_eX]

[DOI]

,

Michael I. Schwartzbach

,

Erik Meineche Schmidt

Inf. Process. Lett., 1992

1988

Fully abstract models for a process language with refinement.

[BibT_eX]

[DOI]

,

,

Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

Loading...