Current graduate students
Past graduate students
For prospective students: Possible Thesis Topics
- Approximation algorithms for the counting constraint satisfaction problem
- Approximation algorithms for the weighted constraint satisfaction problem
- The efficiency of local search type algorithms for SAT and CSP
- Analysis of message passing algorithms
- Efficient quantum adiabatic algorithms for MAX-SAT