1: Dualheap Selection Algorithm: Efficient, Inherently Parallel and Somewhat Mysterious
2: The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$
3: Cache Analysis of Non-uniform Distribution Sorting Algorithms
4: Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort
5: Group Testing with Random Pools: optimal two-stage algorithms