Office: Petty 105
Email address: email@example.com
Starting year at UNCG: 2008
Ph.D. in Mathematics, Rutgers University (2001)
- MAT 120-01 LEC (Calculus for Business and the Social Sciences), TR 12:30-1:45, Petty Building 313
- MAT 253-01 LEC (Discrete Mathematical Structures), TR 9:30-10:45, Petty Building 223
- MAT 799-02 DIS (Dissertation)
- MAT 799-05 DTS (Dissertation)
Selected Recent Publications
- Clifford Smyth, The BKR inequalities on finite distributive lattices. Combinatorics, Probability and Computing (CPC), Volume 22, Issue 04, pages 612–626, July 2013.
- Clifford Smyth, Approximate Query Complexity. Association for Computing Machinery - Transactions on Computation Theory (ACM - TOCT), Volume 3, Number 1, pages 3.1–3.11, 2011.
- Jeffry Kahn, Michael Saks, and Clifford Smyth, The dual BKR inequality and Rudich’s conjecture. Combinatorics Probability, and Computing (CPC), Volume 20, Number 2, pages 257–266, 2011.
- Todd Kemp, Karl Mahlburg, Amarpreet Rattan, and Clifford Smyth, Enumeration of non-crossing pairings on bit strings. Journal of Combinatorial Theory, Series A, Volume 118, Number 1, pages 129–151, 2011.
- Jozsef Balogh, Oded Regev, Clifford Smyth, William Steiger, and Mario Szegedy. Long monotone paths in line arrangements. Discrete and Computational Geometry, Volume 32, Number 32, pages 167–176, 2004.
Dr. Smyth earned a Ph.D. in 2001 from Rutgers University, advised by Michael Saks. He joined the UNCG faculty in 2008. In the interim, he was a Member of the School of Mathematics at the Institute for Advanced Study from 2001 to 2002, advised by Avi Widgerson, a Zeev Nehari Visiting Assistant Professor at Carnegie Mellon University from 2002 to 2005, advised by Alan Frieze, and an Instructor in Applied Mathematics at MIT from 2005 to 2008 advised By Daniel Kleitman. His research lies in combinatorial probability, computational complexity, and discrete geometry.