Strongly Linearizable Hash Tables
activeSupervisor: Philipp Woelfel
distributed computing lock-free algorithms strong linearizability
My CPSC 502 honours thesis project, supervised by Prof. Philipp Woelfel. The goal is to develop a strongly linearizable version of the split-ordered hash table by Shalev and Shavit (2006) for use in randomized algorithms.