Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kim S. Larsen
2010 – today
- 2013
[j34]Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen: List Factoring and Relative Worst Order Analysis. Algorithmica 66(2): 287-309 (2013)- [i6]Joan Boyar, Sushmita Gupta, Kim S. Larsen: Relative Interval Analysis of Paging Algorithms on Access Graphs. CoRR abs/1305.0669 (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 Inf. 47(7-8): 359-374 (2010)
- [j32]Kim S. Larsen, Sanne Wøhlk: Competitive analysis of the online inventory problem. European Journal of Operational Research 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]
- [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 Inf. 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
- 2003
- [j26]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the accommodating function. Acta Inf. 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. Scheduling 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]
- [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]
- 2001
- [j19]Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen: Relaxed balance for search trees with local rebalancing. Acta Inf. 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]
- [c13]Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen: Search Trees with Relaxed Balance and Near-Optimal Height. WADS 2001: 414-425
- 2000
- [j14]
- [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]
- [j12]Kim S. Larsen: Partially persistent search trees with transcript operations. Discrete Mathematics & Theoretical Computer Science 3(3): 95-107 (1999)
- [j11]
- [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 Inf. 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]
- 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]
- [c5]
- [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. Discrete Applied Mathematics 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]
- 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]
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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:10 CEST by the dblp team