Events & News
Colloquium
| Category | Lecture |
| Date | Tuesday, February 11, 2014 |
| Time | 11:00 am |
| Concludes | 12:15 pm |
| Location | Gould-Simpson 906 |
| Details | Please join us for coffee and light refreshments at 10:45am in the 9th Floor Atrium. Faculty Host: Stephen Kobourov |
| Speaker | Michael Goodrich |
| Title | Chancellor's Professor & Department Chair |
| Affiliation | Computer Science, University of California-Irvine |
Combinatorial Pair Testing: Distinguishing Workers from Slackers
We formalize a problem we call combinatorial pair testing (CPT), which has applications to the identification of uncooperative or unproductive participants in pair programming, massively distributed computing, and crowdsourcing environments. We give efficient adaptive and nonadaptive CPT algorithms and we show that our methods use an optimal number of testing rounds to within constant factors. We also provide an empirical evaluation of some of our methods.
Biography
Michael T. Goodrich is a Chancellor's Professor and the chair of Department of Computer Science, of Donald Bren School of Information and Computer Sciences, at the University of California, Irvine. He 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 then served as a professor in the Department of Computer Science at Johns Hopkins University until 2001 and has since been a Chancellor's Professor at the University of California, Irvine where he is 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. He is a Fellow of the American Association for the Advancement of Science, a Fulbright Scholar, a Fellow of the IEEE, and a Fellow of the Association for Computing Machinery.