Lee D. McFearin

According to our database, Lee D. McFearin authored at least 8 papers between 2001 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2011

Chroot Jail.

Lee D. McFearin

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

2006

A formal model and efficient traversal algorithm for generating testbenches for verification of IEEE standard floating point division.

David W. Matula, Lee D. McFearin

Proceedings of the Conference on Design, Automation and Test in Europe, 2006

2005

Secondary Radix Recodings for Higher Radix Multipliers.

Peter-Michael Seidel, Lee D. McFearin, David W. Matula

IEEE Trans. Computers, 2005

2003

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

2002

Evaluating Products of Non Linear Functions by Indirect Bipartite Table Lookup.

David W. Matula, Alex Fit-Florea, Lee D. McFearin

Proceedings of the 13th IEEE International Conference on Application-Specific Systems, 2002

2001

Selecting A Well Distributed Hard Case Test Suite for IEEE Standard Floating Point Division.

Lee D. McFearin, David W. Matula

Proceedings of the 19th International Conference on Computer Design (ICCD 2001), 2001

Binary Multiplication Radix-32 and Radix-256.

Peter-Michael Seidel, Lee D. McFearin, David W. Matula

Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001

Generation and Analysis of Hard to Round Cases for Binary Floating Point Division.

Lee D. McFearin, David W. Matula

Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001