[Mittagsseminar TI] Fwd: [i-prof] Invitation to my bachelor thesis defence

[Wolfgang Mulzer <mulzer@inf.fu-berlin.de>]

Tomorrow's Mittagsseminar.

Please note the unusual time and location.

Cheers

Wolfgang


-------- Forwarded Message --------
Subject: 	[i-prof] Invitation to my bachelor thesis defence
Date: 	Tue, 24 Oct 2023 20:26:18 +0200
From: 	Chao Zhan <chao.zhan@fu-berlin.de>
To: 	i-profs@inf.fu-berlin.de, i-wimis@inf.fu-berlin.de, 
i-studi@inf.fu-berlin.de, maria.koekenhoff@fu-berlin.de



Dear all,

I would like to invite you to my bachelor thesis defence, titled 
"Persistent Binary Search Trees and Their Practical Applications."

The defence will be held in room SR053 (Takustraße 9) on Tuesday, 
October 31st, 2023 at 14:30. English will be the language of the defence.

Advisor and first reviewer: Prof. Dr. Wolfgang Mulzer
Second reviewer:Prof. Dr. László Kozma

Best regards,
Chao Zhan

Abstract:
Ephemeral data structures retain only the most recent version of the
data structures, while persistent data structures maintain a full history
of the data structures. Fortunately, several methods can be employed
to make any pointer-based ephemeral data structure persistent. This
thesis aims to clarify and analyse classical approaches and apply them
to the implementation of persistent binary search trees. Subsequently,
we evaluate the efficiency of these approaches by conducting several
benchmark tests. Furthermore, a partially persistent binary search tree
is employed to address the traditional planar point location problem.
This approach offers a solution with O(n) space cost, O(logn) query
time, and O(nlogn) preprocessing time.

Attachment: smime.p7s
Description: S/MIME Cryptographic Signature