On the Vectorization of Graph Algorithms (Abstract). - Larry Basenspiler; Thomas F. Hain; Ben King (ACM Conference on Computer Science, 1990)

Senior Design Project Course: A Case Study. - Thomas F. Hain; Stephen M. Jodis (Comput. Sci. Educ., 1992)

A data link control protocol for LEO satellite networks providing a reliable datagram service. - Christopher Ward; Cheong H. Choi; Thomas F. Hain (IEEE/ACM Trans. Netw., 1995)

Interactive, visual testing strategy for computational geometry problems. - Thomas F. Hain; Somnath Gulve (ACM Southeast Regional Conference, 1998)

Fast termination criterion for recursive subdivision of Bézier curves. - Thomas F. Hain (ACM Southeast Regional Conference, 1999)

Precise flattening of cubic Bézier segments. - Thomas F. Hain; Athar L. Ahmad; David D. Langan (CCCG, 2004)

Fast, Precise Flattening of Cubic Be'zier Segment Offset Curves. - Thomas F. Hain; Sri Venkat R. Racherla; David D. Langan (SIBGRAPI, 2004)

A pattern-based development tool for mobile agents. - Vishal D. Modak; David D. Langan; Thomas F. Hain (SIGCSE, 2005)

Fast, precise flattening of cubic Bézier path and offset curves. - Thomas F. Hain; Athar L. Ahmad; Sri Venkat R. Racherla; David D. Langan (Comput. Graph., 2005)

A voice-activated syntax-directed editor for manually disabled programmers. - Thomas J. Hubbell; David D. Langan; Thomas F. Hain (ASSETS, 2006)

A Model for Voice-activated Expression Editing. - David D. Langan; Thomas F. Hain; W. Christopher Camery (Comput. Inf. Sci., 2008)

Clustering with Minimum Spanning Trees. - Yan Zhou; Oleksandr Grygorash; Thomas F. Hain (Int. J. Artif. Intell. Tools, 2011)