The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Víctor Dalmau: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
    Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:620-626 [Conf]
  2. Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
    Learnability of Relatively Quantified Generalized Formulas. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:365-379 [Conf]
  3. Víctor Dalmau
    Boolean Formulas are Hard to Learn for most Gate Bases. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:301-312 [Conf]
  4. Víctor Dalmau
    A New Tractable Class of Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    AMAI, 2000, pp:- [Conf]
  5. Albert Atserias, Víctor Dalmau
    A Combinatorial Characterization of ResolutionWidth. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:239-247 [Conf]
  6. Víctor Dalmau
    A Dichotomy Theorem for Learning Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:193-200 [Conf]
  7. Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi
    Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:310-326 [Conf]
  8. Víctor Dalmau, Justin Pearson
    Closure Functions and Width 1 Problems. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:159-173 [Conf]
  9. Hubie Chen, Víctor Dalmau
    (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:182-196 [Conf]
  10. Hubie Chen, Víctor Dalmau
    Beyond Hypertree Width: Decomposition Methods Without Decompositions. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:167-181 [Conf]
  11. Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
    Tractable Clones of Polynomials over Semigroups. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:196-210 [Conf]
  12. Hubie Chen, Víctor Dalmau
    From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CSL, 2005, pp:232-247 [Conf]
  13. Víctor Dalmau, Peter Jeavons
    Learnability of Quantified Formulas. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1999, pp:63-78 [Conf]
  14. Andrei A. Bulatov, Víctor Dalmau
    Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:562-0 [Conf]
  15. Víctor Dalmau
    Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:414-425 [Conf]
  16. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
    Phase Transitions of PP-Complete Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:183-192 [Conf]
  17. Víctor Dalmau
    Generalized Majority-Minority Operations are Tractable. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:438-447 [Conf]
  18. Víctor Dalmau, Andrei A. Krokhin, Benoit Larose
    First-Order Definable Retraction Problems for Posets and Reflexive Graph. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:232-241 [Conf]
  19. Víctor Dalmau, Daniel K. Ford
    Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:358-367 [Conf]
  20. Hubie Chen, Víctor Dalmau
    Looking Algebraically at Tractable Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  21. Hubie Chen, Víctor Dalmau
    Looking Algebraically at Tractable Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:71-79 [Conf]
  22. Manuel Bodirsky, Víctor Dalmau
    Datalog and Constraint Satisfaction with Infinite Templates. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:646-659 [Conf]
  23. Víctor Dalmau
    A new tractable class of constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:44, n:1-2, pp:61-85 [Journal]
  24. Albert Atserias, Víctor Dalmau
    A Combinatorial Characterization of Resolution Width [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:035, pp:- [Journal]
  25. Víctor Dalmau
    Malt'sev Constraints made Simple [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:097, pp:- [Journal]
  26. Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
    Tractable Clones of Polynomials over Semigroups [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:059, pp:- [Journal]
  27. Víctor Dalmau
    Linear datalog and bounded path duality of relational structures. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2005, v:1, n:1, pp:- [Journal]
  28. Víctor Dalmau
    Generalized Majority-Minority Operations are Tractable. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:4, pp:- [Journal]
  29. Víctor Dalmau
    A Dichotomy Theorem for Learning Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1999, v:35, n:3, pp:207-224 [Journal]
  30. Andrei A. Bulatov, Víctor Dalmau
    A Simple Algorithm for Mal'tsev Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:16-27 [Journal]
  31. Víctor Dalmau, Peter Jeavons
    Learnability of quantified formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:485-511 [Journal]
  32. Víctor Dalmau, Peter Jonsson
    The complexity of counting homomorphisms seen from the other side. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:329, n:1-3, pp:315-323 [Journal]
  33. Albert Atserias, Andrei A. Bulatov, Víctor Dalmau
    On the Power of k -Consistency. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:279-290 [Conf]
  34. Víctor Dalmau
    Generalized Majority-Minority Operations are Tractable [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  35. Víctor Dalmau
    Linear Datalog and Bounded Path Duality of Relational Structures [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  36. Catarina Carvalho, Víctor Dalmau, Petar Markovic, Miklós Maróti
    CD(4) has bounded width [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  37. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
    Phase transitions of PP-complete satisfiability problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:12, pp:1627-1639 [Journal]
  38. Andrei A. Bulatov, Víctor Dalmau
    Towards a dichotomy theorem for the counting constraint satisfaction problem. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:5, pp:651-678 [Journal]
  39. Víctor Dalmau, Andrei A. Krokhin, Benoit Larose
    First-order Definable Retraction Problems for Posets and Reflexive Graphs. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2007, v:17, n:1, pp:31-51 [Journal]
  40. Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
    Learning intersection-closed classes with signatures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:3, pp:209-220 [Journal]

  41. Maltsev + Datalog --> Symmetric Datalog. [Citation Graph (, )][DBLP]


  42. Caterpillar Duality for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  43. Distance Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  44. Enumerating Homomorphisms. [Citation Graph (, )][DBLP]


  45. Beyond Hypertree Width: Decomposition Methods Without Decompositions [Citation Graph (, )][DBLP]


  46. Datalog and Constraint Satisfaction with Infinite Templates [Citation Graph (, )][DBLP]


  47. Enumerating Homomorphisms [Citation Graph (, )][DBLP]


  48. Distance Constraint Satisfaction Problems [Citation Graph (, )][DBLP]


  49. Retractions onto series-parallel posets. [Citation Graph (, )][DBLP]


  50. Majority constraints have bounded pathwidth duality. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.305secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002