Victor Dalmau
Biosketch
I was born in Sudanell, Spain. I am assistant professor in the Department of Information & Communication Technologies at the Universitat Pompeu Fabra. I have obtained a PhD in Computer Science at the Universitat Politécnica de Catalunya. I was a postdoctoral researcher at the University of California, Santa Cruz for the 2000-2001 academic year, and joined the Universitat Pompeu Fabra in 2002.
I have held visiting positions at Royal Holloway, University of London (Egham, UK), University of Oxford (Oxford, UK), Simon Fraser University (Vancouver, Canada), University of Durham (Durham, UK), Newton Institute (Cambridge, UK), Charles University (Praga, Czech Republic), Humbold Universitat zu Berlin (Berlin, Germany), Ecole Polytechnique (Paris, France), Fields Institute for Research in Mathematical Sciences (Toronto, Canada), and Simons Institute (Berkeley, USA).
Research lines
I work on the theoretical aspects of constraint satisfaction, which is the problem of deciding whether there exists an assignment of values to variables satisfying some given restrictions.
Also interested broadly in:
- complexity theory
- logic in computer science
- and computational learning theory
Selected publications
- Andrei A. Bulatov, Víctor Dalmau: A Simple Algorithm for Mal’tsev Constraints. SIAM J. Comput. 36(1): 16-27 (2006).
- Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis: Learning schema mappings. ACM Trans. Database Syst. 38(4): 28 (2013).
- Albert Atserias, Víctor Dalmau: A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74(3): 323-334 (2008).
- Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi: Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. CP 2002: 310-326.
- Andrei A. Bulatov, Víctor Dalmau: Towards a dichotomy theorem for the counting constraint satisfaction problem. Inf. Comput. 205(5): 651-678 (2007).