Fred B. Holt, PhD, MBA
Director - Strategic Initiatives - UW TechTransfer
Polytopes, Combinatorics, Networks, Data Mining, Geometry
Polytopes, Combinatorics, Networks, Data Mining, Geometry
Interests
Technology adoption:
how can we deliver great new inventions to the market?
The Hirsch Conjecture: We now know that the Hirsch bound (n-d) is sharp for all n > d > 6.
Ad-hoc and peer-to-peer networks: What is the durability of a graph under the random deletion of a percentage of its nodes?
Data-mining: inquire within
Prime numbers: the sequence of gaps between consecutive primes obeys a simple recursion. Simple and intriguing.
The Hirsch Conjecture: We now know that the Hirsch bound (n-d) is sharp for all n > d > 6.
Ad-hoc and peer-to-peer networks: What is the durability of a graph under the random deletion of a percentage of its nodes?
Data-mining: inquire within
Prime numbers: the sequence of gaps between consecutive primes obeys a simple recursion. Simple and intriguing.
Bio
MBA, Seattle U. 2005
PhD Mathematics under Vic Klee, U.Washington, 1996
BSM Mathematics and BA Philosophy, Seattle U. 1984
Boeing - IT R&D 1986-2002
Panthesis - born 2001, died 2005
PhD Mathematics under Vic Klee, U.Washington, 1996
BSM Mathematics and BA Philosophy, Seattle U. 1984
Boeing - IT R&D 1986-2002
Panthesis - born 2001, died 2005
Send mail to:
fbholt@u.washington.edu
Last modified: 21 February 2009 5PM
Last modified: 21 February 2009 5PM