The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Albert Atserias: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Albert Atserias, Nicola Galesi, Pavel Pudlák
    Monotone Simulations of Nonmonotone Proofs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:36-41 [Conf]
  3. Albert Atserias
    Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:88-95 [Conf]
  4. Albert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi
    Constraint Propagation as a Proof System. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:77-91 [Conf]
  5. Albert Atserias
    The Descriptive Comlexity of the Fixed-Points of Bounded Formulas. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:172-186 [Conf]
  6. Albert Atserias
    Notions of Average-Case Complexity for Random 3-SAT. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:1-5 [Conf]
  7. Albert Atserias, Maria Luisa Bonet
    On the Automatizability of Resolution and Related Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:569-583 [Conf]
  8. Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
    Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:1005-1016 [Conf]
  9. Albert Atserias, Anuj Dawar, Martin Grohe
    Preservation Under Extensions on Well-Behaved Finite Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1437-1449 [Conf]
  10. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:151-162 [Conf]
  11. Albert Atserias
    Conjunctive Query Evaluation by Search Tree Revisited. [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:53-67 [Conf]
  12. Albert Atserias
    Unsatisfiable Random Formulas Are Hard to Certify. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:325-334 [Conf]
  13. Albert Atserias
    On Digraph Coloring Problems and Treewidth Duality. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:106-115 [Conf]
  14. Albert Atserias
    Definability on a Random 3-CNF Formula. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:458-466 [Conf]
  15. Albert Atserias, Phokion G. Kolaitis
    First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:275-284 [Conf]
  16. Albert Atserias
    Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:148-158 [Conf]
  17. Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
    On Preservation under Homomorphisms and Unions of Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:319-329 [Conf]
  18. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:8, pp:- [Journal]
  19. Albert Atserias, Nicola Galesi, Pavel Pudlák
    Monotone simulations of nonmonotone propositional proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:87, pp:- [Journal]
  20. Albert Atserias, Maria Luisa Bonet
    On the Automatizability of Resolution and Related Propositional Proof Systems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:010, pp:- [Journal]
  21. 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]
  22. Albert Atserias, Maria Luisa Bonet, Jordi Levy
    On Chvatal Rank and Cutting Planes Proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:041, pp:- [Journal]
  23. Albert Atserias
    Non-Uniform Hardness for NP via Black-Box Adversaries [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:154, pp:- [Journal]
  24. Albert Atserias, Maria Luisa Bonet
    On the automatizability of resolution and related propositional proof systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:2, pp:182-201 [Journal]
  25. Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
    Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:2, pp:136-152 [Journal]
  26. Albert Atserias
    On sufficient conditions for unsatisfiability of random formulas. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:281-311 [Journal]
  27. Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
    On preservation under homomorphisms and unions of conjunctive queries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:2, pp:208-237 [Journal]
  28. Albert Atserias, Nicola Galesi, Pavel Pudlák
    Monotone simulations of non-monotone proofs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:4, pp:626-638 [Journal]
  29. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:461-474 [Journal]
  30. Albert Atserias
    Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:27-39 [Journal]
  31. Albert Atserias
    Conjunctive query evaluation by search-tree revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:371, n:3, pp:155-168 [Journal]
  32. 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]
  33. Albert Atserias, Andrei A. Bulatov, Anuj Dawar
    Affine Systems of Equations and Counting Infinitary Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:558-570 [Conf]

  34. Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  35. Size Bounds and Query Plans for Relational Joins. [Citation Graph (, )][DBLP]


  36. Mean-Payoff Games and Propositional Proofs. [Citation Graph (, )][DBLP]


  37. Four Subareas of the Theory of Constraints, and Their Links. [Citation Graph (, )][DBLP]


  38. Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. [Citation Graph (, )][DBLP]


  39. On digraph coloring problems and treewidth duality. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.284secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002