Generation and Analysis of Hard to Round Cases for Binary Floating Point Division. - Lee D. McFearin; David W. Matula (IEEE Symposium on Computer Arithmetic, 2001)

Binary Multiplication Radix-32 and Radix-256. - Peter-Michael Seidel; Lee D. McFearin; David W. Matula (IEEE Symposium on Computer Arithmetic, 2001)

Selecting A Well Distributed Hard Case Test Suite for IEEE Standard Floating Point Division. - Lee D. McFearin; David W. Matula (ICCD, 2001)

Evaluating Products of Non Linear Functions by Indirect Bipartite Table Lookup. - David W. Matula; Alex Fit-Florea; Lee D. McFearin (ASAP, 2002)

A p×p bit fraction model of binary floating point division and extremal rounding cases. - David W. Matula; Lee D. McFearin (Theor. Comput. Sci., 2003)

Secondary Radix Recodings for Higher Radix Multipliers. - Peter-Michael Seidel; Lee D. McFearin; David W. Matula (IEEE Trans. Computers, 2005)

A formal model and efficient traversal algorithm for generating testbenches for verification of IEEE standard floating point division. - David W. Matula; Lee D. McFearin (DATE, 2006)

Chroot Jail. - Lee D. McFearin (Encyclopedia of Cryptography and Security (2nd Ed.), 2011)