Lars Jacobsen

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2005
Exponentially decreasing number of operations in balanced trees.
Acta Inf., 2005

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

2001
Variants of (A, B)-Trees with Relaxed Balance.
Int. J. Found. Comput. Sci., 2001

Exponentially Decreasing Number of Operations in Balanced Trees.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Complexity of Layered Binary Search Trees with Relaxed Balance.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001


  Loading...