Strongly Linearizable Hash Tables
activeSupervisor: Philipp Woelfel
distributed computing lock-free algorithms strong linearizability
Continuation of my honours thesis research project at the University of Calgary. I am developing an efficient and practical strongly linearizable hash table implementation for randomized algorithms.