Attempts at optimal sorting algorithms.
- A nlogn work logn depth Algorithm for sorting which is more practical than bitonic sort. My most noteworthy attempt is a parallelization of mergesort written in haskell, which will compared to other sorts. The algorithm is untested, and unproven.
- A n work logn depth Algorithm for sorting small numbers in the range [0,poly(n)] Two attempts are tinysort and smallsort. Both Algorithms are untested.
- A sub nlogn sorting algorithm which uses hashing and truncation. The algorithm is untested, and randomized.
- Discussing L vs NC^1 via sorting/permutation logic. Attempting a complexity theorem.
- Analyzing Bitonic Merge. What happens when you feed this circuit a non-bitonic sequence.