Complexity of Layered Binary Search Trees with Relaxed Balance. - Lars Jacobsen; Kim S. Larsen (ICTCS, 2001)

The Complexity of Clickomania - Therese C. Biedl; Erik D. Demaine; Martin L. Demaine; Rudolf Fleischer; Lars Jacobsen; J. Ian Munro (CoRR, 2001)

Variants of (A, B)-Trees with Relaxed Balance. - Lars Jacobsen; Kim S. Larsen (Int. J. Found. Comput. Sci., 2001)

On the existence and construction of non-extreme (a, b)-trees. - Lars Jacobsen; Kim S. Larsen; Morten N. Nielsen (Inf. Process. Lett., 2002)

Exponentially decreasing number of operations in balanced trees. - Lars Jacobsen; Kim S. Larsen (Acta Informatica, 2005)

Deep-Learning Based Virtual Stain Multiplexing Immunohistochemistry Slides - a Pilot Study. - Oded Ben-David; Elad Arbel; Daniela Rabkin; Itay Remer; Amir Ben-Dor; Sarit Aviel-Ronen; Frederik Aidt; Tine Hagedorn-Olsen; Lars Jacobsen; Kristopher Kersch; Anya Tsalenko (COMPAY@MICCAI, 2024)