Rocco Anthony Servedio

Rocco A. Servedio is a theoretical computer scientist whose work aims at elucidating the boundary between computationally tractable and intractable problems. He has developed algorithms and established lower bounds for learning many fundamental classes of Boolean functions and probability distributions as well as for property testing of such classes.

He is a Professor of Computer Science in the Department of Computer Science and former department chair. 

Research Areas Include:

Computational Complexity Theory
Computational Learning Theory
Sub-linear Time Algorithms and Property Testing
Randomness Testing in Computing