Dr. Nikolas Askitis

Expert
@naskitis

Hi. I have provided my PhD thesis and my code, plus other projects, to help you learn how to develop high-performance data structures for strings. Enjoy :+1:

Efficient-Data-Structures-for-Cache-Architectures. My PhD thesis, provided for your online reading. Learn how to code high-performance string data structures and data management algorithms. I recommend that you read this before you look at the code.

66

Cache-Conscious-Data-Structures. The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.

44

B-trie. The B-trie and B-tree, written in C, as described in my PhD thesis.

31

HAT-trie. The HAT-trie, written in C, as described in my PhD thesis.

21

BurstSort. My implementation of the copy-based BurstSort sorting algorithm, but which uses the array burst trie as its foundation.

6

OzSort. Winner of the 2009 and 2010 Penny Sort Competition, External Merge Sort, written in C.

4
6
Apply