Michael T. Goodrich

Pioneer and research leader on efficient parallel and distributed solutions, Goodrich has served as a Chancellor's Professor and chair of the Department of Computer Science of the Donald Bren School of Information and Computer Sciences at the University of California, Irvine. He received his B.A. degree in Mathematics and Computer Science from Calvin College in 1983, his M.S. degree in 1985, and his Ph.D. in 1987 under the supervision of Mikhail Atallah, both graduate degrees in Computer Sciences from Purdue University. He then joined the Department of Computer Science at Johns Hopkins University as a professor, remaining until 2001, and subsequently has served as a Chancellor's Professor at the University of California, Irvine, where he has been the Associate Dean for Faculty Development in the Donald Bren School of Information and Computer Sciences and Technical Director for the ICS Secure Computing and Networking Center (SCONCE).

His research has been directed at the design of high performance algorithms and data structures with applications to information assurance and security, the Internet, machine learning, and geometric computing. Goodrich pioneered and led research on efficient solutions to a number of fundamental problems, including sorting, convex hull construction, nearest-neighbor searching, linear programming, privacy-preserving data access, network traceback, segment intersection reporting, fixed-dimensional linear programming, polygon triangulation, Voronoi diagram construction, and data authentication.

He is named a Fellow of the American Association for the Advancement of Science, a Fulbright Scholar, a Fellow of the Institute of Electrical and Electronics Engineers (IEEE), and a 2009 Fellow of the Association for Computing Machinery (ACM), "For contributions to data structures and algorithms for combinatorial and geometric problems." Goodrich has also served as a member of the editorial boards of several top journals on algorithms, including: Computational Geometry: Theory and Applications (CGTA); International Journal of Computational Geometry and Applications (IJCGA); Journal of Graph Algorithms and Applications (JGAA); and Journal of Computer and System Sciences (JCSS).

He is the recipient of several awards, among which are the 2006 IEEE Computer Society Technical Achievement Award, "For outstanding contributions to the design of parallel and distributed algorithms for fundamental combinatorial and geometric problems"; the NSF Research Initiation Award; the DARPA Spirit of Technology Transfer Award; the Brown University Award for Technological Innovation; the ACM Recognition of Service Award; and the Pond Award for Excellence in Undergraduate Teaching.

With over 300 publications, including several widely adopted books, his recent work has included contributions to efficient and secure distributed data structures, information privacy, social networks, and cloud security. Goodrich has served as a consultant to AT&T, Walt Disney Animation Studios, and the National Science Foundation, and he has experience as an expert witness in patent litigation involving algorithms, cryptography, operating systems, digital rights management (DRM), networking, and storage technologies.