default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKim S. Larsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j60]Joan Boyar
, Lene M. Favrholdt, Kim S. Larsen:
Online Unit Profit Knapsack with Predictions. Algorithmica 86(9): 2786-2821 (2024)- [j59]Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice complexity of adaptive priority algorithms. Theor. Comput. Sci. 984: 114318 (2024) - [c55]Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov:
On the Online Weighted Non-Crossing Matching Problem. SWAT 2024: 16:1-16:19 - [i27]Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Complexity Classes for Online Problems with and without Predictions. CoRR abs/2406.18265 (2024) - 2023
- [c54]Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon:
Paging with Succinct Predictions. ICML 2023: 952-968 - [c53]Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen:
Quotable Signatures for Authenticating Shared Quotes. LATINCRYPT 2023: 273-292 - [c52]Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Online Minimum Spanning Trees with Weight Predictions. WADS 2023: 136-148 - [c51]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Interval Scheduling with Predictions. WADS 2023: 193-207 - [i26]Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Online Minimum Spanning Trees with Weight Predictions. CoRR abs/2302.12029 (2023) - [i25]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Interval Scheduling with Predictions. CoRR abs/2302.13701 (2023) - 2022
- [j58]Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Relaxing the Irrevocability Requirement for Online Graph Algorithms. Algorithmica 84(7): 1916-1951 (2022) - [j57]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Relative Worst-order Analysis: A Survey. ACM Comput. Surv. 54(1): 8:1-8:21 (2022) - [c50]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Online Unit Profit Knapsack with Untrusted Predictions. SWAT 2022: 20:1-20:17 - [i24]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Online Unit Profit Knapsack with Untrusted Predictions. CoRR abs/2203.00285 (2022) - [i23]Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi, Larisa Safina:
Implementing Choreography Extraction. CoRR abs/2205.02636 (2022) - [i22]Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon:
Paging with Succinct Predictions. CoRR abs/2210.02775 (2022) - [i21]Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen:
Quotable Signatures for Authenticating Shared Quotes. CoRR abs/2212.10963 (2022) - 2021
- [j56]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. Algorithmica 83(3): 795-821 (2021) - 2020
- [j55]Joan Boyar, Faith Ellen, Kim S. Larsen:
Randomized distributed online algorithms against adaptive offline adversaries. Inf. Process. Lett. 161: 105973 (2020) - [j54]Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Priority Algorithms. Theory Comput. Syst. 64(4): 593-625 (2020)
2010 – 2019
- 2019
- [j53]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. Algorithmica 81(5): 1938-1964 (2019) - [c49]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. WADS 2019: 225-238 - [i20]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. CoRR abs/1905.00066 (2019) - [i19]Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Adaptive Priority Algorithms. CoRR abs/1910.00868 (2019) - 2018
- [j52]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. Algorithmica 80(11): 3293-3315 (2018) - [j51]Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk:
DNA-templated synthesis optimization. Nat. Comput. 17(4): 693-707 (2018) - [j50]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online-bounded analysis. J. Sched. 21(4): 429-441 (2018) - [c48]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Relative Worst-Order Analysis: A Survey. Adventures Between Lower Bounds and Higher Altitudes 2018: 216-230 - [c47]Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen:
Heuristic Variants of A ^* Search for 3D Flight Planning. CPAIOR 2018: 361-376 - [c46]Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Priority Algorithms. WAOA 2018: 69-86 - [i18]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Relative Worst-Order Analysis: A Survey. CoRR abs/1802.07080 (2018) - [i17]Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Priority Algorithms. CoRR abs/1806.06223 (2018) - [i16]Joan Boyar, Faith Ellen, Kim S. Larsen:
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing. CoRR abs/1807.06820 (2018) - 2017
- [j49]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen:
Online Algorithms with Advice: A Survey. ACM Comput. Surv. 50(2): 19:1-19:34 (2017) - [j48]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the list update problem with advice. Inf. Comput. 253: 411-423 (2017) - [j47]Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp:
Formally Proving Size Optimality of Sorting Networks. J. Autom. Reason. 59(4): 425-454 (2017) - [c45]Casper Kehlet Jensen, Marco Chiarandini, Kim S. Larsen:
Flight Planning in Free Route Airspaces. ATMOS 2017: 14:1-14:14 - [c44]Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen:
Constraint Handling in Flight Planning. CP 2017: 354-369 - [c43]Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk:
DNA-Templated Synthesis Optimization. DNA 2017: 17-32 - [c42]Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi:
The Paths to Choreography Extraction. FoSSaCS 2017: 424-440 - [c41]Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp:
How to Get More Out of Your Oracles. ITP 2017: 164-170 - [c40]Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Relaxing the Irrevocability Requirement for Online Graph Algorithms. WADS 2017: 217-228 - [i15]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík:
Relaxing the Irrevocability Requirement for Online Graph Algorithms. CoRR abs/1704.08835 (2017) - 2016
- [j46]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. Algorithmica 74(1): 507-527 (2016) - [j45]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen:
Online Algorithms with Advice: A Survey. SIGACT News 47(3): 93-129 (2016) - [c39]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. CSR 2016: 131-145 - [c38]Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen:
Vertical Optimization of Resource Dependent Flight Paths. ECAI 2016: 639-645 - [c37]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. SWAT 2016: 21:1-21:15 - [c36]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. WAOA 2016: 52-64 - [i14]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. CoRR abs/1602.06708 (2016) - [i13]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. CoRR abs/1604.05172 (2016) - [i12]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. CoRR abs/1610.02997 (2016) - [i11]Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi:
The Paths to Choreography Extraction. CoRR abs/1610.10050 (2016) - 2015
- [j44]Joan Boyar, Sandy Irani, Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms. Algorithmica 72(4): 969-994 (2015) - [j43]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
The Frequent Items Problem in Online Streaming Under Various Performance Measures. Int. J. Found. Comput. Sci. 26(4): 413-440 (2015) - [j42]Jan Christensen, Anders Nicolai Knudsen, Kim S. Larsen:
Soccer is Harder Than Football. Int. J. Found. Comput. Sci. 26(4): 477-486 (2015) - [j41]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Relative interval analysis of paging algorithms on access graphs. Theor. Comput. Sci. 568: 28-48 (2015) - [j40]Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online multi-coloring with advice. Theor. Comput. Sci. 596: 79-91 (2015) - 2014
- [j39]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
A comparison of performance measures via online search. Theor. Comput. Sci. 532: 2-13 (2014) - [j38]Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online bin covering: Expectations vs. guarantees. Theor. Comput. Sci. 556: 71-84 (2014) - [c35]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the List Update Problem with Advice. LATA 2014: 210-221 - [c34]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. STACS 2014: 174-186 - [c33]Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online Multi-Coloring with Advice. WAOA 2014: 83-94 - [i10]Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online Multi-Coloring with Advice. CoRR abs/1409.1722 (2014) - 2013
- [j37]Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online multi-coloring on the path revisited. Acta Informatica 50(5-6): 343-357 (2013) - [j36]Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
List Factoring and Relative Worst Order Analysis. Algorithmica 66(2): 287-309 (2013) - [j35]Martin R. Ehmsen, Kim S. Larsen:
A Technique for Exact Computation of precoloring Extension on Interval Graphs. Int. J. Found. Comput. Sci. 24(1): 109-122 (2013) - [j34]Martin R. Ehmsen, Kim S. Larsen:
Better bounds on online unit clustering. Theor. Comput. Sci. 500: 1-24 (2013) - [c32]Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online Bin Covering: Expectations vs. Guarantees. COCOA 2013: 226-237 - [c31]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
The Frequent Items Problem in Online Streaming under Various Performance Measures. FCT 2013: 60-71 - [c30]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Relative Interval Analysis of Paging Algorithms on Access Graphs. WADS 2013: 195-206 - [i9]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Relative Interval Analysis of Paging Algorithms on Access Graphs. CoRR abs/1305.0669 (2013) - [i8]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
The Frequent Items Problem in Online Streaming under Various Performance Measures. CoRR abs/1306.0771 (2013) - [i7]Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online Bin Covering: Expectations vs. Guarantees. CoRR abs/1309.6477 (2013) - [i6]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the List Update Problem with Advice. CoRR abs/1311.7357 (2013) - 2012
- [c29]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
A Comparison of Performance Measures via Online Search. FAW-AAIM 2012: 303-314 - [c28]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. SWAT 2012: 328-339 - [i5]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. CoRR abs/1204.4047 (2012) - [i4]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. CoRR abs/1212.4016 (2012) - 2011
- [i3]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
A Comparison of Performance Measures via Online Search. CoRR abs/1106.6136 (2011) - 2010
- [j33]Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
A theoretical comparison of LRU and LRU-K. Acta Informatica 47(7-8): 359-374 (2010) - [j32]Kim S. Larsen, Sanne Wøhlk:
Competitive analysis of the online inventory problem. Eur. J. Oper. Res. 207(2): 685-696 (2010) - [j31]Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi:
Priority algorithms for graph optimization problems. Theor. Comput. Sci. 411(1): 239-258 (2010) - [c27]Martin R. Ehmsen, Kim S. Larsen:
Better Bounds on Online Unit Clustering. SWAT 2010: 371-382 - [c26]Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
List Factoring and Relative Worst Order Analysis. WAOA 2010: 118-129 - [i2]Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
List Factoring and Relative Worst Order Analysis. CoRR abs/1009.5787 (2010)
2000 – 2009
- 2009
- [c25]Joan Boyar, Sandy Irani, Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms. WADS 2009: 119-130 - 2008
- [i1]Joan Boyar, Sandy Irani, Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms. CoRR abs/0806.0983 (2008) - 2007
- [j30]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
The relative worst-order ratio applied to paging. J. Comput. Syst. Sci. 73(5): 818-843 (2007) - 2006
- [j29]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk:
The maximum resource bin packing problem. Theor. Comput. Sci. 362(1-3): 127-139 (2006) - [c24]Marco Chiarandini, Thomas Stützle, Kim S. Larsen:
Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem. Hybrid Metaheuristics 2006: 162-177 - [c23]Joan Boyar, Martin R. Ehmsen, Kim S. Larsen:
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem. WAOA 2006: 95-107 - 2005
- [j28]Lars Jacobsen, Kim S. Larsen:
Exponentially decreasing number of operations in balanced trees. Acta Informatica 42(1): 57-78 (2005) - [j27]Jens S. Kohrt, Kim S. Larsen:
On-line seat reservations via off-line seating arrangements. Int. J. Found. Comput. Sci. 16(2): 381-397 (2005) - [c22]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk:
The Maximum Resource Bin Packing Problem. FCT 2005: 397-408 - [c21]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
The relative worst order ratio applied to paging. SODA 2005: 718-727 - 2004
- [c20]Allan Borodin, Joan Boyar, Kim S. Larsen:
Priority Algorithms for Graph Optimization Problems. WAOA 2004: 126-139 - [r1]Arne Andersson, Rolf Fagerberg, Kim S. Larsen:
Balanced Binary Search Trees. Handbook of Data Structures and Applications 2004 - 2003
- [j26]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
Extending the accommodating function. Acta Informatica 40(1): 3-35 (2003) - [j25]Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut:
Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48(2): 407-428 (2003) - [j24]Kim S. Larsen:
Relaxed multi-way trees with group updates. J. Comput. Syst. Sci. 66(4): 657-670 (2003) - [j23]Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee:
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. J. Sched. 6(2): 131-147 (2003) - [c19]Jens S. Frederiksen, Kim S. Larsen:
Online Seat Reservations via Offine Seating Arrangements. WADS 2003: 174-185 - 2002
- [j22]Kim S. Larsen:
Relaxed red-black trees with group updates. Acta Informatica 38(8): 565-586 (2002) - [j21]Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein:
Fair versus Unrestricted Bin Packing. Algorithmica 34(2): 181-196 (2002) - [j20]Lars Jacobsen, Kim S. Larsen, Morten N. Nielsen:
On the existence and construction of non-extreme (a, b)-trees. Inf. Process. Lett. 84(2): 69-73 (2002) - [c18]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
Extending the Accommodating Function. COCOON 2002: 87-96 - [c17]Jens S. Frederiksen, Kim S. Larsen:
Packet Bundling. SWAT 2002: 328-337 - 2001
- [j19]Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed balance for search trees with local rebalancing. Acta Informatica 37(10): 743-763 (2001) - [j18]Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer:
Relaxed Balance Using Standard Rotations. Algorithmica 31(4): 501-512 (2001) - [j17]Lars Jacobsen, Kim S. Larsen:
Variants of (A, B)-Trees with Relaxed Balance. Int. J. Found. Comput. Sci. 12(4): 455-478 (2001) - [j16]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences. Nord. J. Comput. 8(4): 463-472 (2001) - [j15]Joan Boyar, Kim S. Larsen, Morten N. Nielsen:
The Accommodating Function: A Generalization of the Competitive Ratio. SIAM J. Comput. 31(1): 233-258 (2001) - [c16]Lars Jacobsen, Kim S. Larsen:
Complexity of Layered Binary Search Trees with Relaxed Balance. ICTCS 2001: 269-284 - [c15]Lars Jacobsen, Kim S. Larsen:
Exponentially Decreasing Number of Operations in Balanced Trees. ICTCS 2001: 293-311 - [c14]Kim S. Larsen:
Relaxed Multi-Way Trees with Group Updates. PODS 2001 - [c13]Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen:
Search Trees with Relaxed Balance and Near-Optimal Height. WADS 2001: 414-425 - 2000
- [j14]Kim S. Larsen:
AVL Trees with Relaxed Balance. J. Comput. Syst. Sci. 61(3): 508-522 (2000) - [c12]Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin:
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. COCOON 2000: 221-231 - [c11]Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213
1990 – 1999
- 1999
- [j13]Joan Boyar, Kim S. Larsen:
The Seat Reservation Problem. Algorithmica 25(4): 403-417 (1999) - [j12]Kim S. Larsen:
Partially persistent search trees with transcript operations. Discret. Math. Theor. Comput. Sci. 3(3): 95-107 (1999) - [j11]Kim S. Larsen:
On Grouping in Relational Algebra. Int. J. Found. Comput. Sci. 10(3): 301-311 (1999) - [c10]Joan Boyar, Kim S. Larsen, Morten N. Nielsen:
The Accommodating Function - A Generalization of the Competitive Ratio. WADS 1999: 74-79 - 1998
- [j10]Kim S. Larsen:
Amortized Constant Relaxed Rebalancing Using Standard Rotations. Acta Informatica 35(10): 859-874 (1998) - [j9]Kim S. Larsen:
Sort Order Problems in Relational Databases. Int. J. Found. Comput. Sci. 9(4): 399-430 (1998) - [j8]Kim S. Larsen:
Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy. Inf. Process. Lett. 65(4): 169-172 (1998) - [j7]Peter Høyer, Kim S. Larsen:
Parametric Permutation Routing via Matchings. Nord. J. Comput. 5(2): 105-114 (1998) - [c9]Kim S. Larsen:
Partially Persistent Search Trees with Transcript Operations. STACS 1998: 309-319 - 1997
- [j6]Joan Boyar, Rolf Fagerberg, Kim S. Larsen:
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. J. Comput. Syst. Sci. 55(3): 504-521 (1997) - [c8]Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed Balance for Search Trees with Local Rebalancing. ESA 1997: 350-363 - [c7]Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer:
Relaxed Balance through Standard Rotations. WADS 1997: 450-461 - 1996
- [j5]Kim S. Larsen, Rolf Fagerberg:
Efficient Rebalancing of B-Trees with Relaxed Balance. Int. J. Found. Comput. Sci. 7(2): 169-186 (1996) - 1995
- [c6]Kim S. Larsen, Rolf Fagerberg:
B-trees with relaxed balance. IPPS 1995: 196-202 - [c5]Uffe Engberg, Kim S. Larsen:
Efficient Simplification of Bisimulation Formulas. TACAS 1995: 111-132 - [c4]Joan Boyar, Rolf Fagerberg, Kim S. Larsen:
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995: 270-281 - 1994
- [j4]Joan Boyar, Faith E. Fich, Kim S. Larsen:
Bounds on Certain Multiplications of Affine Combinations. Discret. Appl. Math. 52(2): 155-167 (1994) - [j3]Joan Boyar, Kim S. Larsen:
Efficient Rebalancing of Chromatic Search Trees. J. Comput. Syst. Sci. 49(3): 667-682 (1994) - [j2]Kim S. Larsen, Michael I. Schwartzbach:
Injectivity of Composite Functions. J. Symb. Comput. 17(5): 393-408 (1994) - [c3]Kim S. Larsen:
AVL Trees with Relaxed Balance. IPPS 1994: 888-893 - 1992
- [j1]Kim S. Larsen, Michael I. Schwartzbach, Erik Meineche Schmidt:
A New Formalism for Relational Algebra. Inf. Process. Lett. 41(3): 163-168 (1992) - [c2]Joan Boyar, Kim S. Larsen:
Efficient Rebalancing of Chromatic Search Trees. SWAT 1992: 151-164
1980 – 1989
- 1988
- [c1]Mogens Nielsen, Uffe Engberg, Kim S. Larsen:
Fully abstract models for a process language with refinement. REX Workshop 1988: 523-548
Coauthor Index
[j60] [j59] [c55] [i27] [c54] [c53] [c52] [c51] [i26] [i25] [j58] [j57] [c50] [i24] [i22] [i21] [j56] [j55] [j54] [j53] [c49] [i20] [i19] [j52] [j50] [c48] [c46] [i18] [i17] [i16] [j49] [j48] [c40] [i15] [j46] [j45] [c39] [c37] [c36] [i14] [i13] [i12] [j44] [j43] [j41] [j39] [c35] [c34] [c31] [c30] [i9] [i8] [i6] [c29] [c28] [i5] [i4] [i3] [j33] [j31] [c25] [i1] [j30] [j29] [c23] [c22] [c21] [c20] [j26] [j23] [j21] [c18] [j16] [j15] [c12] [c11] [j13] [c10] [j6] [c4] [j4] [j3] [c2]
Lene M. Favrholdt
aka: Lene Monrad Favrholdt
aka: Lene Monrad Favrholdt
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:48 CET 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:
