dblp.uni-trier.dewww.uni-trier.de

Kim S. Larsen Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
56EEJoan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms. WADS 2009: 119-130
2008
55EEJoan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms CoRR abs/0806.0983: (2008)
2007
54EEJoan 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
53EEMarco Chiarandini, Thomas Stützle, Kim S. Larsen: Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem. Hybrid Metaheuristics 2006: 162-177
52EEJoan 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
51EEJoan 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)
2005
50EEJoan 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
49EEJoan Boyar, Lene M. Favrholdt, Kim S. Larsen: The relative worst order ratio applied to paging. SODA 2005: 718-727
48EELars Jacobsen, Kim S. Larsen: Exponentially decreasing number of operations in balanced trees. Acta Inf. 42(1): 57-78 (2005)
47EEJens S. Kohrt, Kim S. Larsen: On-line seat reservations via off-line seating arrangements. Int. J. Found. Comput. Sci. 16(2): 381-397 (2005)
2004
46EEAllan Borodin, Joan Boyar, Kim S. Larsen: Priority Algorithms for Graph Optimization Problems. WAOA 2004: 126-139
2003
45EEJens S. Frederiksen, Kim S. Larsen: Online Seat Reservations via Offine Seating Arrangements. WADS 2003: 174-185
44EEJoan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the accommodating function. Acta Inf. 40(1): 3-35 (2003)
43EEJens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut: Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48(2): 407-428 (2003)
42EEKim S. Larsen: Relaxed multi-way trees with group updates. J. Comput. Syst. Sci. 66(4): 657-670 (2003)
41 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)
2002
40EEJoan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the Accommodating Function. COCOON 2002: 87-96
39EEJens S. Frederiksen, Kim S. Larsen: Packet Bundling. SWAT 2002: 328-337
38EEKim S. Larsen: Relaxed red-black trees with group updates. Acta Inf. 38(8): 565-586 (2002)
37EEYossi 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)
36EELars 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)
2001
35EELars Jacobsen, Kim S. Larsen: Complexity of Layered Binary Search Trees with Relaxed Balance. ICTCS 2001: 269-284
34EELars Jacobsen, Kim S. Larsen: Exponentially Decreasing Number of Operations in Balanced Trees. ICTCS 2001: 293-311
33EEKim S. Larsen: Relaxed Multi-Way Trees with Group Updates. PODS 2001
32EERolf Fagerberg, Rune E. Jensen, Kim S. Larsen: Search Trees with Relaxed Balance and Near-Optimal Height. WADS 2001: 414-425
31EEKim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen: Relaxed balance for search trees with local rebalancing. Acta Inf. 37(10): 743-763 (2001)
30EEKim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balance Using Standard Rotations. Algorithmica 31(4): 501-512 (2001)
29 Lars Jacobsen, Kim S. Larsen: Variants of (A, B)-Trees with Relaxed Balance. Int. J. Found. Comput. Sci. 12(4): 455-478 (2001)
28EEJoan 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)
27EEJoan Boyar, Kim S. Larsen, Morten N. Nielsen: The Accommodating Function: A Generalization of the Competitive Ratio. SIAM J. Comput. 31(1): 233-258 (2001)
2000
26EEEric 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
25EEYossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213
24 Kim S. Larsen: AVL Trees with Relaxed Balance. J. Comput. Syst. Sci. 61(3): 508-522 (2000)
1999
23EEJoan Boyar, Kim S. Larsen, Morten N. Nielsen: The Accommodating Function - A Generalization of the Competitive Ratio. WADS 1999: 74-79
22EEJoan Boyar, Kim S. Larsen: The Seat Reservation Problem. Algorithmica 25(4): 403-417 (1999)
21EEKim S. Larsen: Partially persistent search trees with transcript operations. Discrete Mathematics & Theoretical Computer Science 3(3): 95-107 (1999)
20 Kim S. Larsen: On Grouping in Relational Algebra. Int. J. Found. Comput. Sci. 10(3): 301-311 (1999)
1998
19EEKim S. Larsen: Partially Persistent Search Trees with Transcript Operations. STACS 1998: 309-319
18EEKim S. Larsen: Amortized Constant Relaxed Rebalancing Using Standard Rotations. Acta Inf. 35(10): 859-874 (1998)
17EEKim S. Larsen: Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy. Inf. Process. Lett. 65(4): 169-172 (1998)
16 Kim S. Larsen: Sort Order Problems in Relational Databases. Int. J. Found. Comput. Sci. 9(4): 399-430 (1998)
15 Peter Høyer, Kim S. Larsen: Parametric Permutation Routing via Matchings. Nord. J. Comput. 5(2): 105-114 (1998)
1997
14EEKim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen: Relaxed Balance for Search Trees with Local Rebalancing. ESA 1997: 350-363
13 Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balance through Standard Rotations. WADS 1997: 450-461
12 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)
1996
11 Kim S. Larsen, Rolf Fagerberg: Efficient Rebalancing of B-Trees with Relaxed Balance. Int. J. Found. Comput. Sci. 7(2): 169- (1996)
1995
10EEKim S. Larsen, Rolf Fagerberg: B-trees with relaxed balance. IPPS 1995: 196-202
9 Uffe Engberg, Kim S. Larsen: Efficient Simplification of Bisimulation Formulas. TACAS 1995: 111-132
8 Joan Boyar, Rolf Fagerberg, Kim S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995: 270-281
1994
7 Kim S. Larsen: AVL Trees with Relaxed Balance. IPPS 1994: 888-893
6EEJoan Boyar, Faith E. Fich, Kim S. Larsen: Bounds on Certain Multiplications of Affine Combinations. Discrete Applied Mathematics 52(2): 155-167 (1994)
5 Joan Boyar, Kim S. Larsen: Efficient Rebalancing of Chromatic Search Trees. J. Comput. Syst. Sci. 49(3): 667-682 (1994)
4 Kim S. Larsen, Michael I. Schwartzbach: Injectivity of Composite Functions. J. Symb. Comput. 17(5): 393-408 (1994)
1992
3EEJoan Boyar, Kim S. Larsen: Efficient Rebalancing of Chromatic Search Trees. SWAT 1992: 151-164
2 Kim S. Larsen, Michael I. Schwartzbach, Erik Meineche Schmidt: A New Formalism for Relational Algebra. Inf. Process. Lett. 41(3): 163-168 (1992)
1988
1EEMogens Nielsen, Uffe Engberg, Kim S. Larsen: Fully abstract models for a process language with refinement. REX Workshop 1988: 523-548

Coauthor Index

1Yossi Azar [25] [37]
2Eric Bach [26] [41]
3Allan Borodin [46]
4Joan Boyar [3] [5] [6] [8] [12] [22] [23] [25] [26] [27] [28] [37] [40] [41] [44] [46] [49] [50] [51] [52] [54] [55] [56]
5Marco Chiarandini [53]
6Martin R. Ehmsen [52]
7Faith Ellen (Faith Ellen Fich, Faith E. Fich) [6]
8Uffe Engberg [1] [9]
9Leah Epstein [37] [41] [50] [51]
10Rolf Fagerberg [8] [10] [11] [12] [32]
11Lene M. Favrholdt [25] [28] [37] [40] [41] [44] [49] [50] [51] [54]
12Peter Høyer [15]
13Sandy Irani [55] [56]
14Lars Jacobsen [29] [34] [35] [36] [48]
15Rune E. Jensen [32]
16Tao Jiang [26] [41]
17Jens S. Kohrt (Jens S. Frederiksen) [39] [43] [45] [47] [50] [51]
18Guohui Lin (Guo-Hui Lin) [26] [41]
19Mogens Nielsen [1]
20Morten N. Nielsen [23] [25] [27] [28] [36] [37] [40] [44]
21John Noga [43]
22Thomas Ottmann [14] [31]
23Morten Monrad Pedersen [50] [51]
24Erik Meineche Schmidt [2]
25Michael I. Schwartzbach [2] [4]
26Eljas Soisalon-Soininen [13] [14] [30] [31]
27Rob van Stee [41]
28Thomas Stützle [53]
29Patchrawat Uthaisombut [43]
30Peter Widmayer [13] [30]
31Sanne Wøhlk [50] [51]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)