Boyar, Joan; Larsen, Kim S.; Pankratov, Denis Advice complexity of adaptive priority algorithms. (English) Zbl 07782073 Theor. Comput. Sci. 984, Article ID 114318, 31 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Boyar} et al., Theor. Comput. Sci. 984, Article ID 114318, 31 p. (2024; Zbl 07782073) Full Text: DOI arXiv
Boyar, Joan; Favrholdt, Lene M.; Kamali, Shahin; Larsen, Kim S. Online interval scheduling with predictions. (English) Zbl 07789705 Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 193-207 (2023). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 14079, 193--207 (2023; Zbl 07789705) Full Text: DOI arXiv
Berg, Magnus; Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S. Online minimum spanning trees with weight predictions. (English) Zbl 07789701 Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 136-148 (2023). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{M. Berg} et al., Lect. Notes Comput. Sci. 14079, 136--148 (2023; Zbl 07789701) Full Text: DOI arXiv
Boyar, Joan; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S. Relaxing the irrevocability requirement for online graph algorithms. (English) Zbl 1492.68145 Algorithmica 84, No. 7, 1916-1951 (2022). MSC: 68W27 05C69 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{J. Boyar} et al., Algorithmica 84, No. 7, 1916--1951 (2022; Zbl 1492.68145) Full Text: DOI arXiv
Boyar, Joan; Favrholdt, Lene Monrad; Kamali, Shahin; Larsen, Kim Skak Online bin covering with advice. (English) Zbl 1512.68457 Algorithmica 83, No. 3, 795-821 (2021). MSC: 68W27 68Q25 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Algorithmica 83, No. 3, 795--821 (2021; Zbl 1512.68457) Full Text: DOI arXiv
Boyar, Joan; Ellen, Faith; Larsen, Kim S. Randomized distributed online algorithms against adaptive offline adversaries. (English) Zbl 1441.68294 Inf. Process. Lett. 161, Article ID 105973, 3 p. (2020). MSC: 68W27 68W15 68W20 PDFBibTeX XMLCite \textit{J. Boyar} et al., Inf. Process. Lett. 161, Article ID 105973, 3 p. (2020; Zbl 1441.68294) Full Text: DOI
Borodin, Allan; Boyar, Joan; Larsen, Kim S.; Pankratov, Denis Advice complexity of priority algorithms. (English) Zbl 1444.68299 Theory Comput. Syst. 64, No. 4, 593-625 (2020). MSC: 68W27 68Q17 90C59 PDFBibTeX XMLCite \textit{A. Borodin} et al., Theory Comput. Syst. 64, No. 4, 593--625 (2020; Zbl 1444.68299) Full Text: DOI arXiv
Boyar, Joan; Favrholdt, Lene M.; Kamali, Shahin; Larsen, Kim S. Online bin covering with advice. (English) Zbl 1512.68456 Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 225-238 (2019). MSC: 68W27 68Q25 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 11646, 225--238 (2019; Zbl 1512.68456) Full Text: DOI arXiv
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S. Online dominating set. (English) Zbl 1421.68239 Algorithmica 81, No. 5, 1938-1964 (2019). MSC: 68W27 05C69 68R10 PDFBibTeX XMLCite \textit{J. Boyar} et al., Algorithmica 81, No. 5, 1938--1964 (2019; Zbl 1421.68239) Full Text: DOI
Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S. Relative worst-order analysis: a survey. (English) Zbl 1514.68319 Böckenhauer, Hans-Joachim (ed.) et al., Adventures between lower bounds and higher altitudes. Essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 11011, 216-230 (2018). MSC: 68W27 68W40 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 11011, 216--230 (2018; Zbl 1514.68319) Full Text: DOI arXiv
Borodin, Allan; Boyar, Joan; Larsen, Kim S.; Pankratov, Denis Advice complexity of priority algorithms. (English) Zbl 1444.68298 Epstein, Leah (ed.) et al., Approximation and online algorithms. 16th international workshop, WAOA 2018, Helsinki, Finland, August 23–24, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11312, 69-86 (2018). MSC: 68W27 68Q17 90C59 PDFBibTeX XMLCite \textit{A. Borodin} et al., Lect. Notes Comput. Sci. 11312, 69--86 (2018; Zbl 1444.68298) Full Text: DOI arXiv
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Larsen, Kim S.; Levin, Asaf Batch coloring of graphs. (English) Zbl 1414.05109 Algorithmica 80, No. 11, 3293-3315 (2018). MSC: 05C15 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Algorithmica 80, No. 11, 3293--3315 (2018; Zbl 1414.05109) Full Text: DOI
Knudsen, Anders N.; Chiarandini, Marco; Larsen, Kim S. Heuristic variants of \(\mathrm{A}^*\) search for 3D flight planning. (English) Zbl 1511.90053 van Hoeve, Willem-Jan (ed.), Integration of constraint programming, artificial intelligence, and operations research. 15th international conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10848, 361-376 (2018). MSC: 90B06 90B35 68T20 90C59 PDFBibTeX XMLCite \textit{A. N. Knudsen} et al., Lect. Notes Comput. Sci. 10848, 361--376 (2018; Zbl 1511.90053) Full Text: DOI
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Larsen, Kim S.; Levin, Asaf Online-bounded analysis. (English) Zbl 1406.90034 J. Sched. 21, No. 4, 429-441 (2018). MSC: 90B35 68M20 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., J. Sched. 21, No. 4, 429--441 (2018; Zbl 1406.90034) Full Text: DOI Link
Andersson, Arne; Fagerberg, Rolf; Larsen, Kim S. Balanced binary search trees. 2nd edition. (English) Zbl 1390.68201 Mehta, Dinesh P. (ed.) et al., Handbook of data structures and applications. Boca Raton, FL: Chapman & Hall/CRC (ISBN 978-1-4987-0185-3/hbk; 978-1-4987-0188-4/ebook). Chapman & Hall/CRC Computer and Information Science Series, 151-170 (2018). MSC: 68P05 PDFBibTeX XMLCite \textit{A. Andersson} et al., in: Handbook of data structures and applications. Boca Raton, FL: Chapman \& Hall/CRC. 151--170 (2018; Zbl 1390.68201)
Cruz-Filipe, Luís; Larsen, Kim S.; Schneider-Kamp, Peter Formally proving size optimality of sorting networks. (English) Zbl 1425.68372 J. Autom. Reasoning 59, No. 4, 425-454 (2017). MSC: 68T15 68N18 68Q17 68Q25 68Q60 PDFBibTeX XMLCite \textit{L. Cruz-Filipe} et al., J. Autom. Reasoning 59, No. 4, 425--454 (2017; Zbl 1425.68372) Full Text: DOI
Cruz-Filipe, Luís; Larsen, Kim S.; Schneider-Kamp, Peter How to get more out of your oracles. (English) Zbl 1483.68481 Ayala-Rincón, Mauricio (ed.) et al., Interactive theorem proving. 8th international conference, ITP 2017, Brasília, Brazil, September 26–29, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10499, 164-170 (2017). MSC: 68V15 PDFBibTeX XMLCite \textit{L. Cruz-Filipe} et al., Lect. Notes Comput. Sci. 10499, 164--170 (2017; Zbl 1483.68481) Full Text: DOI
Boyar, Joan; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S. Relaxing the irrevocability requirement for online graph algorithms. (English) Zbl 1491.68139 Ellen, Faith (ed.) et al., Algorithms and data structures. 15th international symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10389, 217-228 (2017). MSC: 68R10 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 10389, 217--228 (2017; Zbl 1491.68139) Full Text: DOI arXiv
Cruz-Filipe, Luís; Larsen, Kim S.; Montesi, Fabrizio The paths to choreography extraction. (English) Zbl 1486.68111 Esparza, Javier (ed.) et al., 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. Berlin: Springer. Lect. Notes Comput. Sci. 10203, 424-440 (2017). MSC: 68Q85 PDFBibTeX XMLCite \textit{L. Cruz-Filipe} et al., Lect. Notes Comput. Sci. 10203, 424--440 (2017; Zbl 1486.68111) Full Text: DOI arXiv
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Larsen, Kim S.; Levin, Asaf Batch coloring of graphs. (English) Zbl 1484.05062 Jansen, Klaus (ed.) et al., Approximation and online algorithms. 14th international workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10138, 52-64 (2017). MSC: 05C15 05C85 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 10138, 52--64 (2017; Zbl 1484.05062) Full Text: DOI arXiv Link
Boyar, Joan; Kamali, Shahin; Larsen, Kim S.; López-Ortiz, Alejandro On the list update problem with advice. (English) Zbl 1362.68295 Inf. Comput. 253, Part 3, 411-423 (2017). MSC: 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Inf. Comput. 253, Part 3, 411--423 (2017; Zbl 1362.68295) Full Text: DOI arXiv
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbcik, Michal; Larsen, Kim S. Online dominating set. (English) Zbl 1378.68196 Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 21, 15 p. (2016). MSC: 68W27 05C40 05C69 05C85 PDFBibTeX XMLCite \textit{J. Boyar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 53, Article 21, 15 p. (2016; Zbl 1378.68196) Full Text: DOI arXiv
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Larsen, Kim S.; Levin, Asaf Online bounded analysis. (English) Zbl 1475.68463 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9691, 131-145 (2016). MSC: 68W27 68W40 90B35 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 9691, 131--145 (2016; Zbl 1475.68463) Full Text: DOI arXiv
Boyar, Joan; Kamali, Shahin; Larsen, Kim S.; López-Ortiz, Alejandro Online bin packing with advice. (English) Zbl 1336.68117 Algorithmica 74, No. 1, 507-527 (2016). MSC: 68Q25 68W27 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Algorithmica 74, No. 1, 507--527 (2016; Zbl 1336.68117) Full Text: DOI arXiv Link
Christ, Marie G.; Favrholdt, Lene M.; Larsen, Kim S. Online multi-coloring with advice. (English) Zbl 1329.68297 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 12th international workshop, WAOA 2014, Wrocław, Poland, September 11–12, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-18262-9/pbk; 978-3-319-18263-6/ebook). Lecture Notes in Computer Science 8952, 83-94 (2015). MSC: 68W27 05C15 68Q25 PDFBibTeX XMLCite \textit{M. G. Christ} et al., Lect. Notes Comput. Sci. 8952, 83--94 (2015; Zbl 1329.68297) Full Text: DOI arXiv
Christensen, Jan; Knudsen, Anders Nicolai; Larsen, Kim S. Soccer is harder than football. (English) Zbl 1337.68115 Int. J. Found. Comput. Sci. 26, No. 4, 477-486 (2015). MSC: 68Q17 PDFBibTeX XMLCite \textit{J. Christensen} et al., Int. J. Found. Comput. Sci. 26, No. 4, 477--486 (2015; Zbl 1337.68115) Full Text: DOI
Boyar, Joan; Larsen, Kim S.; Maiti, Abyayananda The frequent items problem in online streaming under various performance measures. (English) Zbl 1337.68297 Int. J. Found. Comput. Sci. 26, No. 4, 413-439 (2015). MSC: 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Int. J. Found. Comput. Sci. 26, No. 4, 413--439 (2015; Zbl 1337.68297) Full Text: DOI arXiv
Boyar, Joan; Irani, Sandy; Larsen, Kim S. A comparison of performance measures for online algorithms. (English) Zbl 1319.68256 Algorithmica 72, No. 4, 969-994 (2015). MSC: 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Algorithmica 72, No. 4, 969--994 (2015; Zbl 1319.68256) Full Text: DOI arXiv
Christ, Marie G.; Favrholdt, Lene M.; Larsen, Kim S. Online multi-coloring with advice. (English) Zbl 1328.68312 Theor. Comput. Sci. 596, 79-91 (2015). MSC: 68W27 05C15 68Q25 PDFBibTeX XMLCite \textit{M. G. Christ} et al., Theor. Comput. Sci. 596, 79--91 (2015; Zbl 1328.68312) Full Text: DOI
Boyar, Joan; Gupta, Sushmita; Larsen, Kim S. Relative interval analysis of paging algorithms on access graphs. (English) Zbl 1312.68235 Theor. Comput. Sci. 568, 28-48 (2015). MSC: 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Theor. Comput. Sci. 568, 28--48 (2015; Zbl 1312.68235) Full Text: DOI
Boyar, Joan; Kamali, Shahin; Larsen, Kim S.; López-Ortiz, Alejandro Online bin packing with advice. (English) Zbl 1359.68322 Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 174-186 (2014). MSC: 68W27 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 25, 174--186 (2014; Zbl 1359.68322) Full Text: DOI
Christ, Marie G.; Favrholdt, Lene M.; Larsen, Kim S. Online bin covering: expectations vs. guarantees. (English) Zbl 1338.68297 Theor. Comput. Sci. 556, 71-84 (2014). MSC: 68W27 90C27 PDFBibTeX XMLCite \textit{M. G. Christ} et al., Theor. Comput. Sci. 556, 71--84 (2014; Zbl 1338.68297) Full Text: DOI arXiv
Boyar, Joan; Larsen, Kim S.; Maiti, Abyayananda A comparison of performance measures via online search. (English) Zbl 1359.68323 Theor. Comput. Sci. 532, 2-13 (2014). MSC: 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Theor. Comput. Sci. 532, 2--13 (2014; Zbl 1359.68323) Full Text: DOI
Boyar, Joan; Kamali, Shahin; Larsen, Kim S.; López-Ortiz, Alejandro On the list update problem with advice. (English) Zbl 1362.68294 Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 8th international conference, LATA 2014, Madrid, Spain, March 10–14, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-04920-5/pbk). Lecture Notes in Computer Science 8370, 210-221 (2014). MSC: 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 8370, 210--221 (2014; Zbl 1362.68294) Full Text: DOI arXiv
Ehmsen, Martin R.; Larsen, Kim S. Better bounds on online unit clustering. (English) Zbl 1296.68199 Theor. Comput. Sci. 500, 1-24 (2013). MSC: 68W27 62H30 68W40 PDFBibTeX XMLCite \textit{M. R. Ehmsen} and \textit{K. S. Larsen}, Theor. Comput. Sci. 500, 1--24 (2013; Zbl 1296.68199) Full Text: DOI
Christ, Marie G.; Favrholdt, Lene M.; Larsen, Kim S. Online bin covering: expectations versus guarantees. (English) Zbl 1338.68296 Widmayer, Peter (ed.) et al., Combinatorial optimization and applications. 7th international conference, COCOA 2013, Chengdu, China, December 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-319-03779-0/pbk). Lecture Notes in Computer Science 8287, 226-237 (2013). MSC: 68W27 90C27 PDFBibTeX XMLCite \textit{M. G. Christ} et al., Lect. Notes Comput. Sci. 8287, 226--237 (2013; Zbl 1338.68296) Full Text: DOI
Christ, Marie G.; Favrholdt, Lene M.; Larsen, Kim S. Online multi-coloring on the path revisited. (English) Zbl 1286.68509 Acta Inf. 50, No. 5-6, 343-357 (2013). MSC: 68W27 68M10 05C15 PDFBibTeX XMLCite \textit{M. G. Christ} et al., Acta Inf. 50, No. 5--6, 343--357 (2013; Zbl 1286.68509) Full Text: DOI
Boyar, Joan; Larsen, Kim S.; Maiti, Abyayananda The frequent items problem in online streaming under various performance measures. (English) Zbl 1351.68311 Gąsieniec, Leszek (ed.) et al., Fundamentals of computation theory. 19th international symposium, FCT 2013, Liverpool, UK, August 19–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40163-3/pbk). Lecture Notes in Computer Science 8070, 60-71 (2013). MSC: 68W27 68P99 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 8070, 60--71 (2013; Zbl 1351.68311) Full Text: DOI
Boyar, Joan; Gupta, Sushmita; Larsen, Kim S. Relative interval analysis of paging algorithms on access graphs. (English) Zbl 1390.68174 Dehne, Frank (ed.) et al., Algorithms and data structures. 13th international symposium, WADS 2013, London, ON, Canada, August 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40103-9/pbk). Lecture Notes in Computer Science 8037, 195-206 (2013). MSC: 68N25 68R10 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 8037, 195--206 (2013; Zbl 1390.68174) Full Text: DOI arXiv
Ehmsen, Martin R.; Kohrt, Jens S.; Larsen, Kim S. List factoring and relative worst order analysis. (English) Zbl 1262.68187 Algorithmica 66, No. 2, 287-309 (2013). MSC: 68W27 68W20 68W40 PDFBibTeX XMLCite \textit{M. R. Ehmsen} et al., Algorithmica 66, No. 2, 287--309 (2013; Zbl 1262.68187) Full Text: DOI arXiv
Boyar, Joan; Gupta, Sushmita; Larsen, Kim S. Access graphs results for LRU versus FIFO under relative worst order analysis. (English) Zbl 1357.68299 Fomin, Fedor V. (ed.) et al., Algorithm theory – SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 328-339 (2012). MSC: 68W27 68R10 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 7357, 328--339 (2012; Zbl 1357.68299) Full Text: DOI arXiv
Boyar, Joan; Larsen, Kim S.; Maiti, Abyayananda A comparison of performance measures via online search. (English) Zbl 1304.68220 Snoeyink, Jack (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14–16, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). Lecture Notes in Computer Science 7285, 303-314 (2012). MSC: 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 7285, 303--314 (2012; Zbl 1304.68220) Full Text: DOI arXiv
Ehmsen, Martin R.; Kohrt, Jens S.; Larsen, Kim S. List factoring and relative worst order analysis. (English) Zbl 1314.68409 Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9–10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 118-129 (2011). MSC: 68W27 68W40 PDFBibTeX XMLCite \textit{M. R. Ehmsen} et al., Lect. Notes Comput. Sci. 6534, 118--129 (2011; Zbl 1314.68409) Full Text: DOI
Boyar, Joan; Ehmsen, Martin R.; Kohrt, Jens S.; Larsen, Kim S. A theoretical comparison of LRU and LRU-K. (English) Zbl 1214.68128 Acta Inf. 47, No. 7-8, 359-374 (2010). MSC: 68N25 68P15 PDFBibTeX XMLCite \textit{J. Boyar} et al., Acta Inf. 47, No. 7--8, 359--374 (2010; Zbl 1214.68128) Full Text: DOI
Larsen, Kim S.; Wøhlk, Sanne Competitive analysis of the online inventory problem. (English) Zbl 1205.90035 Eur. J. Oper. Res. 207, No. 2, 685-696 (2010). MSC: 90B05 68W27 PDFBibTeX XMLCite \textit{K. S. Larsen} and \textit{S. Wøhlk}, Eur. J. Oper. Res. 207, No. 2, 685--696 (2010; Zbl 1205.90035) Full Text: DOI
Ehmsen, Martin R.; Larsen, Kim S. Better bounds on online unit clustering. (English) Zbl 1285.68222 Kaplan, Haim (ed.), Algorithm theory – SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 371-382 (2010). MSC: 68W27 PDFBibTeX XMLCite \textit{M. R. Ehmsen} and \textit{K. S. Larsen}, Lect. Notes Comput. Sci. 6139, 371--382 (2010; Zbl 1285.68222) Full Text: DOI
Boyar, Joan; Irani, Sandy; Larsen, Kim S. A comparison of performance measures for online algorithms. (English) Zbl 1253.68368 Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 119-130 (2009). MSC: 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 5664, 119--130 (2009; Zbl 1253.68368) Full Text: DOI arXiv
Boyar, Joan; Ehmsen, Martin R.; Larsen, Kim S. Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem. (English) Zbl 1129.68432 Erlebach, Thomas (ed.) et al., Approximation and online algorithms. 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14–15, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-69513-4/pbk). Lecture Notes in Computer Science 4368, 95-107 (2007). MSC: 68P15 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 4368, 95--107 (2007; Zbl 1129.68432) Full Text: DOI
Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S. The relative worst-order ratio applied to paging. (English) Zbl 1115.68159 J. Comput. Syst. Sci. 73, No. 5, 818-843 (2007). MSC: 68W05 PDFBibTeX XMLCite \textit{J. Boyar} et al., J. Comput. Syst. Sci. 73, No. 5, 818--843 (2007; Zbl 1115.68159) Full Text: DOI
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Kohrt, Jens S.; Larsen, Kim S.; Pedersen, Morten M.; Wøhlk, Sanne The maximum resource bin packing problem. (English) Zbl 1100.68125 Theor. Comput. Sci. 362, No. 1-3, 127-139 (2006). MSC: 68W05 68Q25 68W25 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Theor. Comput. Sci. 362, No. 1--3, 127--139 (2006; Zbl 1100.68125) Full Text: DOI
Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S. The relative worst order ratio applied to paging. (English) Zbl 1297.68267 Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 718-727 (2005). MSC: 68W27 68W25 PDFBibTeX XMLCite \textit{J. Boyar} et al., in: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23--25, 2005. New York, NY: ACM Press. 718--727 (2005; Zbl 1297.68267)
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Kohrt, Jens S.; Larsen, Kim S.; Pedersen, Morten Monrad; Wøhlk, Sanne The maximum resource bin packing problem. (English) Zbl 1122.90397 Liśkiewicz, Maciej (ed.) et al., Fundamentals of computation theory. 15th international symposium, FCT 2005, Lübeck, Germany, August 17–20, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28193-2/pbk). Lecture Notes in Computer Science 3623, 397-408 (2005). MSC: 90C27 68Q25 68W05 68W25 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 3623, 397--408 (2005; Zbl 1122.90397) Full Text: DOI
Jacobsen, Lars; Larsen, Kim Skak Exponentially decreasing number of operations in balanced trees. (English) Zbl 1079.68025 Acta Inf. 42, No. 1, 57-78 (2005). MSC: 68P05 PDFBibTeX XMLCite \textit{L. Jacobsen} and \textit{K. S. Larsen}, Acta Inf. 42, No. 1, 57--78 (2005; Zbl 1079.68025) Full Text: DOI
Kohrt, Jens S.; Larsen, Kim S. On-line seat reservations via off-line seating arrangements. (English) Zbl 1089.90027 Int. J. Found. Comput. Sci. 16, No. 2, 381-397 (2005). MSC: 90B35 68Q10 68W40 PDFBibTeX XMLCite \textit{J. S. Kohrt} and \textit{K. S. Larsen}, Int. J. Found. Comput. Sci. 16, No. 2, 381--397 (2005; Zbl 1089.90027) Full Text: DOI
Vogler, Walter (ed.); Larsen, Kim (ed.) MTCS ’02. Proceedings of the 3rd international workshop on models for time-critical systems (CONCUR 2002 satellite workshop), Brno, Czech Republic, August 24, 2002. (English) Zbl 1270.68035 Electronic Notes in Theoretical Computer Science 68, No. 5. Amsterdam: Elsevier. 1-136, electronic only (2003). MSC: 68-06 68Q60 68Q85 00B25 PDFBibTeX XMLCite \textit{W. Vogler} (ed.) and \textit{K. Larsen} (ed.), MTCS '02. Proceedings of the 3rd international workshop on models for time-critical systems (CONCUR 2002 satellite workshop), Brno, Czech Republic, August 24, 2002. Amsterdam: Elsevier (2003; Zbl 1270.68035) Full Text: Link
Frederiksen, Jens S.; Larsen, Kim S. Online seat reservations via offline seating arrangements. (English) Zbl 1278.68079 Dehne, Frank (ed.) et al., Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 – August 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40545-3/pbk). Lect. Notes Comput. Sci. 2748, 174-185 (2003). MSC: 68P05 68W27 PDFBibTeX XMLCite \textit{J. S. Frederiksen} and \textit{K. S. Larsen}, Lect. Notes Comput. Sci. 2748, 174--185 (2003; Zbl 1278.68079) Full Text: DOI
Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S.; Nielsen, Morten N. Extending the accommodating function. (English) Zbl 1069.68643 Acta Inf. 40, No. 1, 3-35 (2003). MSC: 68W05 PDFBibTeX XMLCite \textit{J. Boyar} et al., Acta Inf. 40, No. 1, 3--35 (2003; Zbl 1069.68643) Full Text: DOI
Frederiksen, Jens S.; Larsen, Kim S.; Noga, John; Uthaisombut, Patchrawat Dynamic TCP acknowledgment in the LogP model. (English) Zbl 1091.68011 J. Algorithms 48, No. 2, 407-428 (2003). MSC: 68M20 68W05 68W20 PDFBibTeX XMLCite \textit{J. S. Frederiksen} et al., J. Algorithms 48, No. 2, 407--428 (2003; Zbl 1091.68011) Full Text: DOI
Larsen, Kim S. Relaxed multi-way trees with group updates. (English) Zbl 1054.68045 J. Comput. Syst. Sci. 66, No. 4, 657-670 (2003). MSC: 68P15 68P05 PDFBibTeX XMLCite \textit{K. S. Larsen}, J. Comput. Syst. Sci. 66, No. 4, 657--670 (2003; Zbl 1054.68045) Full Text: DOI
Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S.; Nielsen, Morten N. Extending the accommodating function. (English) Zbl 1077.68816 Ibarra, Oscar H. (ed.) et al., Computing and combinatorics. 8th annual international conference, COCOON 2002, Singapore, August 15–17, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43996-X). Lect. Notes Comput. Sci. 2387, 87-96 (2002). MSC: 68T20 68W40 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 2387, 87--96 (2002; Zbl 1077.68816) Full Text: Link
Frederiksen, Jens S.; Larsen, Kim S. Packet bundling. (English) Zbl 1078.68538 Penttonen, Martti (ed.) et al., Algorithm theory - SWAT 2002. 8th Scandinavian workshop, Turku, Finland, July 3–5, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43866-1). Lect. Notes Comput. Sci. 2368, 328-337 (2002). MSC: 68M10 68M12 68W05 68W20 PDFBibTeX XMLCite \textit{J. S. Frederiksen} and \textit{K. S. Larsen}, Lect. Notes Comput. Sci. 2368, 328--337 (2002; Zbl 1078.68538) Full Text: DOI
Larsen, Kim S. Relaxed red-black trees with group updates. (English) Zbl 1034.68025 Acta Inf. 38, No. 8, 565-586 (2002). MSC: 68P10 68R10 PDFBibTeX XMLCite \textit{K. S. Larsen}, Acta Inf. 38, No. 8, 565--586 (2002; Zbl 1034.68025) Full Text: DOI
Jacobsen, Lars; Larsen, Kim S.; Nielsen, Morten N. On the existence and construction of non-extreme \((a,b)\)-trees. (English) Zbl 1042.68037 Inf. Process. Lett. 84, No. 2, 69-73 (2002). MSC: 68P05 68Q25 68P10 PDFBibTeX XMLCite \textit{L. Jacobsen} et al., Inf. Process. Lett. 84, No. 2, 69--73 (2002; Zbl 1042.68037) Full Text: DOI
Azar, Yossi; Boyar, Joan.; Epstein, Leah; Favrholdt, Lene M.; Larsen, Kim S. Fair versus unrestricted bin packing. (English) Zbl 1001.68181 Algorithmica 34, No. 2, 181-196 (2002). MSC: 68W05 05B40 PDFBibTeX XMLCite \textit{Y. Azar} et al., Algorithmica 34, No. 2, 181--196 (2002; Zbl 1001.68181) Full Text: DOI
Jacobsen, Lars; Larsen, Kim S. Variants of \((a,b)\)-trees with relaxed balance. (English) Zbl 1319.68065 Int. J. Found. Comput. Sci. 12, No. 4, 455-478 (2001). MSC: 68P05 PDFBibTeX XMLCite \textit{L. Jacobsen} and \textit{K. S. Larsen}, Int. J. Found. Comput. Sci. 12, No. 4, 455--478 (2001; Zbl 1319.68065) Full Text: DOI
Jacobsen, Lars; Larsen, Kim S. Exponentially decreasing number of operations in balanced trees. (English) Zbl 1042.68547 Restivo, Antonio (ed.) et al., Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4–6, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42672-8). Lect. Notes Comput. Sci. 2202, 293-311 (2001). MSC: 68P05 PDFBibTeX XMLCite \textit{L. Jacobsen} and \textit{K. S. Larsen}, Lect. Notes Comput. Sci. 2202, 293--311 (2001; Zbl 1042.68547) Full Text: Link
Jacobsen, Lars; Larsen, Kim S. Complexity of layered binary search trees with relaxed balance. (English) Zbl 1042.68546 Restivo, Antonio (ed.) et al., Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4–6, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42672-8). Lect. Notes Comput. Sci. 2202, 269-284 (2001). MSC: 68P05 68Q25 PDFBibTeX XMLCite \textit{L. Jacobsen} and \textit{K. S. Larsen}, Lect. Notes Comput. Sci. 2202, 269--284 (2001; Zbl 1042.68546) Full Text: Link
Fagerberg, Rolf; Jensen, Rune E.; Larsen, Kim S. Search trees with relaxed balance and near-optimal height. (English) Zbl 0997.68519 Dehne, Frank (ed.) et al., Algorithms and data structures. 7th international workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2125, 414-425 (2001). MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{R. Fagerberg} et al., Lect. Notes Comput. Sci. 2125, 414--425 (2001; Zbl 0997.68519) Full Text: Link
Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S.; Nielsen, Morten N. The competitive ratio for on-line dual bin packing with restricted input sequences. (English) Zbl 1003.68200 Nord. J. Comput. 8, No. 4, 463-472 (2001). MSC: 68W05 PDFBibTeX XMLCite \textit{J. Boyar} et al., Nord. J. Comput. 8, No. 4, 463--472 (2001; Zbl 1003.68200)
Boyar, Joan; Larsen, Kim S.; Nielsen, Morten N. The accommodating function: A generalization of the competitive ratio. (English) Zbl 0992.68069 SIAM J. Comput. 31, No. 1, 233-258 (2001). MSC: 68Q25 90B35 05B40 PDFBibTeX XMLCite \textit{J. Boyar} et al., SIAM J. Comput. 31, No. 1, 233--258 (2001; Zbl 0992.68069) Full Text: DOI
Larsen, K. S.; Soisalon-Soininen, E.; Widmayer, P. Relaxed balance using standard rotations. (English) Zbl 0997.68028 Algorithmica 31, No. 4, 501-512 (2001). MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{K. S. Larsen} et al., Algorithmica 31, No. 4, 501--512 (2001; Zbl 0997.68028) Full Text: DOI
Larsen, Kim S.; Ottmann, Thomas; Soisalon-Soininen, Eljas relaxed balance for search trees with local rebalancing. (English) Zbl 0973.68051 Acta Inf. 37, No. 10, 743-763 (2001). MSC: 68P10 PDFBibTeX XMLCite \textit{K. S. Larsen} et al., Acta Inf. 37, No. 10, 743--763 (2001; Zbl 0973.68051) Full Text: DOI
Bach, Eric; Boyar, Joan; Jiang, Tao; Larsen, Kim S.; Lin, Guo-Hui Better bounds on the accomodating ratio for the seat reservation problem (extended abstract). (English) Zbl 0988.68837 Du, D.-Z. (ed.) et al., Computing and combinatorics. 6th annual international conference, COCOON 2000, Sydney, Australia, July 26-28, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1858, 221-231 (2000). MSC: 68W05 PDFBibTeX XMLCite \textit{E. Bach} et al., Lect. Notes Comput. Sci. 1858, 221--231 (2000; Zbl 0988.68837)
Azar, Yossi; Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S.; Nielsen, Morten N. Fair versus unrestricted bin packing. (English) Zbl 0966.68608 Halldórsson, Magnús M. (ed.), Algorithm theory - SWAT 2000. 7th Scandinavian workshop, Bergen, Norway, July 5-7, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1851, 200-213 (2000). MSC: 68W20 PDFBibTeX XMLCite \textit{Y. Azar} et al., Lect. Notes Comput. Sci. 1851, 200--213 (2000; Zbl 0966.68608)
Larsen, Kim S. AVL trees with relaxed balance. (English) Zbl 0970.68122 J. Comput. Syst. Sci. 61, No. 3, 508-522 (2000). MSC: 68R10 PDFBibTeX XMLCite \textit{K. S. Larsen}, J. Comput. Syst. Sci. 61, No. 3, 508--522 (2000; Zbl 0970.68122) Full Text: DOI
Larsen, Kim S. On grouping in relational algebra. (English) Zbl 1319.68074 Int. J. Found. Comput. Sci. 10, No. 3, 301-311 (1999). MSC: 68P15 PDFBibTeX XMLCite \textit{K. S. Larsen}, Int. J. Found. Comput. Sci. 10, No. 3, 301--311 (1999; Zbl 1319.68074) Full Text: DOI
Boyar, Joan; Larsen, Kim S.; Nielsen, Morten N. The accomodating function – a generalization of the competitive ratio. (English) Zbl 1063.68703 Dehne, Frank (ed.) et al., Algorithms and data structures. 6th international workshop, WADS’99, Vancouver, Canada, August 11–14, 1999. Proceedings. Berlin: Springer (ISBN 3-540-66279-0/pbk). Lecture Notes in Computer Science 1663, 74-79 (1999). MSC: 68W40 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 1663, 74--79 (1999; Zbl 1063.68703)
Boyar, J.; Larsen, K. S. The seat reservation problem. (English) Zbl 0937.68156 Algorithmica 25, No. 4, 403-417 (1999). MSC: 68W05 PDFBibTeX XMLCite \textit{J. Boyar} and \textit{K. S. Larsen}, Algorithmica 25, No. 4, 403--417 (1999; Zbl 0937.68156) Full Text: DOI
Larsen, Kim S. Partially persistent search trees with transcript operations. (English) Zbl 0947.68043 Discrete Math. Theor. Comput. Sci. 3, No. 3, 95-107 (1999). MSC: 68P10 68P05 PDFBibTeX XMLCite \textit{K. S. Larsen}, Discrete Math. Theor. Comput. Sci. 3, No. 3, 95--107 (1999; Zbl 0947.68043) Full Text: EuDML EMIS
Larsen, Kim S. Regular expressions with nested levels of back referencing form a hierarchy. (English) Zbl 1339.68150 Inf. Process. Lett. 65, No. 4, 169-172 (1998). MSC: 68Q45 PDFBibTeX XMLCite \textit{K. S. Larsen}, Inf. Process. Lett. 65, No. 4, 169--172 (1998; Zbl 1339.68150) Full Text: DOI Link
Larsen, Kim S. Sort order problems in relational databases. (English) Zbl 1319.68073 Int. J. Found. Comput. Sci. 9, No. 4, 399-429 (1998). MSC: 68P15 68Q17 68Q25 PDFBibTeX XMLCite \textit{K. S. Larsen}, Int. J. Found. Comput. Sci. 9, No. 4, 399--429 (1998; Zbl 1319.68073) Full Text: DOI
Høyer, Peter; Larsen, Kim S. Parametric permutation routing via matchings. (English) Zbl 0905.68098 Nord. J. Comput. 5, No. 2, 105-114 (1998). MSC: 68R10 68M99 PDFBibTeX XMLCite \textit{P. Høyer} and \textit{K. S. Larsen}, Nord. J. Comput. 5, No. 2, 105--114 (1998; Zbl 0905.68098)
Larsen, Kim S. Amortized constant relaxed rebalancing using standard rotations. (English) Zbl 0910.68057 Acta Inf. 35, No. 10, 859-874 (1998). Reviewer: Kim S.Larsen (Odense) MSC: 68P10 68R10 PDFBibTeX XML Full Text: DOI
Larsen, Kim S.; Soisalon-Soininen, Eljas; Widmayer, Peter Relaxed balance through standard rotations. (English) Zbl 1497.68143 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 450-461 (1997). MSC: 68P05 PDFBibTeX XMLCite \textit{K. S. Larsen} et al., Lect. Notes Comput. Sci. 1272, 450--461 (1997; Zbl 1497.68143) Full Text: DOI
Larsen, Kim S.; Ottmann, Thomas; Soisalon-Soininen, Eljas Relaxed balance for search trees with local rebalancing. (English) Zbl 1477.68086 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 350-363 (1997). MSC: 68P10 68P05 PDFBibTeX XMLCite \textit{K. S. Larsen} et al., Lect. Notes Comput. Sci. 1284, 350--363 (1997; Zbl 1477.68086) Full Text: DOI
Boyar, Joan; Fagerberg, Rolf; Larsen, Kim S. Amortization results for chromatic search trees, with an application to priority queues. (English) Zbl 0897.68034 J. Comput. Syst. Sci. 55, No. 3, 504-521 (1997). MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{J. Boyar} et al., J. Comput. Syst. Sci. 55, No. 3, 504--521 (1997; Zbl 0897.68034) Full Text: DOI
Larsen, Kim S.; Fagerberg, Rolf Efficient rebalancing of B-trees with relaxed balance. (English) Zbl 0852.68019 Int. J. Found. Comput. Sci. 7, No. 2, 169-186 (1996). MSC: 68P10 68Q25 68P05 PDFBibTeX XMLCite \textit{K. S. Larsen} and \textit{R. Fagerberg}, Int. J. Found. Comput. Sci. 7, No. 2, 169--186 (1996; Zbl 0852.68019) Full Text: DOI
Boyar, Joan; Fagerberg, Rolf; Larsen, Kim S. Amortization results for chromatic search trees, with an application to priority queues. (English) Zbl 1502.68085 Akl, Selim G. (ed.) et al., Algorithms and data structures. 4th international workshop, WADS ’95, Kingston, Canada, August 16–18, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 955, 270-281 (1995). MSC: 68P05 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 955, 270--281 (1995; Zbl 1502.68085) Full Text: DOI
Boyar, Joan; Larsen, Kim S. Efficient rebalancing of chromatic search trees. (English) Zbl 0938.68612 J. Comput. Syst. Sci. 49, No. 3, 667-682 (1994). MSC: 68P15 68P10 68P05 PDFBibTeX XMLCite \textit{J. Boyar} and \textit{K. S. Larsen}, J. Comput. Syst. Sci. 49, No. 3, 667--682 (1994; Zbl 0938.68612) Full Text: DOI
Larsen, Kim S.; Schwartzbach, Michael I. Injectivity of composite functions. (English) Zbl 0805.68074 J. Symb. Comput. 17, No. 5, 393-408 (1994). MSC: 68W30 03E20 68Q25 68P10 68Q65 08A70 68T15 PDFBibTeX XMLCite \textit{K. S. Larsen} and \textit{M. I. Schwartzbach}, J. Symb. Comput. 17, No. 5, 393--408 (1994; Zbl 0805.68074) Full Text: DOI
Boyar, Joan; Larsen, Kim S. Efficient rebalancing of chromatic search trees. (English) Zbl 1504.68043 Nurmi, Otto (ed.) et al., Algorithm theory – SWAT ’92. Third Scandinavian workshop on algorithm theory, Helsinki, Finland, July 8–10, 1992. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 621, 151-164 (1992). MSC: 68P05 68P10 68P15 PDFBibTeX XMLCite \textit{J. Boyar} and \textit{K. S. Larsen}, Lect. Notes Comput. Sci. 621, 151--164 (1992; Zbl 1504.68043) Full Text: DOI
Larsen, Kim S.; Schwartzbach, Michael I.; Schmidt, Erik M. A new formalism for relational algebra. (English) Zbl 0751.68022 Inf. Process. Lett. 41, No. 3, 163-168 (1992). MSC: 68P15 68N15 PDFBibTeX XMLCite \textit{K. S. Larsen} et al., Inf. Process. Lett. 41, No. 3, 163--168 (1992; Zbl 0751.68022) Full Text: DOI
Nielsen, Mogens; Engberg, Uffe; Larsen, K. S. Fully abstract models for a process language with refinement. (Technical contribution). (English) Zbl 0683.68069 Linear time, branching time and partial order in logics and models for concurrency, Proc. Workshop, Noordwijkerhout/NL 1988, Lect. Notes Comput. Sci. 354, 523-548 (1989). Reviewer: N.Curteanu MSC: 68Q55 06A06 68Q65 PDFBibTeX XML