Assistant Professor Martin Strauss received his Ph.D. in Mathematics from Rutgers University in 1995. His dissertation studied feasible complexity classes. From 1996 to 2004 he was employed at the AT&T Laboratories, most recently as a principal technical staff member. His research lies in the area of theoretical and applied computer science, specifically fundamental algorithms, computer security and cryptography, and complexity theory. He has a joint appointment with the Computer Science Department.
Area of specialty "theoretical computer science, algorithms, security and cryptography".
Research: Strauss' research lies in the area of theoretical and applied computer science, at the interface between mathematics and computer science. His work has applications in fundamental algorithms, usually for approximating infeasible functions or datasets, security and cryptography, and complexity theory.
