Anton Wakolbinger

Radix sort trees in the large

2017 · Electronic Communications in Probability

The trie-based radix sort algorithm stores pairwise different infinite binary strings in the leaves of a binary tree in a way that the Ulam-Harris coding of each leaf equals a prefix (that is, an initial …

PATRICIA bridges

2018 · arXiv (Cornell University)

A radix sort tree arises when storing distinct infinite binary words in the leaves of a binary tree such that for any two words their common prefixes coincide with the common prefixes of the corresponding …