Alan L. Tharp

Learn 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)
Undergraduate computer science degree programs often provide an opportunity for students to experience real software projects as a part of their programs of study. These experiences frequently reside in a course in which students form software development teams, are assigned to a project offered by a corporate sponsor and devote one or two semesters to the(More)