معرفی
Victor Dalmau is an Associate Professor at the Department of Information and Communication Technologies, Universitat Pompeu Fabra (UPF). He holds a Ph.D. and a degree in Computer Science from Universitat Politècnica de Catalunya. His career includes post-doctoral roles at institutions such as the University of Zaragoza and University of California, Santa Cruz, before joining UPF in 2000. He has held visiting positions at prestigious universities including Oxford, Cambridge, and Simon Fraser University.
His research focuses on theoretical computer science, particularly constraint satisfaction problems (CSPs), exploring their complexity, combinatorial structures, and applications in areas like artificial intelligence and database theory. His work integrates concepts from universal algebra, logic, and computational learning theory. Notably, he investigates algorithmic techniques like Sherali-Adams hierarchies and Weisfeiler-Leman invariance for solving CSPs efficiently.
Recent publications emphasize advancements in constraint satisfaction frameworks, homomorphism dualities, and the interplay between logic and database query optimization. His research bridges foundational theory with practical challenges in distributed computing and algorithm design.
Victor Dalmau’s contributions span over 50 peer-reviewed articles, with a focus on computational complexity classifications, constraint programming, and the theoretical underpinnings of database systems. His work often addresses the boundaries between tractability and intractability in combinatorial problems.
