DONALD K. FRIESENProfessor and Associate Head for Academics
Email: friesen@cs.tamu.edu
Ph.D. Computer Science, University of Illinois at Urbana-Champaign, 1978 RESEARCH INTERESTSAlgorithm analysis, complexity AWARDS
EXPERIENCE
PROFESSIONAL ACTIVITIES AND SERVICE
SELECTED PUBLICATIONSHarayama, T. and Friesen, D.K., "Weil Sum for Birthday Attack in Multivariate Quadratic Cryptosystem," Journal of Mathematical Cryptology, pp. 79-104, January 2007. J. Chen, Friesen, D., W. Jia and I. Kanj, "Using Nondeterminism to Design Efficient Deterministic Algorithms," Algorithmica, vol. 40, pp. 83-97, 2004. J. Chen, Friesen, D. and H. Zheng, "Tight Bound on Johnston's Algorithm for Maximum Satisfiability," Journal of Comp. Syst. Sciences, vol. 58, no. 3, June 1999. Friesen, D. and Jingyu Zhang, "Parallelizing the Computation of One Eigenvalue for a Large Aymmetric Tridaigonal Matrix," Proceedings of Eighth SIAM Conference for Scientific Computing, Mar. 1997. R. Fernandes, Friesen, D. and A. Kanevsky, "Efficient Routing and Broadcasting in Recursive Interconnect Networks," Proceedings of 1994 International Conference on Parallel Processing, Aug. 15-18, pp. 51-58, 1994. |
