Alan L. Tharp

Learn More
This article presents a procedure for constructing a near-perfect hashing function. The procedure, which is a modification of Cichelli’s algorithm, builds the near-perfect hashing function sufficiently fast to allow larger word sets to be used than were previously possible. The improved procedure is the result of examining the original algorithm for the(More)
This article presents a simple algorithm for packing sparse 2-D arrays into minimal I-D arrays in O(r?) time. Retrieving an element from the packed I-D array is O(l). This packing algorithm is then applied to create minimal perfect hashing functions for large word lists. Many existing perfect hashing algorithms process large word lists by segmenting them(More)
With the diversity of high-level programming languages available, selecting the “right” one for a computer science curriculum or course can be a befuddling process. For a multitude of reasons, such as the manner in which students approach problems to the utilization of scarce computing resources, the ramifications of a decision on the choice of(More)
4any current perfect hashing algorithms suffer from the problem of pattern collisions. In this paper, a perfect hashing technique that uses array-based tries and a simple sparse matrix packing algorithm is introduced. This technique eliminates all pattern collisions, and because of this it can be used to form ordered minimal perfect hash functions on(More)