معرفی
Professor Anuj Dawar is a leading academic in Theoretical Computer Science at the University of Cambridge's Department of Computer Science and Technology. He holds a PhD from the University of Pennsylvania (1993) and has been a faculty member since 1999. His research focuses on computational complexity via logic, descriptive complexity, and finite model theory, with applications to databases, verification, and games.
Education:
- PhD in Computer Science, University of Pennsylvania (1993)
- Masters, University of Delaware
- Bachelor's, Indian Institute of Technology (Delhi)
Research Interests:
His work bridges logic and computation, investigating limits of symmetric algorithms and complexity through formal languages. Notable themes include:
- Descriptive complexity and homomorphism preservation
- Finite model theory and its applications
- Algorithmic model theory and constraint satisfaction
Professional Activities:
- Editor-in-Chief, ACM Transactions on Computational Logic
- Former president of European Association for Computer Science Logic
- Committee roles for Gödel Prize, Church Award, and Nerode Award
Advising & Teaching:
Supervised over 15 PhD students and taught advanced courses like Quantum Computing, Complexity Theory, and Foundations of Functional Programming. Currently on sabbatical (2024–25).
