| 2005 |
|---|
| 6 | EE | Lars Jacobsen,
Kim S. Larsen:
Exponentially decreasing number of operations in balanced trees.
Acta Inf. 42(1): 57-78 (2005) |
| 2002 |
|---|
| 5 | EE | 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) |
| 2001 |
|---|
| 4 | EE | Lars Jacobsen,
Kim S. Larsen:
Complexity of Layered Binary Search Trees with Relaxed Balance.
ICTCS 2001: 269-284 |
| 3 | EE | Lars Jacobsen,
Kim S. Larsen:
Exponentially Decreasing Number of Operations in Balanced Trees.
ICTCS 2001: 293-311 |
| 2 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer,
Lars Jacobsen,
J. Ian Munro:
The Complexity of Clickomania
CoRR cs.CC/0107031: (2001) |
| 1 | | Lars Jacobsen,
Kim S. Larsen:
Variants of (A, B)-Trees with Relaxed Balance.
Int. J. Found. Comput. Sci. 12(4): 455-478 (2001) |
