naskitis

Dr. Nikolas Askitis's repositories

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 20

Cache-Conscious-Data-Structures

The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.

Language:C39 40

B-trie

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

Language:C21 10

HAT-trie

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

Language:C19 2 1

BurstSort

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

Language:C400

OzSort

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

Language:C3 10

Repmaestro

The software for Repmaestro, written for Linux x64 platforms, as described in the published literature.

Language:Shell000