Search the dblp DataBase
Albert Atserias :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] 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 ] 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 ] Albert Atserias The Descriptive Comlexity of the Fixed-Points of Bounded Formulas. [Citation Graph (0, 0)][DBLP ] CSL, 2000, pp:172-186 [Conf ] Albert Atserias Notions of Average-Case Complexity for Random 3-SAT. [Citation Graph (0, 0)][DBLP ] CSL, 2004, pp:1-5 [Conf ] 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 ] 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 ] 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 ] Albert Atserias , Nicola Galesi , Ricard Gavaldà Monotone Proofs of the Pigeon Hole Principle. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:151-162 [Conf ] Albert Atserias Conjunctive Query Evaluation by Search Tree Revisited. [Citation Graph (0, 0)][DBLP ] ICDT, 2005, pp:53-67 [Conf ] Albert Atserias Unsatisfiable Random Formulas Are Hard to Certify. [Citation Graph (0, 0)][DBLP ] LICS, 2002, pp:325-334 [Conf ] Albert Atserias On Digraph Coloring Problems and Treewidth Duality. [Citation Graph (0, 0)][DBLP ] LICS, 2005, pp:106-115 [Conf ] Albert Atserias Definability on a Random 3-CNF Formula. [Citation Graph (0, 0)][DBLP ] LICS, 2005, pp:458-466 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP ] Size Bounds and Query Plans for Relational Joins. [Citation Graph (, )][DBLP ] Mean-Payoff Games and Propositional Proofs. [Citation Graph (, )][DBLP ] Four Subareas of the Theory of Constraints, and Their Links. [Citation Graph (, )][DBLP ] Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. [Citation Graph (, )][DBLP ] On digraph coloring problems and treewidth duality. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.284secs