Lars Jacobsen

According to our database, Lars Jacobsen authored at least 5 papers between 2001 and 2005.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2005

Exponentially decreasing number of operations in balanced trees.

Lars Jacobsen, Kim S. Larsen

Acta Informatica, 2005

2002

On the existence and construction of non-extreme (a, b)-trees.

Lars Jacobsen, Kim S. Larsen, Morten N. Nielsen

Inf. Process. Lett., 2002

2001

Variants of (A, B)-Trees with Relaxed Balance.

Lars Jacobsen, Kim S. Larsen

Int. J. Found. Comput. Sci., 2001

The Complexity of Clickomania

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro

CoRR, 2001

Complexity of Layered Binary Search Trees with Relaxed Balance.

Lars Jacobsen, Kim S. Larsen

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001