CS Colloquium Series - Michael Goodrich

Blood on the Computer: How Algorithms for Testing Blood Samples can be used for DNA Sequencing, Wireless Broadcasting, and Network SecurityDr. Michael GoodrichUniversity of California-IrvineAbstract:
This talk discusses combinatorial group testing, which began from work on detecting diseases in blood samples taken from GIs in WWII. Given a parameter d, which provides an upper bound on the number of defective (e.g., diseased) samples, the main objective of such problems is to design algorithms that identify all the defective samples without explicitly testing all n samples. This classic problem has a number of interesting modern applications, and we provide several new efficient algorithms that can be applied in these new contexts. In particular, modern applications we will discuss include problems in DNA sequencing, wireless broadcasting, and network security.Biography:
Prof. Goodrich received his B.A. in Mathematics and Computer Science from Calvin College in 1983 and his PhD in Computer Sciences from Purdue University in 1987. He served as a professor of computer science at Johns Hopkins University from 1987-2001, and a professor of computer science since 2001 at UC-Irvine, where he also serves as director of the Center of Cyber-Security and Privacy, as well as Equity Advisor and Associate Dean for Academic Personnel in the Donald Bren School of Information and Computer Sciences. He has also served on the faculties of Univ. of Illinois and Brown University during sabbatical visits.
Dr. Goodrich's research is directed at the design of high performance algorithms and data structures for solving large-scale problems motivated from information assurance and security, the Internet, information visualization, and geometric computing. He has pioneered and led research on efficient parallel and distributed solutions to a number of fundamental problems, including sorting, convex hull construction, segment intersection reporting, fixed-dimensional linear programming, polygon triangulation, Voronoi diagram construction, and data authentication.
With nearly 200 publications, including several widely adopted books, his recent work includes contributions to efficient and secure distributed data structures, authenticated geometric searching, IP traceback, and network/grid security. He is an ACM Distinguished Scientist, a Compere Loveless Fellow, and a member of the Fulbright Senior Specialist Roster, the Sigma Xi Scientific Research Honor Society, and the editorial boards of several top journals on algorithms. He is a recipient of the IEEE Computer Society Technical Achievement Award, the NSF Research Initiation Award, the DARPA Spirit of Technology Transfer Award, the Brown Univ. Award for Technological Innovation, the ACM Recognition of Service Award, and the Pond Award for Excellence in Undergraduate Teaching.

Location: Seaver Science Library (SSL) - 150

Audiences: Everyone Is Invited

Contact: Nancy Levien