April
2014
NAME: Donald K. Friesen
TITLE: Professor Emeritus
EDUCATION:
Ph.D. Computer Science, University of Illinois, 1978
Ph.D. Mathematics, Dartmouth College, 1966
M.C.S. Mathematics, Dartmouth College, 1965
B.A. Mathematics, Knox College, 1963
EXPERIENCE:
Educational: Professor, Computer Science, Texas A&M University, 1990-Present; Associate Professor, Computer Science, Texas A&M University, 1983-1990; Assistant Professor, Texas A&M University, 1978-1983; Research Assistant, Computer Science, University of Illinois, 1977-1978; Teaching Assistant, Computer Science, University of Illinois, 1975-1976; Assistant Professor, Mathematics, University of Illinois, 1967-1974; J.W. Young Research Instructor, Mathematics, Dartmouth College, 1966-1967.
Industrial: Scientific Programmer, Lawrence Livermore Laboratory, Summer, 1964; Instructor of IBM short courses on Reliability, Computer Science Fundamentals, and Algorithms and Data Structures, 1981-1988.
Consulting: Texas Eastman, 1991-1993, Ralston Purina, 1992-1993.
HONORS AND PROFESSIONAL ACTIVITIES:
Phi Beta Kappa; Upsilon Pi Epsilon; Woodrow Wilson Fellowship; IEEE; Association for Computing Machinery; IEEE Computer Society; INFORMS; SIGACT.
RESEARCH INTEREST/AREAS OF EXPERTISE: Algorithm Analysis, Computational Geometry, Scheduling Theory, Artificial Intelligence, Parallel Algorithms, Computational Complexity
STUDENTS SUPERVISED: Ph.D. Graduates: 18 M.S. Graduates: 13 Current Ph.D.: 0 Current M.S.: 0
NUMBER OF PUBLICATIONS: Journal Publications: 24 Conference Proceedings: 21 Presentations: 30
SELECTED PUBLICATIONS:
“Scheduling on same-speed processors with at most one downtime on each machine,” Disc. Opt., Vol. 7, pp. 212-221, 2010, (co-authored with Liliana Grigoriu)
"Weil Sum for Birthday Attack in Multivariate Quadratic Cryptosystem," J. Math. Crypt., Vol. 1, pp. 79-104, 2007, (co-authored with Tomohiro Harayama)
"Using Nondeterminism to Design Efficient Deterministic Algorithms," Algorithmica, Vol. 40, pp. 83-97, 2004, (co-authored with J. Chen, W. Jia, and I. Kanj)
"Tight Bound on Johnson's Algorithm for Maximum Satisfiability," J. Comp. Syst. Sciences, Vol. 58, No. 3 June 1999, (co-authored with J. Chen and H. Zheng)
"Parallel Algorithms for some Dominance Problems Based on the PRAM Model," International Journal of Computational Geometry & Applications, Vol. 3, No. 4, December 1993, (co-authored with I.W. Chan)
"Analysis of a Compound Bin Packing Algorithm," SIAM J. on Disc. Math., Vol. 4, No. 1, Feb. 1991 (co-authored with M.A. Langston).
"Analysis of a Hybrid Algorithm for Packing Unequal Bins," SIAM J. on Computing, 17, No. 1, pp. 23-40, 1988 (co-authored with F.S. Kuhl).
"Bin Packing: on Optimizing the Number of Pieces Packed," BIT, 27, pp. 148-156, 1987 (co-authored with M.A. Langston).
"Tighter Bounds on LPT Scheduling on Uniform Processors," SIAM J. on Computing, 16, No. 3, pp. 554-560, 1987.
"Variable Sized Bin Packing," SIAM J. on Computing, 15, No. 1, pp. 222-230, 1986 (co-authored with M.A. Langston).
"Evaluation of a MULTIFIT-based Scheduling Algorithm," J. of Algs. 7, No. 1, pp. 35-59, 1986 (co-authored with M.A. Langston).
"A Storage-size Selection Problem," Inform. Proc. Letters, 18, pp. 295-296, 1984 (co-authored with M.A. Langston).
"A Linear-time Algorithm for Classifying the States of a Finite Markov Chain," Operation Res. Letters, 2, No. 6, pp. 297-301, 1984 (co-authored with B.L. Deuermeyer).