Kim S. Larsen

According to our database1, Kim S. Larsen authored at least 116 papers between 1988 and 2018.

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Online-bounded analysis.
J. Scheduling, 2018

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

Advice Complexity of Priority Algorithms.
CoRR, 2018

Relative Worst-Order Analysis: A Survey.
CoRR, 2018

Batch Coloring of Graphs.
Algorithmica, 2018

Heuristic Variants of A ^* Search for 3D Flight Planning.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017
Formally Proving Size Optimality of Sorting Networks.
J. Autom. Reasoning, 2017

On the list update problem with advice.
Inf. Comput., 2017

Online Algorithms with Advice: A Survey.
ACM Comput. Surv., 2017

Relaxing the Irrevocability Requirement for Online Graph Algorithms.
CoRR, 2017

Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

How to Get More Out of Your Oracles.
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

The Paths to Choreography Extraction.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

DNA-Templated Synthesis Optimization.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

Constraint Handling in Flight Planning.
Proceedings of the Principles and Practice of Constraint Programming, 2017

Flight Planning in Free Route Airspaces.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016
Online Algorithms with Advice: A Survey.
SIGACT News, 2016

The Paths to Choreography Extraction.
CoRR, 2016

Batch Coloring of Graphs.
CoRR, 2016

Online Bounded Analysis.
CoRR, 2016

Online Dominating Set.
CoRR, 2016

Online Bin Packing with Advice.
Algorithmica, 2016

Batch Coloring of Graphs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Online Dominating Set.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Vertical Optimization of Resource Dependent Flight Paths.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Online Bounded Analysis.
Proceedings of the Computer Science - Theory and Applications, 2016

2015
Online multi-coloring with advice.
Theor. Comput. Sci., 2015

Relative interval analysis of paging algorithms on access graphs.
Theor. Comput. Sci., 2015

Soccer is Harder Than Football.
Int. J. Found. Comput. Sci., 2015

The Frequent Items Problem in Online Streaming Under Various Performance Measures.
Int. J. Found. Comput. Sci., 2015

A Comparison of Performance Measures for Online Algorithms.
Algorithmica, 2015

2014
Online bin covering: Expectations vs. guarantees.
Theor. Comput. Sci., 2014

A comparison of performance measures via online search.
Theor. Comput. Sci., 2014

Online Multi-Coloring with Advice.
CoRR, 2014

Online Multi-Coloring with Advice.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Online Bin Packing with Advice.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

On the List Update Problem with Advice.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
Better bounds on online unit clustering.
Theor. Comput. Sci., 2013

A Technique for Exact Computation of precoloring Extension on Interval Graphs.
Int. J. Found. Comput. Sci., 2013

Relative Interval Analysis of Paging Algorithms on Access Graphs
CoRR, 2013

Online Bin Covering: Expectations vs. Guarantees.
CoRR, 2013

The Frequent Items Problem in Online Streaming under Various Performance Measures.
CoRR, 2013

On the List Update Problem with Advice.
CoRR, 2013

List Factoring and Relative Worst Order Analysis.
Algorithmica, 2013

Online multi-coloring on the path revisited.
Acta Inf., 2013

Relative Interval Analysis of Paging Algorithms on Access Graphs.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

The Frequent Items Problem in Online Streaming under Various Performance Measures.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Online Bin Covering: Expectations vs. Guarantees.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Online Bin Packing with Advice
CoRR, 2012

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
CoRR, 2012

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

A Comparison of Performance Measures via Online Search.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
A Comparison of Performance Measures via Online Search
CoRR, 2011

2010
Priority algorithms for graph optimization problems.
Theor. Comput. Sci., 2010

Competitive analysis of the online inventory problem.
European Journal of Operational Research, 2010

List Factoring and Relative Worst Order Analysis
CoRR, 2010

A theoretical comparison of LRU and LRU-K.
Acta Inf., 2010

List Factoring and Relative Worst Order Analysis.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Better Bounds on Online Unit Clustering.
Proceedings of the Algorithm Theory, 2010

2009
A Comparison of Performance Measures for Online Algorithms.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008
A Comparison of Performance Measures for Online Algorithms
CoRR, 2008

2007
The relative worst-order ratio applied to paging.
J. Comput. Syst. Sci., 2007

2006
The maximum resource bin packing problem.
Theor. Comput. Sci., 2006

Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem.
Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006

2005
On-line seat reservations via off-line seating arrangements.
Int. J. Found. Comput. Sci., 2005

Exponentially decreasing number of operations in balanced trees.
Acta Inf., 2005

The relative worst order ratio applied to paging.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The Maximum Resource Bin Packing Problem.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Balanced Binary Search Trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

Priority Algorithms for Graph Optimization Problems.
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.
J. Scheduling, 2003

Relaxed multi-way trees with group updates.
J. Comput. Syst. Sci., 2003

Dynamic TCP acknowledgment in the LogP model.
J. Algorithms, 2003

Extending the accommodating function.
Acta Inf., 2003

Online Seat Reservations via Offine Seating Arrangements.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

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

Fair versus Unrestricted Bin Packing.
Algorithmica, 2002

Relaxed red-black trees with group updates.
Acta Inf., 2002

Packet Bundling.
Proceedings of the Algorithm Theory, 2002

Extending the Accommodating Function.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
The Accommodating Function: A Generalization of the Competitive Ratio.
SIAM J. Comput., 2001

The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences.
Nord. J. Comput., 2001

Variants of (A, B)-Trees with Relaxed Balance.
Int. J. Found. Comput. Sci., 2001

Relaxed Balance Using Standard Rotations.
Algorithmica, 2001

Relaxed balance for search trees with local rebalancing.
Acta Inf., 2001

Search Trees with Relaxed Balance and Near-Optimal Height.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Relaxed Multi-Way Trees with Group Updates.
Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001

Exponentially Decreasing Number of Operations in Balanced Trees.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Complexity of Layered Binary Search Trees with Relaxed Balance.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000
AVL Trees with Relaxed Balance.
J. Comput. Syst. Sci., 2000

Fair versus Unrestricted Bin Packing.
Proceedings of the Algorithm Theory, 2000

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
On Grouping in Relational Algebra.
Int. J. Found. Comput. Sci., 1999

Partially persistent search trees with transcript operations.
Discrete Mathematics & Theoretical Computer Science, 1999

The Seat Reservation Problem.
Algorithmica, 1999

The Accommodating Function - A Generalization of the Competitive Ratio.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Parametric Permutation Routing via Matchings.
Nord. J. Comput., 1998

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy.
Inf. Process. Lett., 1998

Sort Order Problems in Relational Databases.
Int. J. Found. Comput. Sci., 1998

Amortized Constant Relaxed Rebalancing Using Standard Rotations.
Acta Inf., 1998

Partially Persistent Search Trees with Transcript Operations.
Proceedings of the STACS 98, 1998

1997
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
J. Comput. Syst. Sci., 1997

Relaxed Balance through Standard Rotations.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Relaxed Balance for Search Trees with Local Rebalancing.
Proceedings of the Algorithms, 1997

1996
Efficient Rebalancing of B-Trees with Relaxed Balance.
Int. J. Found. Comput. Sci., 1996

1995
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Efficient Simplification of Bisimulation Formulas.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1995

B-trees with relaxed balance.
Proceedings of IPPS '95, 1995

1994
Injectivity of Composite Functions.
J. Symb. Comput., 1994

Efficient Rebalancing of Chromatic Search Trees.
J. Comput. Syst. Sci., 1994

Bounds on Certain Multiplications of Affine Combinations.
Discrete Applied Mathematics, 1994

AVL Trees with Relaxed Balance.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

1992
A New Formalism for Relational Algebra.
Inf. Process. Lett., 1992

Efficient Rebalancing of Chromatic Search Trees.
Proceedings of the Algorithm Theory, 1992

1988
Fully abstract models for a process language with refinement.
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...