The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kim S. Larsen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  55. Better Bounds on Online Unit Clustering. [Citation Graph (, )][DBLP]


  56. A Comparison of Performance Measures for Online Algorithms. [Citation Graph (, )][DBLP]


  57. A Comparison of Performance Measures for Online Algorithms [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002