Anuj Dawar

Anuj Dawar
Name	Anuj Dawar
Fields	Computer science, Cryptography, Combinatorics, Algorithmics
Workplaces	University of Cambridge, University of Bristol, NICTA, University of Chicago
Alma mater	Indian Institute of Technology Kanpur, University of California, Berkeley
Doctoral advisor	Sanjeev Arora
Known for	Descriptive complexity, graph isomorphism, algorithmic lower bounds

Anuj Dawar Anuj Dawar is a computer scientist known for work in Theoretical computer science, Descriptive complexity, Graph theory, and Cryptography. He has held academic positions at institutions including University of Cambridge, University of Bristol, and research organisations such as NICTA and collaborative networks with University of Chicago scholars. His research connects methods from Finite model theory, Combinatorics, Algorithm design and logical frameworks to tackle problems like graph isomorphism, constraint satisfaction, and complexity separations.

Early life and education

Dawar completed undergraduate studies at Indian Institute of Technology Kanpur and pursued graduate education at University of California, Berkeley under supervision connected to researchers in Computational complexity theory and Approximation algorithms. During his doctoral and postdoctoral periods he collaborated with scholars from institutions such as Princeton University, Massachusetts Institute of Technology, and Institute of Mathematics and its Applications networks. Early influences included developments from Stephen Cook, Ronald Fagin, Neil Immerman, and Sanjeev Arora, situating his training at the intersection of Descriptive complexity and algorithmic Graph isomorphism research.

Research and academic career

Dawar's academic career has involved positions at University of Bristol, research appointments at NICTA, and a professorship at University of Cambridge where he contributed to the Computer Laboratory and engaged with research groups linked to Alan Turing Institute collaborations. He has been part of doctoral supervision and chaired committees involving scholars from Oxford University, Imperial College London, and King's College London. His collaborations span networks including European Research Council funded projects, ties with researchers at Carnegie Mellon University and exchanges with the Simons Institute for the Theory of Computing. Dawar has organized workshops and conferences attached to series like ICALP, STOC, FOCS, and LICS promoting interactions between logicians, complexity theorists, and combinatorialists.

Major results and contributions

Dawar has produced major contributions to the theory of Graph isomorphism by applying techniques from Finite model theory, Higher-order logics, and pebble game characterizations related to Ehrenfeucht–Fraïssé games. His work developed connections between logic-based definability and algorithmic performance for isomorphism testing, engaging with results from László Babai and classical algorithms of Ullman and Weisfeiler–Leman methods. He co-developed techniques that relate expressive power of counting logics to combinatorial partitioning algorithms used in practical systems such as those inspired by Nauty and Traces. In descriptive complexity, Dawar advanced the study of logics capturing polynomial-time properties, building on frameworks by Neil Immerman and Ronald Fagin, and interacting with open problems related to the P versus NP problem through structural and finite-model approaches.

In constraint satisfaction problems, Dawar investigated algebraic and logical characterizations of tractability drawing on the body of work by Andrei Bulatov, Péter Jeavons, and Victor Dalmau, establishing reductions and hardness proofs that bridge universal algebra and model theory. His research on logical definability produced lower bounds and separations, leveraging tools from Circuit complexity and connections to dichotomy theorems such as those proved by Feder and Vardi and later by Dmitriy Zhuk and Andrei Bulatov.

Dawar has also contributed to foundational questions in Cryptography by examining indistinguishability and reduction frameworks where logical characterizations inform constructions and impossibility results, intersecting with work by Oded Goldreich and Moni Naor. Across his oeuvre, Dawar has emphasized rigorous formalization of algorithmic phenomena in terms of logical expressivity, producing results that influenced subsequent research in Parameterized complexity, Approximation algorithms, and combinatorial optimization.

Awards and honors

Dawar's work has been recognized with fellowships and awards tied to institutions such as the Royal Society networks, appointments within the Alan Turing Institute, and invited contributions at major conferences like STOC, FOCS, and LICS. He has delivered plenary and keynote lectures at events organized by European Association for Theoretical Computer Science and served on program committees for ICALP and CSL. He is a member of editorial boards for journals tied to ACM and SIAM communities, reflecting recognition by peers in Theoretical computer science and Logic in Computer Science.

Selected publications and works

- "Definability and Graph Isomorphism" — paper connecting counting logics to isomorphism testing, cited alongside works by László Babai and Martin Grohe in proceedings of STOC/FOCS venues. - "Descriptive Complexity and Constraint Satisfaction" — article exploring links between finite model theory and CSP dichotomy results, interacting with research by Andrei Bulatov and Dmitriy Zhuk. - "Logical Methods in Algorithmic Lower Bounds" — contributions in collections honoring themes of Complexity theory and Circuit complexity, connected to scholars like Sanjeev Arora and Luca Trevisan. - Edited volumes and survey chapters in handbooks on Finite model theory and Algorithmic graph theory, appearing alongside editors such as Erich Grädel and Neil Immerman.

Category:Computer scientists Category:Theoretical computer scientists Category:Alumni of the University of California, Berkeley Category:Alumni of the Indian Institutes of Technology