Curriculum Vitae:

Gary Knott, Ph.D., CEO, Civilized Software, Inc.
12109 Heritage Park Circle
Silver Spring, MD 20906

Telephone: (301) 962--3711, Fax: (301) 962--3712
E-mail: knott@civilized.com

American University (B.A. in Mathematics)
California Institute of Technology (M.S. Information Science)
Stanford University (Ph.D. in Computer Science, 1975)

Employment:
1985-date CEO, Civilized Software, Inc.
1985-1989 Assoc. Prof. of Computer Science, Univ. of Maryland
1965-1984 Commisioned Officer, USPHS, Computer Scientist: DCRT, NIH
1961-1965 Computer Programmer/Mathematician, NIH
1959-1961 Computer Operator, Dispatcher at CEIR, Inc.

Background in software systems design and implementation, starting in 1960 at C.E.I.R Inc., with experience in both non-numeric (database systems) and numeric (differential equation solving, curve-fitting) applications, and with operating systems and language translators.

Designed and developed components of software for Cancer End-Results and Framingham Heart and Smoking epidemiological studies in 1962--1964, the Recode and Select system in 1965 on the Honeywell 800, the Tablemaker system in 1965--1966 for the IBM S/360, and, as an ongoing development since 1970, the MLAB (Mathematical Modeling) system on the DECsystem-10, and, since 1986, commercially on various platforms. (See the review in The American Statistician, Vol. 50, No 4, pp. 368-378, Nov. 1996.) Mlab has figured in numerous scientific publications (see www.civilized.com).

Research Activities:
Various areas of computer science with special emphasis on storage and retrieval algorithms and the analysis of algorithms, mathematical and statistical modeling, computer graphics, splines, and early design of network-wide process intercommunication primitives (nowadays called object-brokering). Details may be found in the papers cited below. Pioneered four special topics of research in computer science. Namely: distribution-dependent hashing functions, extensible hash tables, insertion-deletion sensitivity in storage and retrieval algorithms, and numbering systems for binary trees.

BIBLIOGRAPHY: