default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Kim S. Larsen
@article{DBLP:journals/algorithmica/BoyarFL24,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online Unit Profit Knapsack with Predictions},
journal = {Algorithmica},
volume = {86},
number = {9},
pages = {2786--2821},
year = {2024},
url = {https://doi.org/10.1007/s00453-024-01239-y},
doi = {10.1007/S00453-024-01239-Y},
timestamp = {Tue, 10 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarFL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarLP24,
author = {Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice complexity of adaptive priority algorithms},
journal = {Theor. Comput. Sci.},
volume = {984},
pages = {114318},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114318},
doi = {10.1016/J.TCS.2023.114318},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarLP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarKLLLP24,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Ali Mohammad Lavasani and
Yaqiao Li and
Denis Pankratov},
editor = {Hans L. Bodlaender},
title = {On the Online Weighted Non-Crossing Matching Problem},
booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2024, June 12-14, 2024, Helsinki, Finland},
series = {LIPIcs},
volume = {294},
pages = {16:1--16:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2024.16},
doi = {10.4230/LIPICS.SWAT.2024.16},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarKLLLP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2406-18265,
author = {Magnus Berg and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Complexity Classes for Online Problems with and without Predictions},
journal = {CoRR},
volume = {abs/2406.18265},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2406.18265},
doi = {10.48550/ARXIV.2406.18265},
eprinttype = {arXiv},
eprint = {2406.18265},
timestamp = {Mon, 22 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2406-18265.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/0001B0FHL0S23,
author = {Antonios Antoniadis and
Joan Boyar and
Marek Eli{\'{a}}s and
Lene Monrad Favrholdt and
Ruben Hoeksma and
Kim S. Larsen and
Adam Polak and
Bertrand Simon},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Paging with Succinct Predictions},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {952--968},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/antoniadis23a.html},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/0001B0FHL0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latincrypt/BoyarELN23,
author = {Joan Boyar and
Simon Erfurth and
Kim S. Larsen and
Ruben Niederhagen},
editor = {Abdelrahaman Aly and
Mehdi Tibouchi},
title = {Quotable Signatures for Authenticating Shared Quotes},
booktitle = {Progress in Cryptology - {LATINCRYPT} 2023 - 8th International Conference
on Cryptology and Information Security in Latin America, {LATINCRYPT}
2023, Quito, Ecuador, October 3-6, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14168},
pages = {273--292},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-44469-2\_14},
doi = {10.1007/978-3-031-44469-2\_14},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latincrypt/BoyarELN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BergBFL23,
author = {Magnus Berg and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
editor = {Pat Morin and
Subhash Suri},
title = {Online Minimum Spanning Trees with Weight Predictions},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {136--148},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_10},
doi = {10.1007/978-3-031-38906-1\_10},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BergBFL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarFKL23,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
editor = {Pat Morin and
Subhash Suri},
title = {Online Interval Scheduling with Predictions},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {193--207},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_14},
doi = {10.1007/978-3-031-38906-1\_14},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarFKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-12029,
author = {Magnus Berg and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online Minimum Spanning Trees with Weight Predictions},
journal = {CoRR},
volume = {abs/2302.12029},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.12029},
doi = {10.48550/ARXIV.2302.12029},
eprinttype = {arXiv},
eprint = {2302.12029},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-12029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-13701,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
title = {Online Interval Scheduling with Predictions},
journal = {CoRR},
volume = {abs/2302.13701},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.13701},
doi = {10.48550/ARXIV.2302.13701},
eprinttype = {arXiv},
eprint = {2302.13701},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-13701.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarFKL22,
author = {Joan Boyar and
Lene M. Favrholdt and
Michal Kotrbc{\'{\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},
url = {https://doi.org/10.1007/s00453-022-00944-w},
doi = {10.1007/S00453-022-00944-W},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarFKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/BoyarFL21,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Relative Worst-order Analysis: {A} Survey},
journal = {{ACM} Comput. Surv.},
volume = {54},
number = {1},
pages = {8:1--8:21},
year = {2022},
url = {https://doi.org/10.1145/3425910},
doi = {10.1145/3425910},
timestamp = {Wed, 23 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/BoyarFL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarFL22,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
editor = {Artur Czumaj and
Qin Xin},
title = {Online Unit Profit Knapsack with Untrusted Predictions},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.20},
doi = {10.4230/LIPICS.SWAT.2022.20},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarFL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-00285,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online Unit Profit Knapsack with Untrusted Predictions},
journal = {CoRR},
volume = {abs/2203.00285},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.00285},
doi = {10.48550/ARXIV.2203.00285},
eprinttype = {arXiv},
eprint = {2203.00285},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-00285.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-02636,
author = {Lu{\'{\i}}s Cruz{-}Filipe and
Kim S. Larsen and
Fabrizio Montesi and
Larisa Safina},
title = {Implementing Choreography Extraction},
journal = {CoRR},
volume = {abs/2205.02636},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.02636},
doi = {10.48550/ARXIV.2205.02636},
eprinttype = {arXiv},
eprint = {2205.02636},
timestamp = {Wed, 11 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-02636.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-02775,
author = {Antonios Antoniadis and
Joan Boyar and
Marek Eli{\'{a}}s and
Lene M. Favrholdt and
Ruben Hoeksma and
Kim S. Larsen and
Adam Polak and
Bertrand Simon},
title = {Paging with Succinct Predictions},
journal = {CoRR},
volume = {abs/2210.02775},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.02775},
doi = {10.48550/ARXIV.2210.02775},
eprinttype = {arXiv},
eprint = {2210.02775},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-02775.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-10963,
author = {Joan Boyar and
Simon Erfurth and
Kim S. Larsen and
Ruben Niederhagen},
title = {Quotable Signatures for Authenticating Shared Quotes},
journal = {CoRR},
volume = {abs/2212.10963},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.10963},
doi = {10.48550/ARXIV.2212.10963},
eprinttype = {arXiv},
eprint = {2212.10963},
timestamp = {Wed, 04 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-10963.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarFKL21,
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},
url = {https://doi.org/10.1007/s00453-020-00728-0},
doi = {10.1007/S00453-020-00728-0},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarFKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoyarEL20,
author = {Joan Boyar and
Faith Ellen and
Kim S. Larsen},
title = {Randomized distributed online algorithms against adaptive offline
adversaries},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105973},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105973},
doi = {10.1016/J.IPL.2020.105973},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BoyarEL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BorodinBLP20,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice Complexity of Priority Algorithms},
journal = {Theory Comput. Syst.},
volume = {64},
number = {4},
pages = {593--625},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09955-7},
doi = {10.1007/S00224-019-09955-7},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BorodinBLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarEFKL19,
author = {Joan Boyar and
Stephan J. Eidenbenz and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
title = {Online Dominating Set},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1938--1964},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0519-1},
doi = {10.1007/S00453-018-0519-1},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarEFKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarFKL19,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Online Bin Covering with Advice},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {225--238},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_17},
doi = {10.1007/978-3-030-24766-9\_17},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarFKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00066,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
title = {Online Bin Covering with Advice},
journal = {CoRR},
volume = {abs/1905.00066},
year = {2019},
url = {http://arxiv.org/abs/1905.00066},
eprinttype = {arXiv},
eprint = {1905.00066},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00066.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00868,
author = {Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice Complexity of Adaptive Priority Algorithms},
journal = {CoRR},
volume = {abs/1910.00868},
year = {2019},
url = {http://arxiv.org/abs/1910.00868},
eprinttype = {arXiv},
eprint = {1910.00868},
timestamp = {Fri, 04 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-00868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarEFLL18,
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},
url = {https://doi.org/10.1007/s00453-017-0386-1},
doi = {10.1007/S00453-017-0386-1},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarEFLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nc/HansenLMM18,
author = {Bjarke N. Hansen and
Kim S. Larsen and
Daniel Merkle and
Alexei Mihalchuk},
title = {DNA-templated synthesis optimization},
journal = {Nat. Comput.},
volume = {17},
number = {4},
pages = {693--707},
year = {2018},
url = {https://doi.org/10.1007/s11047-018-9697-7},
doi = {10.1007/S11047-018-9697-7},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nc/HansenLMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BoyarEFLL18,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
title = {Online-bounded analysis},
journal = {J. Sched.},
volume = {21},
number = {4},
pages = {429--441},
year = {2018},
url = {https://doi.org/10.1007/s10951-017-0536-y},
doi = {10.1007/S10951-017-0536-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BoyarEFLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BoyarFL18,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
editor = {Hans{-}Joachim B{\"{o}}ckenhauer and
Dennis Komm and
Walter Unger},
title = {Relative Worst-Order Analysis: {A} Survey},
booktitle = {Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated
to Juraj Hromkovi{\v{c}} on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {11011},
pages = {216--230},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-98355-4\_13},
doi = {10.1007/978-3-319-98355-4\_13},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/BoyarFL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/KnudsenCL18,
author = {Anders Nicolai Knudsen and
Marco Chiarandini and
Kim S. Larsen},
editor = {Willem Jan van Hoeve},
title = {Heuristic Variants of {A} {\^{}}* Search for 3D Flight Planning},
booktitle = {Integration of Constraint Programming, Artificial Intelligence, and
Operations Research - 15th International Conference, {CPAIOR} 2018,
Delft, The Netherlands, June 26-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10848},
pages = {361--376},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-93031-2\_26},
doi = {10.1007/978-3-319-93031-2\_26},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/KnudsenCL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BorodinBLP18,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Advice Complexity of Priority Algorithms},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {69--86},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_5},
doi = {10.1007/978-3-030-04693-4\_5},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BorodinBLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07080,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Relative Worst-Order Analysis: {A} Survey},
journal = {CoRR},
volume = {abs/1802.07080},
year = {2018},
url = {http://arxiv.org/abs/1802.07080},
eprinttype = {arXiv},
eprint = {1802.07080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-06223,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice Complexity of Priority Algorithms},
journal = {CoRR},
volume = {abs/1806.06223},
year = {2018},
url = {http://arxiv.org/abs/1806.06223},
eprinttype = {arXiv},
eprint = {1806.06223},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-06223.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06820,
author = {Joan Boyar and
Faith Ellen and
Kim S. Larsen},
title = {The Scheduler is Very Powerful in Competitive Analysis of Distributed
List Accessing},
journal = {CoRR},
volume = {abs/1807.06820},
year = {2018},
url = {http://arxiv.org/abs/1807.06820},
eprinttype = {arXiv},
eprint = {1807.06820},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06820.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/BoyarFKLM17,
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} Comput. Surv.},
volume = {50},
number = {2},
pages = {19:1--19:34},
year = {2017},
url = {https://doi.org/10.1145/3056461},
doi = {10.1145/3056461},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/csur/BoyarFKLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BoyarKLL17,
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 = {Inf. Comput.},
volume = {253},
pages = {411--423},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2016.06.007},
doi = {10.1016/J.IC.2016.06.007},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BoyarKLL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/Cruz-FilipeLS17,
author = {Lu{\'{\i}}s Cruz{-}Filipe and
Kim S. Larsen and
Peter Schneider{-}Kamp},
title = {Formally Proving Size Optimality of Sorting Networks},
journal = {J. Autom. Reason.},
volume = {59},
number = {4},
pages = {425--454},
year = {2017},
url = {https://doi.org/10.1007/s10817-017-9405-9},
doi = {10.1007/S10817-017-9405-9},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/Cruz-FilipeLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/JensenCL17,
author = {Casper Kehlet Jensen and
Marco Chiarandini and
Kim S. Larsen},
editor = {Gianlorenzo D'Angelo and
Twan Dollevoet},
title = {Flight Planning in Free Route Airspaces},
booktitle = {17th Workshop on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems, {ATMOS} 2017, September 7-8, 2017, Vienna,
Austria},
series = {OASIcs},
volume = {59},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/OASIcs.ATMOS.2017.14},
doi = {10.4230/OASICS.ATMOS.2017.14},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/atmos/JensenCL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/KnudsenCL17,
author = {Anders Nicolai Knudsen and
Marco Chiarandini and
Kim S. Larsen},
editor = {J. Christopher Beck},
title = {Constraint Handling in Flight Planning},
booktitle = {Principles and Practice of Constraint Programming - 23rd International
Conference, {CP} 2017, Melbourne, VIC, Australia, August 28 - September
1, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10416},
pages = {354--369},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66158-2\_23},
doi = {10.1007/978-3-319-66158-2\_23},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/KnudsenCL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dna/HansenLMM17,
author = {Bjarke N. Hansen and
Kim S. Larsen and
Daniel Merkle and
Alexei Mihalchuk},
editor = {Robert Brijder and
Lulu Qian},
title = {DNA-Templated Synthesis Optimization},
booktitle = {{DNA} Computing and Molecular Programming - 23rd International Conference,
{DNA} 23, Austin, TX, USA, September 24-28, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10467},
pages = {17--32},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66799-7\_2},
doi = {10.1007/978-3-319-66799-7\_2},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dna/HansenLMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fossacs/Cruz-FilipeLM17,
author = {Lu{\'{\i}}s Cruz{-}Filipe and
Kim S. Larsen and
Fabrizio Montesi},
editor = {Javier Esparza and
Andrzej S. Murawski},
title = {The Paths to Choreography Extraction},
booktitle = {Foundations of Software Science and Computation Structures - 20th
International Conference, {FOSSACS} 2017, Held as Part of the European
Joint Conferences on Theory and Practice of Software, {ETAPS} 2017,
Uppsala, Sweden, April 22-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10203},
pages = {424--440},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-54458-7\_25},
doi = {10.1007/978-3-662-54458-7\_25},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fossacs/Cruz-FilipeLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itp/Cruz-FilipeLS17,
author = {Lu{\'{\i}}s Cruz{-}Filipe and
Kim S. Larsen and
Peter Schneider{-}Kamp},
editor = {Mauricio Ayala{-}Rinc{\'{o}}n and
C{\'{e}}sar A. Mu{\~{n}}oz},
title = {How to Get More Out of Your Oracles},
booktitle = {Interactive Theorem Proving - 8th International Conference, {ITP}
2017, Bras{\'{\i}}lia, Brazil, September 26-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10499},
pages = {164--170},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66107-0\_11},
doi = {10.1007/978-3-319-66107-0\_11},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/itp/Cruz-FilipeLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarFKL17,
author = {Joan Boyar and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Relaxing the Irrevocability Requirement for Online Graph Algorithms},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {217--228},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_19},
doi = {10.1007/978-3-319-62127-2\_19},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarFKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarFLK17,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Michal Kotrbc{\'{\i}}k},
title = {Relaxing the Irrevocability Requirement for Online Graph Algorithms},
journal = {CoRR},
volume = {abs/1704.08835},
year = {2017},
url = {http://arxiv.org/abs/1704.08835},
eprinttype = {arXiv},
eprint = {1704.08835},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarFLK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarKLL16,
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},
url = {https://doi.org/10.1007/s00453-014-9955-8},
doi = {10.1007/S00453-014-9955-8},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarKLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/BoyarFKLM16,
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 = {{SIGACT} News},
volume = {47},
number = {3},
pages = {93--129},
year = {2016},
url = {https://doi.org/10.1145/2993749.2993766},
doi = {10.1145/2993749.2993766},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/BoyarFKLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BoyarEFLL16,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
editor = {Alexander S. Kulikov and
Gerhard J. Woeginger},
title = {Online Bounded Analysis},
booktitle = {Computer Science - Theory and Applications - 11th International Computer
Science Symposium in Russia, {CSR} 2016, St. Petersburg, Russia, June
9-13, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9691},
pages = {131--145},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-34171-2\_10},
doi = {10.1007/978-3-319-34171-2\_10},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/BoyarEFLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/KnudsenCL16,
author = {Anders Nicolai Knudsen and
Marco Chiarandini and
Kim S. Larsen},
editor = {Gal A. Kaminka and
Maria Fox and
Paolo Bouquet and
Eyke H{\"{u}}llermeier and
Virginia Dignum and
Frank Dignum and
Frank van Harmelen},
title = {Vertical Optimization of Resource Dependent Flight Paths},
booktitle = {{ECAI} 2016 - 22nd European Conference on Artificial Intelligence,
29 August-2 September 2016, The Hague, The Netherlands - Including
Prestigious Applications of Artificial Intelligence {(PAIS} 2016)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {285},
pages = {639--645},
publisher = {{IOS} Press},
year = {2016},
url = {https://doi.org/10.3233/978-1-61499-672-9-639},
doi = {10.3233/978-1-61499-672-9-639},
timestamp = {Tue, 02 Nov 2021 15:59:05 +0100},
biburl = {https://dblp.org/rec/conf/ecai/KnudsenCL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarEFKL16,
author = {Joan Boyar and
Stephan J. Eidenbenz and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
editor = {Rasmus Pagh},
title = {Online Dominating Set},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.21},
doi = {10.4230/LIPICS.SWAT.2016.21},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarEFKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BoyarEFLL16,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
editor = {Klaus Jansen and
Monaldo Mastrolilli},
title = {Batch Coloring of Graphs},
booktitle = {Approximation and Online Algorithms - 14th International Workshop,
{WAOA} 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10138},
pages = {52--64},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-51741-4\_5},
doi = {10.1007/978-3-319-51741-4\_5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BoyarEFLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarEFLL16,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
title = {Online Bounded Analysis},
journal = {CoRR},
volume = {abs/1602.06708},
year = {2016},
url = {http://arxiv.org/abs/1602.06708},
eprinttype = {arXiv},
eprint = {1602.06708},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarEFLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarEFKL16,
author = {Joan Boyar and
Stephan J. Eidenbenz and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
title = {Online Dominating Set},
journal = {CoRR},
volume = {abs/1604.05172},
year = {2016},
url = {http://arxiv.org/abs/1604.05172},
eprinttype = {arXiv},
eprint = {1604.05172},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarEFKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarEFLL16a,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
title = {Batch Coloring of Graphs},
journal = {CoRR},
volume = {abs/1610.02997},
year = {2016},
url = {http://arxiv.org/abs/1610.02997},
eprinttype = {arXiv},
eprint = {1610.02997},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarEFLL16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cruz-FilipeLM16,
author = {Lu{\'{\i}}s Cruz{-}Filipe and
Kim S. Larsen and
Fabrizio Montesi},
title = {The Paths to Choreography Extraction},
journal = {CoRR},
volume = {abs/1610.10050},
year = {2016},
url = {http://arxiv.org/abs/1610.10050},
eprinttype = {arXiv},
eprint = {1610.10050},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Cruz-FilipeLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarIL15,
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},
url = {https://doi.org/10.1007/s00453-014-9884-6},
doi = {10.1007/S00453-014-9884-6},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarIL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BoyarLM15,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
title = {The Frequent Items Problem in Online Streaming Under Various Performance
Measures},
journal = {Int. J. Found. Comput. Sci.},
volume = {26},
number = {4},
pages = {413--440},
year = {2015},
url = {https://doi.org/10.1142/S0129054115500239},
doi = {10.1142/S0129054115500239},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BoyarLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ChristensenKL15,
author = {Jan Christensen and
Anders Nicolai Knudsen and
Kim S. Larsen},
title = {Soccer is Harder Than Football},
journal = {Int. J. Found. Comput. Sci.},
volume = {26},
number = {4},
pages = {477--486},
year = {2015},
url = {https://doi.org/10.1142/S0129054115500264},
doi = {10.1142/S0129054115500264},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ChristensenKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarGL15,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
title = {Relative interval analysis of paging algorithms on access graphs},
journal = {Theor. Comput. Sci.},
volume = {568},
pages = {28--48},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.11.035},
doi = {10.1016/J.TCS.2014.11.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChristFL15,
author = {Marie G. Christ and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online multi-coloring with advice},
journal = {Theor. Comput. Sci.},
volume = {596},
pages = {79--91},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.044},
doi = {10.1016/J.TCS.2015.06.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChristFL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarLM14,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
title = {A comparison of performance measures via online search},
journal = {Theor. Comput. Sci.},
volume = {532},
pages = {2--13},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.07.022},
doi = {10.1016/J.TCS.2013.07.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChristFL14,
author = {Marie G. Christ and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online bin covering: Expectations vs. guarantees},
journal = {Theor. Comput. Sci.},
volume = {556},
pages = {71--84},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.06.029},
doi = {10.1016/J.TCS.2014.06.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChristFL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BoyarKLL14,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro L{\'{o}}pez{-}Ortiz},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide and
Jos{\'{e}} Luis Sierra{-}Rodr{\'{\i}}guez and
Bianca Truthe},
title = {On the List Update Problem with Advice},
booktitle = {Language and Automata Theory and Applications - 8th International
Conference, {LATA} 2014, Madrid, Spain, March 10-14, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8370},
pages = {210--221},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04921-2\_17},
doi = {10.1007/978-3-319-04921-2\_17},
timestamp = {Sun, 02 Oct 2022 16:11:11 +0200},
biburl = {https://dblp.org/rec/conf/lata/BoyarKLL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BoyarKLL14,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro L{\'{o}}pez{-}Ortiz},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Online Bin Packing with Advice},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {174--186},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.174},
doi = {10.4230/LIPICS.STACS.2014.174},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BoyarKLL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ChristFL14,
author = {Marie G. Christ and
Lene M. Favrholdt and
Kim S. Larsen},
editor = {Evripidis Bampis and
Ola Svensson},
title = {Online Multi-Coloring with Advice},
booktitle = {Approximation and Online Algorithms - 12th International Workshop,
{WAOA} 2014, Wroc{\l}aw, Poland, September 11-12, 2014, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8952},
pages = {83--94},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-18263-6\_8},
doi = {10.1007/978-3-319-18263-6\_8},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ChristFL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChristFL14,
author = {Marie G. Christ and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online Multi-Coloring with Advice},
journal = {CoRR},
volume = {abs/1409.1722},
year = {2014},
url = {http://arxiv.org/abs/1409.1722},
eprinttype = {arXiv},
eprint = {1409.1722},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChristFL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/ChristFL13,
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},
url = {https://doi.org/10.1007/s00236-013-0184-4},
doi = {10.1007/S00236-013-0184-4},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/ChristFL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EhmsenKL13,
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},
url = {https://doi.org/10.1007/s00453-012-9637-3},
doi = {10.1007/S00453-012-9637-3},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EhmsenKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/EhmsenL13,
author = {Martin R. Ehmsen and
Kim S. Larsen},
title = {A Technique for Exact Computation of precoloring Extension on Interval
Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {24},
number = {1},
pages = {109--122},
year = {2013},
url = {https://doi.org/10.1142/S0129054113500020},
doi = {10.1142/S0129054113500020},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/EhmsenL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EhmsenL13,
author = {Martin R. Ehmsen and
Kim S. Larsen},
title = {Better bounds on online unit clustering},
journal = {Theor. Comput. Sci.},
volume = {500},
pages = {1--24},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.07.008},
doi = {10.1016/J.TCS.2013.07.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EhmsenL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ChristFL13,
author = {Marie G. Christ and
Lene M. Favrholdt and
Kim S. Larsen},
editor = {Peter Widmayer and
Yinfeng Xu and
Binhai Zhu},
title = {Online Bin Covering: Expectations vs. Guarantees},
booktitle = {Combinatorial Optimization and Applications - 7th International Conference,
{COCOA} 2013, Chengdu, China, December 12-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8287},
pages = {226--237},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03780-6\_20},
doi = {10.1007/978-3-319-03780-6\_20},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ChristFL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BoyarLM13,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
editor = {Leszek Gasieniec and
Frank Wolter},
title = {The Frequent Items Problem in Online Streaming under Various Performance
Measures},
booktitle = {Fundamentals of Computation Theory - 19th International Symposium,
{FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8070},
pages = {60--71},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40164-0\_9},
doi = {10.1007/978-3-642-40164-0\_9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/BoyarLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarGL13,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Relative Interval Analysis of Paging Algorithms on Access Graphs},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {195--206},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_17},
doi = {10.1007/978-3-642-40104-6\_17},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0669,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
title = {Relative Interval Analysis of Paging Algorithms on Access Graphs},
journal = {CoRR},
volume = {abs/1305.0669},
year = {2013},
url = {http://arxiv.org/abs/1305.0669},
eprinttype = {arXiv},
eprint = {1305.0669},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-0669.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarLM13,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
title = {The Frequent Items Problem in Online Streaming under Various Performance
Measures},
journal = {CoRR},
volume = {abs/1306.0771},
year = {2013},
url = {http://arxiv.org/abs/1306.0771},
eprinttype = {arXiv},
eprint = {1306.0771},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChristFL13,
author = {Marie G. Christ and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online Bin Covering: Expectations vs. Guarantees},
journal = {CoRR},
volume = {abs/1309.6477},
year = {2013},
url = {http://arxiv.org/abs/1309.6477},
eprinttype = {arXiv},
eprint = {1309.6477},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChristFL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarKLL13,
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 = {CoRR},
volume = {abs/1311.7357},
year = {2013},
url = {http://arxiv.org/abs/1311.7357},
eprinttype = {arXiv},
eprint = {1311.7357},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarKLL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BoyarLM12,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
editor = {Jack Snoeyink and
Pinyan Lu and
Kaile Su and
Lusheng Wang},
title = {A Comparison of Performance Measures via Online Search},
booktitle = {Frontiers in Algorithmics and Algorithmic Aspects in Information and
Management - Joint International Conference, {FAW-AAIM} 2012, Beijing,
China, May 14-16, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7285},
pages = {303--314},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29700-7\_28},
doi = {10.1007/978-3-642-29700-7\_28},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/BoyarLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarGL12,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Access Graphs Results for {LRU} versus {FIFO} under Relative Worst
Order Analysis},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {328--339},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_29},
doi = {10.1007/978-3-642-31155-0\_29},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarGL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-4047,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
title = {Access Graphs Results for {LRU} versus {FIFO} under Relative Worst
Order Analysis},
journal = {CoRR},
volume = {abs/1204.4047},
year = {2012},
url = {http://arxiv.org/abs/1204.4047},
eprinttype = {arXiv},
eprint = {1204.4047},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-4047.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-4016,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {Online Bin Packing with Advice},
journal = {CoRR},
volume = {abs/1212.4016},
year = {2012},
url = {http://arxiv.org/abs/1212.4016},
eprinttype = {arXiv},
eprint = {1212.4016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-4016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-6136,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
title = {A Comparison of Performance Measures via Online Search},
journal = {CoRR},
volume = {abs/1106.6136},
year = {2011},
url = {http://arxiv.org/abs/1106.6136},
eprinttype = {arXiv},
eprint = {1106.6136},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-6136.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BoyarEKL10,
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},
url = {https://doi.org/10.1007/s00236-010-0123-6},
doi = {10.1007/S00236-010-0123-6},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/BoyarEKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LarsenW10,
author = {Kim S. Larsen and
Sanne W{\o}hlk},
title = {Competitive analysis of the online inventory problem},
journal = {Eur. J. Oper. Res.},
volume = {207},
number = {2},
pages = {685--696},
year = {2010},
url = {https://doi.org/10.1016/j.ejor.2010.05.019},
doi = {10.1016/J.EJOR.2010.05.019},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LarsenW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BorodinBLM10,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Nazanin Mirmohammadi},
title = {Priority algorithms for graph optimization problems},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {1},
pages = {239--258},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.09.033},
doi = {10.1016/J.TCS.2009.09.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BorodinBLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EhmsenL10,
author = {Martin R. Ehmsen and
Kim S. Larsen},
editor = {Haim Kaplan},
title = {Better Bounds on Online Unit Clustering},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {371--382},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_35},
doi = {10.1007/978-3-642-13731-0\_35},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EhmsenL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/EhmsenKL10,
author = {Martin R. Ehmsen and
Jens S. Kohrt and
Kim S. Larsen},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {List Factoring and Relative Worst Order Analysis},
booktitle = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
pages = {118--129},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18318-8\_11},
doi = {10.1007/978-3-642-18318-8\_11},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/EhmsenKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-5787,
author = {Martin R. Ehmsen and
Jens S. Kohrt and
Kim S. Larsen},
title = {List Factoring and Relative Worst Order Analysis},
journal = {CoRR},
volume = {abs/1009.5787},
year = {2010},
url = {http://arxiv.org/abs/1009.5787},
eprinttype = {arXiv},
eprint = {1009.5787},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-5787.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarIL09,
author = {Joan Boyar and
Sandy Irani and
Kim S. Larsen},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {A Comparison of Performance Measures for Online Algorithms},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {119--130},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_11},
doi = {10.1007/978-3-642-03367-4\_11},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarIL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-0983,
author = {Joan Boyar and
Sandy Irani and
Kim S. Larsen},
title = {A Comparison of Performance Measures for Online Algorithms},
journal = {CoRR},
volume = {abs/0806.0983},
year = {2008},
url = {http://arxiv.org/abs/0806.0983},
eprinttype = {arXiv},
eprint = {0806.0983},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-0983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BoyarFL07,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {The relative worst-order ratio applied to paging},
journal = {J. Comput. Syst. Sci.},
volume = {73},
number = {5},
pages = {818--843},
year = {2007},
url = {https://doi.org/10.1016/j.jcss.2007.03.001},
doi = {10.1016/J.JCSS.2007.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BoyarFL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarEFKLPW06,
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},
journal = {Theor. Comput. Sci.},
volume = {362},
number = {1-3},
pages = {127--139},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.06.001},
doi = {10.1016/J.TCS.2006.06.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarEFKLPW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hm/ChiarandiniSL06,
author = {Marco Chiarandini and
Thomas St{\"{u}}tzle and
Kim S. Larsen},
editor = {Francisco Almeida and
Mar{\'{\i}}a J. Blesa Aguilera and
Christian Blum and
J. Marcos Moreno{-}Vega and
Melqu{\'{\i}}ades P{\'{e}}rez P{\'{e}}rez and
Andrea Roli and
Michael Sampels},
title = {Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem},
booktitle = {Hybrid Metaheuristics, Third International Workshop, {HM} 2006, Gran
Canaria, Spain, October 13-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4030},
pages = {162--177},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11890584\_13},
doi = {10.1007/11890584\_13},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/hm/ChiarandiniSL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BoyarEL06,
author = {Joan Boyar and
Martin R. Ehmsen and
Kim S. Larsen},
editor = {Thomas Erlebach and
Christos Kaklamanis},
title = {Theoretical Evidence for the Superiority of {LRU-2} over {LRU} for
the Paging Problem},
booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4368},
pages = {95--107},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11970125\_8},
doi = {10.1007/11970125\_8},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BoyarEL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/JacobsenL05,
author = {Lars Jacobsen and
Kim S. Larsen},
title = {Exponentially decreasing number of operations in balanced trees},
journal = {Acta Informatica},
volume = {42},
number = {1},
pages = {57--78},
year = {2005},
url = {https://doi.org/10.1007/s00236-005-0173-3},
doi = {10.1007/S00236-005-0173-3},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/JacobsenL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KohrtL05,
author = {Jens S. Kohrt and
Kim S. Larsen},
title = {On-line seat reservations via off-line seating arrangements},
journal = {Int. J. Found. Comput. Sci.},
volume = {16},
number = {2},
pages = {381--397},
year = {2005},
url = {https://doi.org/10.1142/S0129054105003042},
doi = {10.1142/S0129054105003042},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KohrtL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BoyarEFKLPW05,
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},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {The Maximum Resource Bin Packing Problem},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {397--408},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_35},
doi = {10.1007/11537311\_35},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BoyarEFKLPW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BoyarFL05,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {The relative worst order ratio applied to paging},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {718--727},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070534},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BoyarFL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BorodinBL04,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Priority Algorithms for Graph Optimization Problems},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {126--139},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31833-0\_12},
doi = {10.1007/978-3-540-31833-0\_12},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BorodinBL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/AnderssonFL04,
author = {Arne Andersson and
Rolf Fagerberg and
Kim S. Larsen},
editor = {Dinesh P. Mehta and
Sartaj Sahni},
title = {Balanced Binary Search Trees},
booktitle = {Handbook of Data Structures and Applications},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {https://doi.org/10.1201/9781420035179.ch10},
doi = {10.1201/9781420035179.CH10},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/reference/crc/AnderssonFL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BoyarFLN03,
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},
url = {https://doi.org/10.1007/s00236-003-0124-9},
doi = {10.1007/S00236-003-0124-9},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/BoyarFLN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FrederiksenLNU03,
author = {Jens S. Frederiksen and
Kim S. Larsen and
John Noga and
Patchrawat Uthaisombut},
title = {Dynamic {TCP} acknowledgment in the LogP model},
journal = {J. Algorithms},
volume = {48},
number = {2},
pages = {407--428},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00058-0},
doi = {10.1016/S0196-6774(03)00058-0},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/FrederiksenLNU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Larsen03,
author = {Kim S. Larsen},
title = {Relaxed multi-way trees with group updates},
journal = {J. Comput. Syst. Sci.},
volume = {66},
number = {4},
pages = {657--670},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00027-8},
doi = {10.1016/S0022-0000(03)00027-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Larsen03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BachBEFJLLS03,
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 = {J. Sched.},
volume = {6},
number = {2},
pages = {131--147},
year = {2003},
url = {https://doi.org/10.1023/A:1022985808959},
doi = {10.1023/A:1022985808959},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/BachBEFJLLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/FrederiksenL03,
author = {Jens S. Frederiksen and
Kim S. Larsen},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Michiel H. M. Smid},
title = {Online Seat Reservations via Offine Seating Arrangements},
booktitle = {Algorithms and Data Structures, 8th International Workshop, {WADS}
2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2748},
pages = {174--185},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45078-8\_16},
doi = {10.1007/978-3-540-45078-8\_16},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/FrederiksenL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Larsen02,
author = {Kim S. Larsen},
title = {Relaxed red-black trees with group updates},
journal = {Acta Informatica},
volume = {38},
number = {8},
pages = {565--586},
year = {2002},
url = {https://doi.org/10.1007/s00236-002-0086-3},
doi = {10.1007/S00236-002-0086-3},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/Larsen02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarBFLNE02,
author = {Yossi Azar and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen and
Leah Epstein},
title = {Fair versus Unrestricted Bin Packing},
journal = {Algorithmica},
volume = {34},
number = {2},
pages = {181--196},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0965-6},
doi = {10.1007/S00453-002-0965-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AzarBFLNE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JacobsenLN02,
author = {Lars Jacobsen and
Kim S. Larsen and
Morten N. Nielsen},
title = {On the existence and construction of non-extreme (a, b)-trees},
journal = {Inf. Process. Lett.},
volume = {84},
number = {2},
pages = {69--73},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00228-4},
doi = {10.1016/S0020-0190(02)00228-4},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JacobsenLN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BoyarFLN02,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen},
editor = {Oscar H. Ibarra and
Louxin Zhang},
title = {Extending the Accommodating Function},
booktitle = {Computing and Combinatorics, 8th Annual International Conference,
{COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2387},
pages = {87--96},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45655-4\_11},
doi = {10.1007/3-540-45655-4\_11},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BoyarFLN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FrederiksenL02,
author = {Jens S. Frederiksen and
Kim S. Larsen},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Packet Bundling},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {328--337},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_34},
doi = {10.1007/3-540-45471-3\_34},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/FrederiksenL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/LarsenOS01,
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},
url = {https://doi.org/10.1007/PL00013303},
doi = {10.1007/PL00013303},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/LarsenOS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LarsenSW01,
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},
url = {https://doi.org/10.1007/s00453-001-0059-x},
doi = {10.1007/S00453-001-0059-X},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LarsenSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/JacobsenL01,
author = {Lars Jacobsen and
Kim S. Larsen},
title = {Variants of (A, B)-Trees with Relaxed Balance},
journal = {Int. J. Found. Comput. Sci.},
volume = {12},
number = {4},
pages = {455--478},
year = {2001},
url = {https://doi.org/10.1142/S012905410100059X},
doi = {10.1142/S012905410100059X},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/JacobsenL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BoyarFLN01,
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 = {Nord. J. Comput.},
volume = {8},
number = {4},
pages = {463--472},
year = {2001},
url = {http://www.cs.helsinki.fi/njc/References/boyar2001:463.html},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/BoyarFLN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoyarLN01,
author = {Joan Boyar and
Kim S. Larsen and
Morten N. Nielsen},
title = {The Accommodating Function: {A} Generalization of the Competitive
Ratio},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {1},
pages = {233--258},
year = {2001},
url = {https://doi.org/10.1137/S0097539799361786},
doi = {10.1137/S0097539799361786},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BoyarLN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/JacobsenL01,
author = {Lars Jacobsen and
Kim S. Larsen},
editor = {Antonio Restivo and
Simona Ronchi Della Rocca and
Luca Roversi},
title = {Complexity of Layered Binary Search Trees with Relaxed Balance},
booktitle = {Theoretical Computer Science, 7th Italian Conference, {ICTCS} 2001,
Torino, Italy, October 4-6, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2202},
pages = {269--284},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45446-2\_17},
doi = {10.1007/3-540-45446-2\_17},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/JacobsenL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/JacobsenL01a,
author = {Lars Jacobsen and
Kim S. Larsen},
editor = {Antonio Restivo and
Simona Ronchi Della Rocca and
Luca Roversi},
title = {Exponentially Decreasing Number of Operations in Balanced Trees},
booktitle = {Theoretical Computer Science, 7th Italian Conference, {ICTCS} 2001,
Torino, Italy, October 4-6, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2202},
pages = {293--311},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45446-2\_19},
doi = {10.1007/3-540-45446-2\_19},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/JacobsenL01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Larsen01,
author = {Kim S. Larsen},
editor = {Peter Buneman},
title = {Relaxed Multi-Way Trees with Group Updates},
booktitle = {Proceedings of the Twentieth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, May 21-23, 2001, Santa Barbara,
California, {USA}},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/375551.375566},
doi = {10.1145/375551.375566},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/Larsen01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/FagerbergJL01,
author = {Rolf Fagerberg and
Rune E. Jensen and
Kim S. Larsen},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Search Trees with Relaxed Balance and Near-Optimal Height},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {414--425},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_38},
doi = {10.1007/3-540-44634-6\_38},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/FagerbergJL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Larsen00,
author = {Kim S. Larsen},
title = {{AVL} Trees with Relaxed Balance},
journal = {J. Comput. Syst. Sci.},
volume = {61},
number = {3},
pages = {508--522},
year = {2000},
url = {https://doi.org/10.1006/jcss.2000.1705},
doi = {10.1006/JCSS.2000.1705},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Larsen00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BachBJLL00,
author = {Eric Bach and
Joan Boyar and
Tao Jiang and
Kim S. Larsen and
Guo{-}Hui Lin},
editor = {Ding{-}Zhu Du and
Peter Eades and
Vladimir Estivill{-}Castro and
Xuemin Lin and
Arun Sharma},
title = {Better Bounds on the Accommodating Ratio for the Seat Reservation
Problem},
booktitle = {Computing and Combinatorics, 6th Annual International Conference,
{COCOON} 2000, Sydney, Australia, July 26-28, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1858},
pages = {221--231},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44968-X\_22},
doi = {10.1007/3-540-44968-X\_22},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BachBJLL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarBFLN00,
author = {Yossi Azar and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Fair versus Unrestricted Bin Packing},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {200--213},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_18},
doi = {10.1007/3-540-44985-X\_18},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/AzarBFLN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarL99,
author = {Joan Boyar and
Kim S. Larsen},
title = {The Seat Reservation Problem},
journal = {Algorithmica},
volume = {25},
number = {4},
pages = {403--417},
year = {1999},
url = {https://doi.org/10.1007/PL00009286},
doi = {10.1007/PL00009286},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/Larsen99,
author = {Kim S. Larsen},
title = {Partially persistent search trees with transcript operations},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {3},
number = {3},
pages = {95--107},
year = {1999},
url = {https://doi.org/10.46298/dmtcs.253},
doi = {10.46298/DMTCS.253},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/Larsen99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Larsen99,
author = {Kim S. Larsen},
title = {On Grouping in Relational Algebra},
journal = {Int. J. Found. Comput. Sci.},
volume = {10},
number = {3},
pages = {301--311},
year = {1999},
url = {https://doi.org/10.1142/S0129054199000228},
doi = {10.1142/S0129054199000228},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Larsen99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarLN99,
author = {Joan Boyar and
Kim S. Larsen and
Morten N. Nielsen},
editor = {Frank K. H. A. Dehne and
Arvind Gupta and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {The Accommodating Function - {A} Generalization of the Competitive
Ratio},
booktitle = {Algorithms and Data Structures, 6th International Workshop, {WADS}
'99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1663},
pages = {74--79},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48447-7\_9},
doi = {10.1007/3-540-48447-7\_9},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarLN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Larsen98,
author = {Kim S. Larsen},
title = {Amortized Constant Relaxed Rebalancing Using Standard Rotations},
journal = {Acta Informatica},
volume = {35},
number = {10},
pages = {859--874},
year = {1998},
url = {https://doi.org/10.1007/s002360050145},
doi = {10.1007/S002360050145},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/Larsen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Larsen98,
author = {Kim S. Larsen},
title = {Sort Order Problems in Relational Databases},
journal = {Int. J. Found. Comput. Sci.},
volume = {9},
number = {4},
pages = {399--430},
year = {1998},
url = {https://doi.org/10.1142/S0129054198000313},
doi = {10.1142/S0129054198000313},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Larsen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Larsen98,
author = {Kim S. Larsen},
title = {Regular Expressions with Nested Levels of Back Referencing Form a
Hierarchy},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {169--172},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00007-6},
doi = {10.1016/S0020-0190(98)00007-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Larsen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/HoyerL98,
author = {Peter H{\o}yer and
Kim S. Larsen},
title = {Parametric Permutation Routing via Matchings},
journal = {Nord. J. Comput.},
volume = {5},
number = {2},
pages = {105--114},
year = {1998},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/HoyerL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Larsen98,
author = {Kim S. Larsen},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Partially Persistent Search Trees with Transcript Operations},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {309--319},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028570},
doi = {10.1007/BFB0028570},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Larsen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BoyarFL97,
author = {Joan Boyar and
Rolf Fagerberg and
Kim S. Larsen},
title = {Amortization Results for Chromatic Search Trees, with an Application
to Priority Queues},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {504--521},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1511},
doi = {10.1006/JCSS.1997.1511},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BoyarFL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LarsenOS97,
author = {Kim S. Larsen and
Thomas Ottmann and
Eljas Soisalon{-}Soininen},
editor = {Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Relaxed Balance for Search Trees with Local Rebalancing},
booktitle = {Algorithms - {ESA} '97, 5th Annual European Symposium, Graz, Austria,
September 15-17, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1284},
pages = {350--363},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63397-9\_27},
doi = {10.1007/3-540-63397-9\_27},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/LarsenOS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/LarsenSW97,
author = {Kim S. Larsen and
Eljas Soisalon{-}Soininen and
Peter Widmayer},
editor = {Frank K. H. A. Dehne and
Andrew Rau{-}Chaplin and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Relaxed Balance through Standard Rotations},
booktitle = {Algorithms and Data Structures, 5th International Workshop, {WADS}
'97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1272},
pages = {450--461},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63307-3\_82},
doi = {10.1007/3-540-63307-3\_82},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/LarsenSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/LarsenF96,
author = {Kim S. Larsen and
Rolf Fagerberg},
title = {Efficient Rebalancing of B-Trees with Relaxed Balance},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {2},
pages = {169--186},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000142},
doi = {10.1142/S0129054196000142},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/LarsenF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/LarsenF95,
author = {Kim S. Larsen and
Rolf Fagerberg},
title = {B-trees with relaxed balance},
booktitle = {Proceedings of {IPPS} '95, The 9th International Parallel Processing
Symposium, April 25-28, 1995, Santa Barbara, California, {USA}},
pages = {196--202},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/IPPS.1995.395932},
doi = {10.1109/IPPS.1995.395932},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/LarsenF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/EngbergL95,
author = {Uffe Engberg and
Kim S. Larsen},
editor = {Ed Brinksma and
Rance Cleaveland and
Kim Guldstrand Larsen and
Tiziana Margaria and
Bernhard Steffen},
title = {Efficient Simplification of Bisimulation Formulas},
booktitle = {Tools and Algorithms for Construction and Analysis of Systems, First
International Workshop, {TACAS} '95, Aarhus, Denmark, May 19-20, 1995,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1019},
pages = {111--132},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60630-0\_6},
doi = {10.1007/3-540-60630-0\_6},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/tacas/EngbergL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarFL95,
author = {Joan Boyar and
Rolf Fagerberg and
Kim S. Larsen},
editor = {Selim G. Akl and
Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Amortization Results for Chromatic Search Trees, with an Application
to Priority Queues},
booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS}
'95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {955},
pages = {270--281},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60220-8\_69},
doi = {10.1007/3-540-60220-8\_69},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarFL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoyarFL94,
author = {Joan Boyar and
Faith E. Fich and
Kim S. Larsen},
title = {Bounds on Certain Multiplications of Affine Combinations},
journal = {Discret. Appl. Math.},
volume = {52},
number = {2},
pages = {155--167},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90079-5},
doi = {10.1016/0166-218X(94)90079-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BoyarFL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BoyarL94,
author = {Joan Boyar and
Kim S. Larsen},
title = {Efficient Rebalancing of Chromatic Search Trees},
journal = {J. Comput. Syst. Sci.},
volume = {49},
number = {3},
pages = {667--682},
year = {1994},
url = {https://doi.org/10.1016/S0022-0000(05)80075-3},
doi = {10.1016/S0022-0000(05)80075-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BoyarL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/LarsenS94,
author = {Kim S. Larsen and
Michael I. Schwartzbach},
title = {Injectivity of Composite Functions},
journal = {J. Symb. Comput.},
volume = {17},
number = {5},
pages = {393--408},
year = {1994},
url = {https://doi.org/10.1006/jsco.1994.1026},
doi = {10.1006/JSCO.1994.1026},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsc/LarsenS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/Larsen94,
author = {Kim S. Larsen},
editor = {Howard Jay Siegel},
title = {{AVL} Trees with Relaxed Balance},
booktitle = {Proceedings of the 8th International Symposium on Parallel Processing,
Canc{\'{u}}n, Mexico, April 1994},
pages = {888--893},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/IPPS.1994.288201},
doi = {10.1109/IPPS.1994.288201},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/Larsen94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LarsenSS92,
author = {Kim S. Larsen and
Michael I. Schwartzbach and
Erik Meineche Schmidt},
title = {A New Formalism for Relational Algebra},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {163--168},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90047-Y},
doi = {10.1016/0020-0190(92)90047-Y},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LarsenSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarL92,
author = {Joan Boyar and
Kim S. Larsen},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Efficient Rebalancing of Chromatic Search Trees},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {151--164},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_14},
doi = {10.1007/3-540-55706-7\_14},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rex/NielsenEL88,
author = {Mogens Nielsen and
Uffe Engberg and
Kim S. Larsen},
editor = {J. W. de Bakker and
Willem P. de Roever and
Grzegorz Rozenberg},
title = {Fully abstract models for a process language with refinement},
booktitle = {Linear Time, Branching Time and Partial Order in Logics and Models
for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands,
May 30 - June 3, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {354},
pages = {523--548},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0013034},
doi = {10.1007/BFB0013034},
timestamp = {Fri, 17 Jul 2020 16:12:47 +0200},
biburl = {https://dblp.org/rec/conf/rex/NielsenEL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-12 03:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
