Albert Atserias Papers on DiSC'04 On Preservation under Homomorphisms and Unions of Conjunctive Queries Publications Note: Links lead to the DBLP on the Web. Albert Atserias Albert Atserias: Conjunctive Query Evaluation by Search Tree Revisited. ICDT 2005 : 53-67 Albert Atserias, Phokion G. Kolaitis , Moshe Y. Vardi : Constraint Propagation as a Proof System. CP 2004 : 77-91 Albert Atserias: Notions of Average-Case Complexity for Random 3-SAT. CSL 2004 : 1-5 Albert Atserias, Anuj Dawar , Phokion G. Kolaitis : On Preservation under Homomorphisms and Unions of Conjunctive Queries. PODS 2004 : 319-329 Albert Atserias, Maria Luisa Bonet : On the automatizability of resolution and related propositional proof systems. Inf. Comput. 189 (2): 182-201 (2004) Albert Atserias: On sufficient conditions for unsatisfiability of random formulas. J. ACM 51 (2): 281-311 (2004) Albert Atserias, Víctor Dalmau : A Combinatorial Characterization of ResolutionWidth. IEEE Conference on Computational Complexity 2003 : 239-247 Albert Atserias, Maria Luisa Bonet , Jordi Levy : On Chvatal Rank and Cutting Planes Proofs Electronic Colloquium on Computational Complexity (ECCC) (041): (2003) Albert Atserias: Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms. Theor. Comput. Sci. 1-3 : 27-39 (2003) Albert Atserias, Maria Luisa Bonet : On the Automatizability of Resolution and Related Propositional Proof Systems. CSL 2002 : 569-583 Albert Atserias: Unsatisfiable Random Formulas Are Hard to Certify. LICS 2002 : 325-334 Albert Atserias, Maria Luisa Bonet : On the Automatizability of Resolution and Related Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC) (010): (2002) Albert Atserias, Víctor Dalmau : A Combinatorial Characterization of Resolution Width Electronic Colloquium on Computational Complexity (ECCC) (035): (2002) Albert Atserias, Maria Luisa Bonet , Juan Luis Esteban : Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. Inf. Comput. 176 (2): 136-152 (2002) Albert Atserias, Nicola Galesi , Pavel Pudlák : Monotone simulations of non-monotone proofs. J. Comput. Syst. Sci. 65 (4): 626-638 (2002) Albert Atserias, Maria Luisa Bonet , Juan Luis Esteban : Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. ICALP 2001 : 1005-1016 Albert Atserias, Nicola Galesi , Pavel Pudlák : Monotone Simulations of Nonmonotone Proofs. IEEE Conference on Computational Complexity 2001 : 36-41 Albert Atserias: Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms. MFCS 2001 : 148-158 Albert Atserias, Nicola Galesi , Ricard Gavaldà : Monotone Proofs of the Pigeon Hole Principle. Math. Log. Q. 47 (4): 461-474 (2001) Albert Atserias: The Descriptive Comlexity of the Fixed-Points of Bounded Formulas. CSL 2000 : 172-186 Albert Atserias, Nicola Galesi , Ricard Gavaldà : Monotone Proofs of the Pigeon Hole Principle. ICALP 2000 : 151-162 Albert Atserias, Nicola Galesi , Ricard Gavaldà : Monotone Proofs of the Pigeon Hole Principle Electronic Colloquium on Computational Complexity (ECCC) 7 (8): (2000) Albert Atserias, Nicola Galesi , Pavel Pudlák : Monotone simulations of nonmonotone propositional proofs Electronic Colloquium on Computational Complexity (ECCC) 7 (87): (2000) Albert Atserias, Phokion G. Kolaitis : First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. LICS 1999 : 275-284 1 [ 9 ] [ 11 ] [ 13 ] [ 15 ] [ 17 ] [ 20 ] 2 [ 12 ] [ 18 ] 3 [ 21 ] 4 [ 9 ] [ 11 ] 5 [ 2 ] [ 3 ] [ 4 ] [ 6 ] [ 8 ] [ 10 ] 6 [ 3 ] [ 4 ] [ 6 ] 7 [ 1 ] [ 21 ] [ 23 ] 8 [ 17 ] 9 [ 2 ] [ 8 ] [ 10 ] 10 [ 23 ] ©2005 Association for Computing Machinery