| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Kim S. Larsen 30 Jens S. Frederiksen , Kim S. Larsen: Packet Bundling. SWAT 2002 : 328-337 29 Lars Jacobsen , Kim S. Larsen: Complexity of Layered Binary Search Trees with Relaxed Balance. ICTCS 2001 : 269-284 28 Lars Jacobsen , Kim S. Larsen: Exponentially Decreasing Number of Operations in Balanced Trees. ICTCS 2001 : 293-311 27 Kim S. Larsen: Relaxed Multi-Way Trees with Group Updates. PODS 2001 26 Rolf Fagerberg , Rune E. Jensen , Kim S. Larsen: Search Trees with Relaxed Balance and Near-Optimal Height. WADS 2001 : 414-425 25 Kim S. Larsen, Thomas Ottmann , Eljas Soisalon-Soininen : Relaxed balance for search trees with local rebalancing. Acta Informatica 37 (10): 743-763 (2001) 24 Kim S. Larsen, Eljas Soisalon-Soininen , Peter Widmayer : Relaxed Balance Using Standard Rotations. Algorithmica 31 (4): 501-512 (2001) 23 Lars Jacobsen , Kim S. Larsen: Variants of (A, B)-Trees with Relaxed Balance. International Journal of Foundations of Computer Science 12 (4): 455-478 (2001) 22 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 21 Yossi Azar , Joan Boyar , Lene M. Favrholdt , Kim S. Larsen, Morten N. Nielsen : Fair versus Unrestricted Bin Packing. SWAT 2000 : 200-213 20 Kim S. Larsen: AVL Trees with Relaxed Balance. JCSS 61 (3): 508-522 (2000) 19 Joan Boyar , Kim S. Larsen, Morten N. Nielsen : The Accommodating Function - A Generalization of the Competitive Ratio. WADS 1999 : 74-79 18 Joan Boyar , Kim S. Larsen: The Seat Reservation Problema. Algorithmica 25 (4): 403-417 (1999) 17 Kim S. Larsen: On Grouping in Relational Algebra. International Journal of Foundations of Computer Science 10 (3): 301-311 (1999) 16 Kim S. Larsen: Partially Persistent Search Trees with Transcript Operations. STACS 1998 : 309-319 15 Kim S. Larsen: Amortized Constant Relaxed Rebalancing Using Standard Rotations. Acta Informatica 35 (10): 859-874 (1998) 14 Kim S. Larsen: Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy. Information Processing Letters 65 (4): 169-172 (1998) 13 Kim S. Larsen: Sort Order Problems in Relational Databases. International Journal of Foundations of Computer Science 9 (4): 399-430 (1998) 12 Peter Høyer , Kim S. Larsen: Parametric Permutation Routing via Matchings. Nordic Journal of Computing 5 (2): 105-114 (1998) 11 Kim S. Larsen, Thomas Ottmann , Eljas Soisalon-Soininen : Relaxed Balance for Search Trees with Local Rebalancing. ESA 1997 : 350-363 10 Kim S. Larsen, Eljas Soisalon-Soininen , Peter Widmayer : Relaxed Balance through Standard Rotations. WADS 1997 : 450-461 9 Joan Boyar , Rolf Fagerberg , Kim S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. JCSS 55 (3): 504-521 (1997) 8 Kim S. Larsen, Rolf Fagerberg : Efficient Rebalancing of B-Trees with Relaxed Balance. International Journal of Foundations of Computer Science 7 (2): 169- (1996) 7 Uffe Engberg , Kim S. Larsen: Efficient Simplification of Bisimulation Formulas. TACAS 1995 : 111-132 6 Joan Boyar , Rolf Fagerberg , Kim S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995 : 270-281 5 Joan Boyar , Kim S. Larsen: Efficient Rebalancing of Chromatic Search Trees. JCSS 49 (3): 667-682 (1994) 4 Kim S. Larsen, Michael I. Schwartzbach : Injectivity of Composite Functions. JSC 17 (5): 393-408 (1994) 3 Joan 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. Information Processing Letters 41 (3): 163-168 (1992) 1 Mogens Nielsen , Uffe Engberg , Kim S. Larsen: Fully abstract models for a process language with refinement. REX Workshop 1988 : 523-548  DiSC'02 © 2003 Association for Computing Machinery |
