% SECTION journals Peer-Reviewed International Journal Articles

@ARTICLE{BFL24j,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Online Unit Profit Knapsack with Untrusted Predictions}",
   JOURNAL = "Algorithmica",
   VOLUME = 86,
   PAGES = "2786--2821",
   YEAR = 2024
   }

@ARTICLE{BLP24j,
   AUTHOR = "Joan Boyar and Kim S. Larsen and Denis Pankratov",
   TITLE = "{Advice Complexity of Adaptive Priority Algorithms}",
   JOURNAL = "Theoretical Computer Science",
   VOLUME = 984,
   NUMBER = 114318,
   PAGES = "1--31",
   YEAR = 2024
   }

@ARTICLE{BFKL22j,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Michal Kotrb\v{c}\'{\i}k and Kim S. Larsen.",
   TITLE = "{Relaxing the Irrevocability Requirement for Online Graph Algorithms}",
   JOURNAL = "Algorithmica",
   VOLUME = 84,
   NUMBER = 7,
   PAGES = "1916--1951",
   YEAR = 2022
   }

@ARTICLE{BFKL21j,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Shahin Kamali and Kim S. Larsen.",
   TITLE = "{Online Bin Covering with Advice}",
   JOURNAL = "Algorithmica",
   VOLUME = 83,
   NUMBER = 3,
   PAGES = "795--821",
   YEAR = 2021,
   }

@ARTICLE{BFL21j,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Relative Worst-Order Analysis: A Survey}",
   JOURNAL = "ACM Computing Surveys",
   VOLUME = 54,
   NUMBER = 1,
   PAGES = "1--21",
   YEAR = 2021,
   NOTE = "Article No.~8"
   }

@ARTICLE{BEL20j,
   AUTHOR = "Joan Boyar and Faith Ellen and Kim S. Larsen",
   TITLE = "{Randomized Distributed Online Algorithms Against Adaptive Offline Adversaries}",
   JOURNAL = "Information Processing Letters",
   VOLUME = 161,
   PAGES = "Article No.~105973",
   YEAR = 2020
   }

@ARTICLE{BBLP20j,
   AUTHOR = "Allan Borodin and Joan Boyar and Kim S. Larsen and Denis Pankratov",
   TITLE = "{Advice Complexity of Priority Algorithms}",
   JOURNAL = "Theory of Computing Systems",
   VOLUME = 64,
   NUMBER = 4,
   PAGES = "593--625",
   YEAR = 2020
   }

@ARTICLE{BEFKL19j,
   AUTHOR = "Joan Boyar and Stephan J. Eidenbenz and Lene M. Favrholdt and Michal Kotrb\v{c}\'{\i}k and Kim S. Larsen.",
   TITLE = "{Online Dominating Set}",
   JOURNAL = "Algorithmica",
   VOLUME = 81,
   NUMBER = 5,
   PAGES = "1938--1964",
   YEAR = 2019
   }

@ARTICLE{HLMM18j,
   AUTHOR = "Bjarke N. Hansen and Kim S. Larsen and Daniel Merkle and Alexei Mihalchuk",
   TITLE = "{DNA-Templated Synthesis Optimization}",
   JOURNAL = "Natural Computing",
   VOLUME = 17,
   NUMBER = 4,
   PAGES = "693--707",
   YEAR = 2018
   }

@ARTICLE{BEFLL18j1,
   AUTHOR = "Joan Boyar and Leah Epstein and Lene M. Favrholdt and Kim S. Larsen and Asaf Levin",
   TITLE = "{Batch Coloring of Graphs}",
   JOURNAL = "Algorithmica",
   VOLUME = 80,
   NUMBER = 11,
   PAGES = "3293--3315",
   YEAR = 2018
   }

@ARTICLE{BEFLL18j,
   AUTHOR = "Joan Boyar and Leah Epstein and Lene M. Favrholdt and Kim S. Larsen and Asaf Levin",
   TITLE = "{Online-Bounded Analysis}",
   JOURNAL = "Journal of Scheduling",
   VOLUME = 21,
   NUMBER = 4,
   PAGES = "429--441",
   YEAR = 2018
   }

@ARTICLE{CLS17j,
   AUTHOR = "Lu{\'\i{}}s Cruz-Filipe and Kim S. Larsen and
             Peter Schneider-Kamp",
   TITLE = "{Formally Proving Size Optimality of Sorting Networks}",
   JOURNAL = "Journal of Automated Reasoning",
   VOLUME = 59,
   NUMBER = 4,
   PAGES = "425--454",
   YEAR = 2017
   }

@ARTICLE{BFKLM17j,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Christian Kudahl
             and Kim S. Larsen and Jesper W. Mikkelsen",
   TITLE = "{Online Algorithms with Advice: A Survey}",
   JOURNAL = "ACM Computing Surveys",
   VOLUME = 50,
   NUMBER = 2,
   PAGES = "1--34",
   YEAR = 2017,
   NOTE = "Article No.~19"
   }

@ARTICLE{BKLL17j,
   AUTHOR = "Joan Boyar and Shahin Kamali and Kim S. Larsen and
             Alejandro L{\'{o}}pez-Ortiz",
   TITLE = "{On the List Update Problem with Advice}",
   JOURNAL = "Information and Computation",
   VOLUME = 253,
   NUMBER = 3,
   PAGES = "411--423",
   YEAR = 2017
   }

@ARTICLE{BKLL16j,
   AUTHOR = "Joan Boyar and Shahin Kamali and Kim S. Larsen and
             Alejandro L{\'{o}}pez-Ortiz",
   TITLE = "{Online Bin Packing with Advice}",
   JOURNAL = "Algorithmica",
   VOLUME = 74,
   NUMBER = 1,
   PAGES = "507--527",
   YEAR = 2016
   }

@ARTICLE{CKL15j,
   AUTHOR = "Jan Christensen and Anders Nicolai Knudsen and Kim S. Larsen",
   TITLE = "{Soccer Is Harder than Football}",
   JOURNAL = "International Journal of Foundations of Computer Science",
   VOLUME = 26,
   NUMBER = 4,
   PAGES = "477--486",
   YEAR = 2015
   }

@ARTICLE{BLM15j,
   AUTHOR = "Joan Boyar and Kim S. Larsen and Abyayananda Maiti",
   TITLE = "{The Frequent Items Problem in Online Streaming under Various Performance Measures}",
   JOURNAL = "International Journal of Foundations of Computer Science",
   VOLUME = 26,
   NUMBER = 4,
   PAGES = "413--439",
   YEAR = 2015
   }

@ARTICLE{CFL15j,
   AUTHOR = "Marie G. Christ and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Online Multi-Coloring with Advice}",
   JOURNAL = "Theoretical Computer Science",
   VOLUME = 596,
   PAGES = "79--91",
   YEAR = 2015
   }

@ARTICLE{BIL15j,
   AUTHOR = "Joan Boyar and Sandy Irani and Kim S. Larsen",
   TITLE = "{A Comparison of Performance Measures for Online Algorithms}",
   JOURNAL = "Algorithmica",
   VOLUME = 72,
   NUMBER = 4,
   PAGES = "969--994",
   YEAR = 2015
   }

@ARTICLE{BGL15j,
   AUTHOR = "Joan Boyar and Sushmita Gupta and Kim S. Larsen",
   TITLE = "{Relative Interval Analysis of Paging Algorithms on Access Graphs}",
   JOURNAL = "Theoretical Computer Science",
   VOLUME = 568,
   PAGES = "28--48",
   YEAR = 2015
   }

@ARTICLE{CFL14j,
   AUTHOR = "Marie G. Christ and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Online Bin Covering: Expectations vs.\ Guarantees}",
   JOURNAL = "Theoretical Computer Science",
   VOLUME = 556,
   PAGES = "71--84",
   YEAR = 2014
   }

@ARTICLE{BLM14j,
   AUTHOR = "Joan Boyar and Kim S. Larsen and Abyayananda Maiti",
   TITLE = "{A Comparison of Performance Measures via Online Search}",
   JOURNAL = "Theoretical Computer Science",
   VOLUME = 532,
   PAGES = "2--13",
   YEAR = 2014
   }

@ARTICLE{CFL13j,
   AUTHOR = "Marie G. Christ and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Online Multi-Coloring on the Path Revisited}",
   JOURNAL = "Acta Informatica",
   VOLUME = 50,
   NUMBER = "5--6",
   PAGES = "343--357",
   YEAR = 2013
   }

@ARTICLE{EL13j2,
   AUTHOR = "Martin R. Ehmsen and Kim S. Larsen",
   TITLE = "{Better Bounds on Online Unit Clustering}",
   JOURNAL = "Theoretical Computer Science",
   VOLUME = 500,
   PAGES = "1--24",
   YEAR = 2013
   }

@ARTICLE{EL13j1,
   AUTHOR = "Martin R. Ehmsen and Kim S. Larsen",
   TITLE = "{A Technique for Exact Computation of Precoloring Extension
             on Interval Graphs}",
   JOURNAL = "International Journal of Foundations of Computer Science",
   VOLUME = 24,
   NUMBER = 1,
   PAGES = "109--122",
   YEAR = 2013
   }

@ARTICLE{EKL13j,
   AUTHOR = "Martin R. Ehmsen and Jens S. Kohrt and Kim S. Larsen",
   TITLE = "{List Factoring and Relative Worst Order Analysis}",
   JOURNAL = "Algorithmica",
   VOLUME = 66,
   NUMBER = 2,
   PAGES = "287--309",
   YEAR = 2013
   }

@ARTICLE{BEKL10j,
   AUTHOR = "Joan Boyar and Martin R. Ehmsen and Jens S. Kohrt and
             Kim S. Larsen",
   TITLE = "{A Theoretical Comparison of LRU and LRU-K}",
   JOURNAL = "Acta Informatica",
   VOLUME = 47,
   NUMBER = "7--8",
   PAGES = "359--374",
   YEAR = 2010
   }

@ARTICLE{LW10j,
   AUTHOR = "Kim S. Larsen and Sanne W{\o{}}hlk",
   TITLE = "{Competitive Analysis of the Online Inventory Problem}",
   JOURNAL = "European Journal of Operational Research",
   VOLUME = 207,
   NUMBER = 2,
   PAGES = "685--696",
   YEAR = 2010
   }

@ARTICLE{BBLM10j,
   AUTHOR = "Allan Borodin and Joan Boyar and Kim S. Larsen and
             Nazanin Mirmohammadi",
   TITLE = "{Priority Algorithms for Graph Optimization Problems}",
   JOURNAL = "Theoretical Computer Science",
   VOLUME = 411,
   NUMBER = 1,
   PAGES = "239--258",
   YEAR = 2010
   }

@ARTICLE{BFL07j,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{The Relative Worst Order Ratio Applied to Paging}",
   JOURNAL = "Journal of Computer and System Sciences",
   VOLUME = 73,
   NUMBER = 5,
   PAGES = "818--843",
   YEAR = 2007
   }

@ARTICLE{BEFKLPW06j,
   AUTHOR = "Joan Boyar and Leah Epstein and Lene M. Favrholdt and
             Jens S. Kohrt and Kim S. Larsen and Morten M. Pedersen
             and Sanne W{\o{}}hlk",
   TITLE = "{The Maximum Resource Bin Packing Problem}",
   JOURNAL = "Theoretical Computer Science",
   VOLUME = 362,
   NUMBER = "1--3",
   PAGES = "127--139",
   YEAR = 2006
   }

@ARTICLE{JL05j,
   AUTHOR = "Lars Jacobsen and Kim S. Larsen",
   TITLE = "{Exponentially Decreasing Number of Operations in Balanced Trees}",
   JOURNAL = "Acta Informatica",
   VOLUME = 82,
   NUMBER = 4,
   PAGES = "57--78",
   YEAR = 2005
   }

@ARTICLE{KL05j,
   AUTHOR = "Jens S. Kohrt and Kim S. Larsen",
   TITLE = "{On-Line Seat Reservations via Off-Line Seating Arrangements}",
   JOURNAL = "International Journal of Foundations of Computer Science",
   VOLUME = 16,
   NUMBER = 2,
   PAGES = "381--397",
   YEAR = 2005
   }

@ARTICLE{BFLN03j,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen and
             Morten N. Nielsen",
   TITLE = "{Extending the Accommodating Function}",
   JOURNAL = "Acta Informatica",
   VOLUME = 40,
   NUMBER = 1,
   PAGES = "3--35",
   YEAR = 2003
   }

@ARTICLE{FLNU03j,
   AUTHOR = "Jens S. Frederiksen and Kim S. Larsen and John Noga and
             Patchrawat Uthaisombut",
   TITLE = "{Dynamic TCP Acknowledgment in the LogP Model}",
   JOURNAL = "Journal of Algorithms",
   VOLUME = 48,
   NUMBER = 2,
   PAGES = "407--428",
   YEAR = 2003
   }

@ARTICLE{L03j,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{Relaxed Multi-Way Trees with Group Updates}",
   JOURNAL = "Journal of Computer and System Sciences",
   VOLUME = 66,
   NUMBER = 4,
   PAGES = "657--670",
   YEAR = 2003
   }

@ARTICLE{BBEFJLLS03j,
   AUTHOR = "Eric Bach and Joan Boyar and Leah Epstein and Lene M. Favrholdt
             and Tao Jiang and Kim S. Larsen and Guo-Hui Lin and Rob van Stee",
   TITLE = "{Tight Bounds on the Competitive Ratio on Accommodating Sequences
             for the Seat Reservation Problem}",
   JOURNAL = "Journal of Scheduling",
   VOLUME = 6,
   NUMBER = 2,
   PAGES = "131--147",
   YEAR = 2003
   }

@ARTICLE{JLN02j,
   AUTHOR = "Lars Jacobsen and Kim S. Larsen and Morten N. Nielsen",
   TITLE = "{On the Existence and Construction of Non-Extreme $(a,b)$-Trees}",
   JOURNAL = "Information Processing Letters",
   VOLUME = 84,
   NUMBER = 2,
   PAGES = "69--73",
   YEAR = 2002
   }

@ARTICLE{ABEFLN02j,
   AUTHOR = "Yossi Azar and Joan Boyar and Leah Epstein and
             Lene M. Favrholdt and Kim S. Larsen and Morten N. Nielsen",
   TITLE = "{Fair versus Unrestricted Bin Packing}",
   JOURNAL = "Algorithmica",
   VOLUME = 34,
   NUMBER = 2,
   PAGES = "181--196",
   YEAR = 2002
   }

@ARTICLE{L02j,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{Relaxed Red-Black Trees with Group Updates}",
   JOURNAL = "Acta Informatica",
   VOLUME = 38,
   NUMBER = 8,
   PAGES = "565--586",
   YEAR = 2002
   }

@ARTICLE{BFLN01j,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen and
             Morten N. Nielsen",
   TITLE = "{The Competitive Ratio for On-Line Dual Bin Packing with
             Restricted Input Sequences}",
   JOURNAL = "Nordic Journal of Computing",
   VOLUME = 8,
   NUMBER = 4,
   PAGES = "463--472",
   YEAR = 2001
   }

@ARTICLE{LSW01j,
   AUTHOR = "Kim S. Larsen and Eljas Soisalon-Soininen and Peter Widmayer",
   TITLE = "{Relaxed Balance using Standard Rotations}",
   JOURNAL = "Algorithmica",
   VOLUME = 31,
   NUMBER = 4,
   PAGES = "501--512",
   YEAR = 2001
   }

@ARTICLE{LOS01j,
   AUTHOR = "Kim S. Larsen and Thomas Ottmann and Eljas Soisalon-Soininen",
   TITLE = "{Relaxed Balance for Search Trees with Local Rebalancing}",
   JOURNAL = "Acta Informatica",
   VOLUME = 37,
   NUMBER = 10,
   PAGES = "743--763",
   YEAR = 2001
   }

@ARTICLE{JL01j,
   AUTHOR = "Lars Jacobsen and Kim S. Larsen",
   TITLE = "{Variants of $(a,b)$-Trees with Relaxed Balance}",
   JOURNAL = "International Journal of Foundations of Computer Science",
   VOLUME = 12,
   NUMBER = 4,
   PAGES = "455--478",
   YEAR = 2001
   }

@ARTICLE{BLN01j,
   AUTHOR = "Joan Boyar and Kim S. Larsen and Morten N. Nielsen",
   TITLE = "{The Accommodating Function:
             a generalization of the competitive ratio}",
   JOURNAL = "SIAM Journal on Computing",
   VOLUME = 31,
   NUMBER = 1,
   PAGES = "233--258",
   YEAR = 2001
   }

@ARTICLE{L00j,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{AVL Trees with Relaxed Balance}",
   JOURNAL = "Journal of Computer and System Sciences",
   VOLUME = 61,
   NUMBER = 3,
   PAGES = "508--522",
   YEAR = 2000
   }

@ARTICLE{L99j1,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{On Grouping in Relational Algebra}",
   JOURNAL = "International Journal of Foundations of Computer Science",
   VOLUME = 10,
   NUMBER = 3,
   PAGES = "301--311",
   YEAR = 1999
   }

@ARTICLE{BL99j,
   AUTHOR = "Joan Boyar and Kim S. Larsen",
   TITLE = "{The Seat Reservation Problem}",
   JOURNAL = "Algorithmica",
   VOLUME = 25,
   NUMBER = 4,
   PAGES = "403--417",
   YEAR = 1999
   }

@ARTICLE{L99j,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{Partially Persistent Binary Search Trees with Transcript
             Operations}",
   JOURNAL = "Discrete Mathematics and Theoretical Computer Science",
   VOLUME = 3,
   NUMBER = 3,
   PAGES = "95--107",
   YEAR = 1999
   }

@ARTICLE{L98j2,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{Sort Order Problems in Relational Databases}",
   JOURNAL = "International Journal of Foundations of Computer Science",
   VOLUME = 9,
   NUMBER = 4,
   PAGES = "399--429",
   YEAR = 1998
   }

@ARTICLE{L98j1,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{Amortized Constant Relaxed Rebalancing using Standard Rotations}",
   JOURNAL = "Acta Informatica",
   VOLUME = 35,
   NUMBER = 10,
   PAGES = "859--874",
   YEAR = 1998
   }

@ARTICLE{HL98j,
   AUTHOR = "Peter H{\o{}}yer and Kim S. Larsen",
   TITLE = "{Parametric Permutation Routing via Matchings}",
   JOURNAL = "Nordic Journal of Computing",
   VOLUME = 5,
   NUMBER = 2,
   PAGES = "105--114",
   YEAR = 1998
   }

@ARTICLE{L98j,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{Regular Expressions with Nested Levels of Back Referencing
             Form a Hierarchy}",
   JOURNAL = "Information Processing Letters",
   VOLUME = 65,
   NUMBER = 4,
   PAGES = "169--172",
   YEAR = 1998
   }

@ARTICLE{BFL97j,
   AUTHOR = "Joan Boyar and Rolf Fagerberg and Kim S. Larsen",
   TITLE = "{Amortization Results for Chromatic Search Trees,
             with an Application to Priority Queues}",
   JOURNAL = "Journal of Computer and System Sciences",
   VOLUME = 55,
   NUMBER = 3,
   PAGES = "504--521",
   YEAR = 1997
   }

@ARTICLE{LF96j,
   AUTHOR = "Kim S. Larsen and Rolf Fagerberg",
   TITLE = "{Efficient Rebalancing of B-Trees with Relaxed Balance}",
   JOURNAL = "International Journal of Foundations of Computer Science",
   VOLUME = 7,
   NUMBER = 2,
   PAGES = "169--186",
   YEAR = 1996
   }

@ARTICLE{BL94j,
   AUTHOR = "Joan F. Boyar and Kim S. Larsen",
   TITLE = "{Efficient Rebalancing of Chromatic Search Trees}",
   JOURNAL = "Journal of Computer and System Sciences",
   VOLUME = 49,
   NUMBER = 3,
   PAGES = "667--682",
   YEAR = 1994
   }

@ARTICLE{LS94j,
   AUTHOR = "Kim S. Larsen and Michael I. Schwartzbach",
   TITLE = "{Injectivity of Composite Functions}",
   JOURNAL = "Journal of Symbolic Computation",
   VOLUME = 17,
   NUMBER = 5,
   PAGES = "393--408",
   YEAR = 1994
   }

@ARTICLE{BFL94j,
   AUTHOR = "Joan Boyar and Faith Fich and Kim S. Larsen",
   TITLE = "{Bounds on Certain Multiplications of Affine Combinations}",
   JOURNAL = "Discrete Applied Mathematics",
   VOLUME = 52,
   NUMBER = 2,
   PAGES = "155--167",
   YEAR = 1994
   }

@ARTICLE{LSS92j,
   AUTHOR = "Kim S. Larsen and Michael I. Schwartzbach and Erik M. Schmidt",
   TITLE = "{A New Formalism for Relational Algebra}",
   JOURNAL = "Information Processing Letters",
   VOLUME = 41,
   NUMBER = 3,
   PAGES = "163--168",
   YEAR = 1992
   }


% SECTION conferences Peer-Reviewed International Conference Articles

@INPROCEEDINGS{BEL25p,
   AUTHOR = "Joan Boyar and Faith Ellen and Kim S. Larsen",
   TITLE = "{Brief Announcement: Distributed Graph Algorithms with Predictions}",
   BOOKTITLE = "44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)",
   PUBLISHER = "ACM",
   PAGES = "322--325",
   YEAR = 2025
   }

@INPROCEEDINGS{BBFL25p,
   AUTHOR = "Magnus Berg and Joan Boyar and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Complexity Classes for Online Problems with and without Predictions}",
   BOOKTITLE = "{19th International Joint Conference on Theoretical Computer Science -- Frontiers of Algorithmic Wisdom ({IJTCS-FAW})}",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 15828,
   PUBLISHER = "Springer",
   PAGES = "49--63",
   YEAR = 2025,
   NOTE = "Best paper award for Track A."
   }

@INPROCEEDINGS{BKLLLP24p,
   AUTHOR = "Joan Boyar and Shahin Kamali and Kim S. Larsen and Ali Mohammad Lavasani and Yaqiao Li and Denis Pankratov",
   TITLE = "{On the Online Weighted Non-Crossing Matching Problem}",
   BOOKTITLE = "19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT)",
   SERIES = "Leibniz International Proceedings in Informatics (LIPIcs)",
   PUBLISHER = "Schloss Dagstuhl -- Leibniz-Zentrum f{\"{u}}r Informatik GmbH",
   VOLUME = 294,
   PAGES = "16:1--16:19",
   YEAR = 2024
   }

@INPROCEEDINGS{BELN23p,
   AUTHOR = "Joan Boyar and Simon Erfurth and Kim S. Larsen and Ruben Niederhagen",
   TITLE = "{Quotable Signatures for Authenticating Shared Quotes}",
   BOOKTITLE = "8th International Conference on Cryptology and Information Security in Latin America (LATINCRYPT)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 14168,
   PUBLISHER = "Springer",
   PAGES = "273--292",
   YEAR = 2023
   }

@INPROCEEDINGS{ABEFHLPS23p,
   AUTHOR = "Antonios Antoniadis and Joan Boyar and Marek Eliáš and Lene M. Favrholdt and Ruben Hoeksma and Kim S. Larsen and Adam Polak and Bertrand Simon",
   TITLE = "{Paging with Succinct Predictions}",
   BOOKTITLE = "40th International Conference on Machine Learning (ICML)",
   SERIES = "Proceedings of Machine Learning Research",
   VOLUME = 202,
   PUBLISHER = "PMLR",
   PAGES = "952--968",   
   YEAR = 2023
   }

@INPROCEEDINGS{BBFL23p,
   AUTHOR = "Magnus Berg and Joan Boyar and Lene M. Favrholdt and Kim S. Larsen.",
   TITLE = "{Online Minimum Spanning Trees with Weight Predictions}",
   BOOKTITLE = "18th International Algorithms and Data Structures Symposium (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 14079,
   PUBLISHER = "Springer",
   PAGES = "136--148",
   YEAR = 2023
   }

@INPROCEEDINGS{BFKL23p,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Shahin Kamali and Kim S. Larsen",
   TITLE = "{Online Interval Scheduling with Predictions}",
   BOOKTITLE = "18th International Algorithms and Data Structures Symposium (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 14079,
   PUBLISHER = "Springer",
   PAGES = "193--207",
   YEAR = 2023
   }

@INPROCEEDINGS{BFL22p,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Online Unit Profit Knapsack with Untrusted Predictions}",
   BOOKTITLE = "18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT)",
   SERIES = "Leibniz International Proceedings in Informatics (LIPIcs)",
   VOLUME = 227,
   PUBLISHER = "Schloss Dagstuhl -- Leibniz-Zentrum f{\"{u}}r Informatik GmbH",
   PAGES = "20:1--20:17",
   YEAR = 2022,
   }

@INPROCEEDINGS{BFKL19p,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Shahin Kamali and Kim S. Larsen",
   TITLE = "{Online Bin Covering with Advice}",
   BOOKTITLE = "16th International Algorithms and Data Structures Symposium (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 11646,
   PUBLISHER = "Springer",
   PAGES = "225--238",
   YEAR = 2019
   }

@INPROCEEDINGS{BBLP18p,
   AUTHOR = "Allan Borodin and Joan Boyar and Kim S. Larsen and Denis Pankratov",
   TITLE = "{Advice Complexity of Priority Algorithms}",
   BOOKTITLE = "16th Workshop on Approximation and Online Algorithms (WAOA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 11312,
   PUBLISHER = "Springer",
   PAGES = "69--86",
   YEAR = 2018
   }

@INPROCEEDINGS{KCL18p,
   AUTHOR = "Anders N. Knudsen and Marco Chiarandini and Kim S. Larsen",
   TITLE = "{Heuristic Variants for A$^*$ Search in 3D Flight Planning}",
   BOOKTITLE = "15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research  (CPAIOR)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 10848,
   PUBLISHER = "Springer",
   PAGES = "361--376",
   YEAR = 2018
   }

@INPROCEEDINGS{KCL17p,
   AUTHOR = "Anders N. Knudsen and Marco Chiarandini and Kim S. Larsen",
   TITLE = "{Constraint Handling in Flight Planning}",
   BOOKTITLE = " 23rd International Conference on Principles and Practice of Constraint Programming (CP)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 10416,
   PUBLISHER = "Springer",
   PAGES = "354--369",
   YEAR = 2017
   }

@INPROCEEDINGS{CLS17p,
   AUTHOR = "Lu{\'\i{}}s Cruz-Filipe and Kim S. Larsen and
             Peter Schneider-Kamp",
   TITLE = "{How to Get More Out of Your Oracles}",
   BOOKTITLE = "8th International Conference on Interactive Theorem Proving (ITP)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 10499,
   PUBLISHER = "Springer",
   PAGES = "164--170",
   YEAR = 2017
   }

@INPROCEEDINGS{HLMM17p,
   AUTHOR = "Bjarke N. Hansen and Kim S. Larsen and Daniel Merkle and Alexei Mihalchuk",
   TITLE = "{DNA-Templated Synthesis Optimization}",
   BOOKTITLE = "23rd International Conference on DNA Computing and Molecular Programming (DNA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 10467,
   PUBLISHER = "Springer",
   PAGES = "17--32",
   YEAR = 2017
   }

@INPROCEEDINGS{JCL17p,
   AUTHOR = "Casper Kehlet Jensen and Marco Chiarandini and Kim S. Larsen",
   TITLE = "{Flight Planning in Free Route Airspaces}",
   BOOKTITLE = "17th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS)",
   SERIES = "OASIcs",
   VOLUME = 59,
   PUBLISHER = "Schloss Dagstuhl -- Leibniz-Zentrum f{\"{u}}r Informatik GmbH",
   PAGES = "14:1--14:14",
   YEAR = 2017
   }

@INPROCEEDINGS{BFKL17p,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Michal Kotrb\v{c}\'{\i}k and Kim S. Larsen.",
   TITLE = "{Relaxing the Irrevocability Requirement for Online Graph Algorithms}",
   BOOKTITLE = "15th International Algorithms and Data Structures Symposium (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 10389,
   PUBLISHER = "Springer",
   PAGES = "217--228",
   YEAR = 2017
   }

@INPROCEEDINGS{CLM17p,
   AUTHOR = "Lu{\'\i{}}s Cruz-Filipe and Kim S. Larsen and Fabrizio Montesi",
   TITLE = "{The Paths to Choreography Extraction}",
   BOOKTITLE = "20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 10203,
   PUBLISHER = "Springer",
   PAGES = "424--440",
   YEAR = 2017
   }

@INPROCEEDINGS{BEFLL16p1,
   AUTHOR = "Joan Boyar and Leah Epstein and Lene M. Favrholdt and Kim S. Larsen and Asaf Levin",
   TITLE = "{Batch Coloring of Graphs}",
   BOOKTITLE = "14th Workshop on Approximation and Online Algorithms (WAOA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 10138,
   PUBLISHER = "Springer",
   PAGES = "52--64",
   YEAR = 2017
   }

@INPROCEEDINGS{KCL16p,
   AUTHOR = "Anders N. Knudsen and Marco Chiarandini and Kim S. Larsen.",
   TITLE = "{Vertical Optimization of Resource Dependent Flight Paths}",
   BOOKTITLE = "22nd European Conference on Artificial Intelligence (ECAI)",
   SERIES = "Frontiers in Artificial Intelligence and Applications",
   VOLUME = 285,
   PUBLISHER = "IOS Press",
   PAGES = "639--645",
   YEAR = 2016
   }

@INPROCEEDINGS{BEFKL16p,
   AUTHOR = "Joan Boyar and Stephan J. Eidenbenz and Lene M. Favrholdt and Michal Kotrb\v{c}\'{\i}k and Kim S. Larsen.",
   TITLE = "{Online Dominating Set}",
   BOOKTITLE = "15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT)",
   SERIES = "Leibniz International Proceedings in Informatics (LIPIcs)",
   VOLUME = 53,
   PUBLISHER = "Schloss Dagstuhl -- Leibniz-Zentrum f{\"{u}}r Informatik GmbH",
   PAGES = "21:1--21:15",
   YEAR = 2016
   }

@INPROCEEDINGS{BEFLL16p,
   AUTHOR = "Joan Boyar and Leah Epstein and Lene M. Favrholdt and Kim S. Larsen and Asaf Levin",
   TITLE = "{Online Bounded Analysis}",
   BOOKTITLE = "11th International Computer Science Symposium in Russia (CSR)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 9691,
   PAGES = "131--145",
   PUBLISHER = "Springer",
   YEAR = 2016
   }

@INPROCEEDINGS{CFL15p,
   AUTHOR = "Marie G. Christ and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Online Multi-Coloring with Advice}",
   BOOKTITLE = "12th Workshop on Approximation and Online Algorithms (WAOA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 8952,
   PAGES = "83--94",
   PUBLISHER = "Springer",
   YEAR = 2015
   }

@INPROCEEDINGS{BKLL14p1,
   AUTHOR = "Joan Boyar and Shahin Kamali and Kim S. Larsen and
             Alejandro L{\'{o}}pez-Ortiz",
   TITLE = "{Online Bin Packing with Advice}",
   BOOKTITLE = "31st International Symposium on Theoretical Aspects of Computer Science (STACS)",
   SERIES = "Leibniz International Proceedings in Informatics (LIPIcs)",
   VOLUME = 25,
   PAGES = "174--186",
   PUBLISHER = "Schloss Dagstuhl -- Leibniz-Zentrum f{\"{u}}r Informatik GmbH",
   YEAR = 2014
   }

@INPROCEEDINGS{BKLL14p,
   AUTHOR = "Joan Boyar and Shahin Kamali and Kim S. Larsen and
             Alejandro L{\'{o}}pez-Ortiz",
   TITLE = "{On the List Update Problem with Advice}",
   BOOKTITLE = "8th International Conference on Language and Automata
                Theory and Applications (LATA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 8370,
   PAGES = "210--221",
   PUBLISHER = "Springer",
   YEAR = 2014
   }

@INPROCEEDINGS{CFL13p,
   AUTHOR = "Marie G. Christ and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Online Bin Covering: Expectations vs.\ Guarantees}",
   BOOKTITLE = "7th Annual International Conference on
                Combinatorial Optimization and Applications (COCOA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 8287,
   PAGES = "226--237",
   PUBLISHER = "Springer",
   YEAR = 2013
   }

@INPROCEEDINGS{BLM13p,
   AUTHOR = "Joan Boyar and Kim S. Larsen and Abyayananda Maiti",
   TITLE = "{The Frequent Items Problem in Online Streaming under Various Performance Measures}",
   BOOKTITLE = "19th International Symposium on Fundamentals of Computation Theory (FCT)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 8070,
   PAGES = "60--71",
   PUBLISHER = "Springer",
   YEAR = 2013
   }

@INPROCEEDINGS{BGL13p,
   AUTHOR = "Joan Boyar and Sushmita Gupta and Kim S. Larsen",
   TITLE = "{Relative Interval Analysis of Paging Algorithms on Access Graphs}",
   BOOKTITLE = "13th International Algorithms and Data Structures Symposium (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 8037,
   PAGES = "195--206",
   PUBLISHER = "Springer",
   YEAR = 2013
   }

@INPROCEEDINGS{BGL12p,
   AUTHOR = "Joan Boyar and Sushmita Gupta and Kim S. Larsen",
   TITLE = "{Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis}",
   BOOKTITLE = "13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 7357,
   PAGES = "328--339",
   PUBLISHER = "Springer",
   YEAR = 2012
   }

@INPROCEEDINGS{BLM12p,
   AUTHOR = "Joan Boyar and Kim S. Larsen and Abyayananda Maiti",
   TITLE = "{A Comparison of Performance Measures via Online Search}",
   BOOKTITLE = "Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (FAW-AAIM)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 7285,
   PAGES = "303--314",
   PUBLISHER = "Springer",
   YEAR = 2012
   }

@INPROCEEDINGS{EKL11p,
   AUTHOR = "Martin R. Ehmsen and Jens S. Kohrt and Kim S. Larsen",
   TITLE = "{List Factoring and Relative Worst Order Analysis}",
   BOOKTITLE = "8th Workshop on Approximation and Online Algorithms (WAOA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 6534,
   PAGES = "118--129",
   PUBLISHER = "Springer",
   YEAR = 2011
   }

@INPROCEEDINGS{EL10p,
   AUTHOR = "Martin R. Ehmsen and Kim S. Larsen",
   TITLE = "{Better Bounds on Online Unit Clustering}",
   BOOKTITLE = "12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 6139,
   PAGES = "371--382",
   PUBLISHER = "Springer",
   YEAR = 2010
   }

@INPROCEEDINGS{BIL09p,
   AUTHOR = "Joan Boyar and Sandy Irani and Kim S. Larsen",
   TITLE = "{A Comparison of Performance Measures for Online Algorithms}",
   BOOKTITLE = "11th International Algorithms and Data
                 Structures Symposium (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 5664,
   PAGES = "119--130",
   PUBLISHER = "Springer",
   YEAR = 2009
   }

@INPROCEEDINGS{BEL06p,
   AUTHOR = "Joan Boyar and Martin R. Ehmsen and Kim S. Larsen",
   TITLE = "{Theoretical Evidence for the Superiority of
             LRU-2 over LRU for the Paging Problem}",
   BOOKTITLE = "4th Workshop on Approximation and Online Algorithms (WAOA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 4368,
   PAGES = "95--107",
   PUBLISHER = "Springer",
   YEAR = 2006
   }

@INPROCEEDINGS{CSL06p,
   AUTHOR = "Marco Chiarandini and Thomas St{\"{u}}tzle and Kim S. Larsen",
   TITLE = "{Colour Reassignment in Tabu Search for the Graph Set
             T-Colouring Problem}",
   BOOKTITLE = "3rd International Workshop on Hybrid Metaheuristics (HM)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 4030,
   PAGES = "162--177",
   PUBLISHER = "Springer",
   YEAR = 2006
   }

@INPROCEEDINGS{BEFKLPW05p,
   AUTHOR = "Joan Boyar and Leah Epstein and Lene M. Favrholdt and
             Jens S. Kohrt and Kim S. Larsen and Morten Monrad Pedersen
             and Sanne W{\o{}}hlk",
   TITLE = "{The Maximum Resource Bin Packing Problem}",
   BOOKTITLE = "15th International Symposium on Fundamentals
                of Computation Theory (FCT)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 3623,
   PAGES = "397--408",
   PUBLISHER = "Springer",
   YEAR = 2005
   }

@INPROCEEDINGS{BFL05p,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{The Relative Worst Order Ratio Applied to Paging}",
   BOOKTITLE = "16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)",
   PAGES = "718--727",
   PUBLISHER = "ACM Press",
   YEAR = 2005
   }

@INPROCEEDINGS{BBL04p,
   AUTHOR = "Allan Borodin and Joan Boyar and Kim S. Larsen",
   TITLE = "{Priority Algorithms for Graph Optimization Problems}",
   BOOKTITLE = "2nd Workshop on Approximation and Online Algorithms (WAOA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 3351,
   PAGES = "126--139",
   PUBLISHER = "Springer",
   YEAR = 2005,
   }

@INPROCEEDINGS{FL03p,
   AUTHOR = "Jens S. Frederiksen and Kim S. Larsen",
   TITLE = "{On-Line Seat Reservations via Off-Line Seating Arrangements}",
   BOOKTITLE = "8th International Workshop on Algorithms and Data Structures (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 2748,
   PAGES = "174--185",
   PUBLISHER = "Springer",
   YEAR = 2003
   }

@INPROCEEDINGS{BFLN02p,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen and
             Morten N. Nielsen",
   TITLE = "{Extending the Accommodating Function}",
   BOOKTITLE = "8th Annual International Computing and Combinatorics
                Conference (COCOON)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 2387,
   PAGES = "87--96",
   PUBLISHER = "Springer",
   YEAR = 2002
   }

@INPROCEEDINGS{FL02p,
   AUTHOR = "Jens S. Frederiksen and Kim S. Larsen",
   TITLE = "{Packet Bundling}",
   BOOKTITLE = "8th Scandinavian Workshop on Algorithm Theory (SWAT)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 2368,
   PAGES = "328--337",
   PUBLISHER = "Springer",
   YEAR = 2002
   }

@INPROCEEDINGS{JL01p1,
   AUTHOR = "Lars Jacobsen and Kim S. Larsen",
   TITLE = "{Exponentially Decreasing Number of Operations in Balanced Trees}",
   BOOKTITLE = "7th Italian Conference on Theoretical Computer Science (ICTCS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 2202,
   PAGES = "293--311",
   PUBLISHER = "Springer",
   YEAR = 2001
   }

@INPROCEEDINGS{JL01p,
   AUTHOR = "Lars Jacobsen and Kim S. Larsen",
   TITLE = "{Complexity of Layered Binary Search Trees with Relaxed Balance}",
   BOOKTITLE = "7th Italian Conference on Theoretical Computer Science (ICTCS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 2202,
   PAGES = "269--284",
   PUBLISHER = "Springer",
   YEAR = 2001
   }

@INPROCEEDINGS{FJL01p,
   AUTHOR = "Rolf Fagerberg and Rune E. Jensen and Kim S. Larsen",
   TITLE = "{Search Trees with Relaxed Balance and Near-Optimal Height}",
   BOOKTITLE = "7th International Workshop on Algorithms and Data
                 Structures (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 2125,
   PAGES = "414--425",
   PUBLISHER = "Springer",
   YEAR = 2001
   }

@INPROCEEDINGS{L01p,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{Relaxed Multi-Way Trees with Group Updates}",
   BOOKTITLE = "20th ACM SIGACT-SIGMOD-SIGART
                Symposium on Principles of Database Systems (PODS)",
   PUBLISHER = "ACM Press",
   PAGES = "93--101",
   YEAR = 2001,
   NOTE = "Best newcomer award."
   }

@INPROCEEDINGS{BBJLL00p,
   AUTHOR = "Eric Bach and Joan Boyar and Tao Jiang and Kim S. Larsen
             and Guo-Hui Lin",
   TITLE = "{Better Bounds on the Accommodating Ratio for the Seat
             Reservation Problem}",
   BOOKTITLE = "6th Annual International Computing and Combinatorics
                Conference (COCOON)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 1858,
   PAGES = "221--231",
   PUBLISHER = "Springer",
   YEAR = 2000
   }

@INPROCEEDINGS{ABFLN00p,
   AUTHOR = "Yossi Azar and Joan Boyar and Lene M. Favrholdt and Kim S. Larsen
             and Morten N. Nielsen",
   TITLE = "{Fair versus Unrestricted Bin Packing}",
   BOOKTITLE = "7th Scandinavian Workshop on Algorithm Theory (SWAT)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 1851,
   PAGES = "200--213",
   PUBLISHER = "Springer",
   YEAR = 2000
   }

@INPROCEEDINGS{BLN99p,
   AUTHOR = "Joan Boyar and Kim S. Larsen and Morten N. Nielsen",
   TITLE = "{The Accommodating Function:
             a generalization of the competitive ratio}",
   BOOKTITLE = "6th International Workshop on Algorithms and Data
                Structures (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 1663,
   PAGES = "74--79",
   PUBLISHER = "Springer",
   YEAR = 1999
   }

@INPROCEEDINGS{L98p,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{Partially Persistent Binary Search Trees with Transcript
             Operations}",
   BOOKTITLE = "15th Annual Symposium on Theoretical Aspects of
                Computer Science (STACS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 1373,
   PAGES = "350--363",
   PUBLISHER = "Springer",
   YEAR = 1998
   }

@INPROCEEDINGS{LOS97p,
   AUTHOR = "Kim S. Larsen and Thomas Ottmann and Eljas Soisalon-Soininen",
   TITLE = "{Relaxed Balance for Search Trees with Local Rebalancing}",
   BOOKTITLE = "5th Annual European Symposium on Algorithms (ESA)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 1284,
   PAGES = "350--363",
   PUBLISHER = "Springer",
   YEAR = 1997
   }

@INPROCEEDINGS{LSW97p,
   AUTHOR = "Kim S. Larsen and Eljas Soisalon-Soininen and Peter Widmayer",
   TITLE = "{Relaxed Balance through Standard Rotations}",
   BOOKTITLE = "5th International Workshop on Algorithms and Data
                 Structures (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 1272,
   PAGES = "450--461",
   PUBLISHER = "Springer",
   YEAR = 1997
   }

@INPROCEEDINGS{EL95p,
   AUTHOR = "Uffe Engberg and Kim S. Larsen",
   TITLE = "{Efficient Simplification of Bisimulation Formulas}",
   BOOKTITLE = "1st International Workshop on Tools and Algorithms for the
                Construction and Analysis of Systems (TACAS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 1019,
   PAGES = "111--132",
   PUBLISHER = "Springer",
   YEAR = 1995
   }

@INPROCEEDINGS{BFL95p,
   AUTHOR = "Joan Boyar and Rolf Fagerberg and Kim S. Larsen",
   TITLE = "{Amortization Results for Chromatic Search Trees,
             with an Application to Priority Queues}",
   BOOKTITLE = "4th International Workshop on Algorithms and
                Data Structures (WADS)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 955,
   PAGES = "270--281",
   PUBLISHER = "Springer",
   YEAR = 1995
   }

@INPROCEEDINGS{LF95p,
   AUTHOR = "Kim S. Larsen and Rolf Fagerberg",
   TITLE = "{B-Trees with Relaxed Balance}",
   BOOKTITLE = "9th International Parallel Processing Symposium (IPPS)",
   PAGES = "196--202",
   PUBLISHER = "IEEE Computer Society Press",
   YEAR = 1995
   }

@INPROCEEDINGS{L94p,
   AUTHOR = "Kim S. Larsen",
   TITLE = "{AVL Trees with Relaxed Balance}",
   BOOKTITLE = "8th International Parallel Processing Symposium (IPPS)",
   PAGES = "888--893",
   PUBLISHER = "IEEE Computer Society Press",
   YEAR = 1994
   }

@INPROCEEDINGS{BL92p,
   AUTHOR = "Joan F. Boyar and Kim S. Larsen",
   TITLE = "{Efficient Rebalancing of Chromatic Search Trees}",
   BOOKTITLE = "3rd Scandinavian Workshop on Algorithm Theory (SWAT)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 621,
   PAGES = "151--164",
   PUBLISHER = "Springer",
   YEAR = 1992
   }

@INPROCEEDINGS{NEL89p,
   AUTHOR = "Mogens Nielsen and Uffe Engberg and Kim S. Larsen",
   TITLE = "{Fully Abstract Models for a Process Language with Refinement}",
   BOOKTITLE = "REX: Linear Time, Branching Time and Partial Order
                in Logics and Models of Concurrency (REX)",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 354,
   PAGES = "523--548",
   PUBLISHER = "Springer",
   YEAR = 1989
   }


% SECTION invitations Contributions by Invitation

@INPROCEEDINGS{BFL18i,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen",
   TITLE = "{Relative Worst-Order Analysis: A Survey}",
   BOOKTITLE = "Adventures Between Lower Bounds and Higher Altitudes
                -- Essays Dedicated to Juraj Hromkovič
                   on the Occasion of His 60th Birthday",
   SERIES = "Lecture Notes in Computer Science",
   VOLUME = 11011,
   PUBLISHER = "Springer",
   PAGES = "216--230",
   YEAR = 2018
   }

@ARTICLE{BFKLM16i,
   AUTHOR = "Joan Boyar and Lene M. Favrholdt and Christian Kudahl
             and Kim S. Larsen and Jesper W. Mikkelsen",
   TITLE = "{Online Algorithms with Advice: A Survey}",
   JOURNAL = "ACM SIGACT News",
   VOLUME = 47,
   NUMBER = 3,
   YEAR = 2016,
   PAGES = "93--129"
   }

@INPROCEEDINGS{AFL05b,
   AUTHOR = "Arne Andersson and Rolf Fagerberg and Kim S. Larsen",
   TITLE = "{Balanced Binary Search Trees}",
   CHAPTER = 10,
   BOOKTITLE = "Handbook of Data Structures and Applications",
   EDITOR = "Dinesh P. Mehta and Sartaj Sahni",
   SERIES = "Chapman \& Hall/CRC Computer \& Information Science Series",
   PUBLISHER = "CRC Press",
   ISBN = "1-58488-435-5",
   YEAR = 2005,
   PAGES = "{\bf 10}-1--{\bf 10}-28"
   }

@BOOK{L01b,
   TITLE = "Dictionary of Computer Science, Engineering, and Technology",
   EDITOR = "Philip A. Laplante",
   PUBLISHER = "CRC Press",
   YEAR = 2001,
   ISBN = "0849326915",
   NOTE = "One of 58 contributors."
   }