Skip to content
View naskitis's full-sized avatar

Block or report naskitis

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Pinned Loading

  1. Cache-Conscious-Data-Structures Cache-Conscious-Data-Structures Public

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

    C 40 6

  2. HAT-trie HAT-trie Public

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

    C 19 3

  3. B-trie B-trie Public

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

    C 25 8

  4. BurstSort BurstSort Public

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

    C 4 1

  5. OzSort OzSort Public

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

    C 3 3

  6. Efficient-Data-Structures-for-Cache-Architectures Efficient-Data-Structures-for-Cache-Architectures Public

    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 3