Albert Atserias

Albert Atserias, Elitza N. Maneva: Sherali-Adams Relaxations and Indistinguishability in Counting Logics. SIAM J. Comput. 42(1): 112-137 (2013)

Albert Atserias, Sergi Oliva: Bounded-width QBF is PSPACE-complete. STACS 2013: 44-54

Albert Atserias, Anuj Dawar: Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. ICALP (2) 2012: 67-78

Albert Atserias, Elitza N. Maneva: Sherali-Adams relaxations and indistinguishability in counting logics. ITCS 2012: 367-379

Albert Atserias, Anuj Dawar: Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. Electronic Colloquium on Computational Complexity (ECCC) 19: 15 (2012)

Albert Atserias, Sergi Oliva: Bounded-width QBF is PSPACE-complete. Electronic Colloquium on Computational Complexity (ECCC) 19: 96 (2012)

Albert Atserias, Elitza N. Maneva: Mean-payoff games and propositional proofs. Inf. Comput. 209(4): 664-691 (2011)

Albert Atserias, Johannes Klaus Fichte, Marc Thurley: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. J. Artif. Intell. Res. (JAIR) 40: 353-373 (2011)

Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth Ross: Foreword. Theory Comput. Syst. 49(2): 365-366 (2011)

Albert Atserias: A Why-on-Earth Tutorial on Finite Model Theory. LICS 2011: 3

Albert Atserias, Elitza N. Maneva: Graph Isomorphism, Sherali-Adams Relaxations and Expressibility in Counting Logics. Electronic Colloquium on Computational Complexity (ECCC) 18: 77 (2011)

Albert Atserias, Elitza N. Maneva: Mean-Payoff Games and Propositional Proofs. ICALP (1) 2010: 102-113

Albert Atserias, Elitza N. Maneva: Mean-payoff games and propositional proofs. Electronic Colloquium on Computational Complexity (ECCC) 17: 197 (2010)

Albert Atserias, Andrei A. Bulatov, Anuj Dawar: Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. 410(18): 1666-1683 (2009)

Albert Atserias, Mark Weyer: Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. CSL 2009: 102-116

Albert Atserias: Four Subareas of the Theory of Constraints, and Their Links. MFCS 2009: 1

Albert Atserias, Johannes Klaus Fichte, Marc Thurley: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. SAT 2009: 114-127

Albert Atserias: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema and S. Weinstein , Finite Model Theory and Its Applications, Springer-Verlag (2007). Computer Science Review 2(1): 55-59 (2008)

Albert Atserias: On digraph coloring problems and treewidth duality. Eur. J. Comb. 29(4): 796-820 (2008)

Albert Atserias, Víctor Dalmau: A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74(3): 323-334 (2008)

Albert Atserias, Anuj Dawar, Martin Grohe: Preservation under Extensions on Well-Behaved Finite Structures. SIAM J. Comput. 38(4): 1364-1381 (2008)

Albert Atserias, Martin Grohe, Dániel Marx: Size Bounds and Query Plans for Relational Joins. FOCS 2008: 739-748

Albert Atserias: Conjunctive query evaluation by search-tree revisited. Theor. Comput. Sci. 371(3): 155-168 (2007)

Albert Atserias, Andrei A. Bulatov, Víctor Dalmau: On the Power of k -Consistency. ICALP 2007: 279-290

Albert Atserias, Andrei A. Bulatov, Anuj Dawar: Affine Systems of Equations and Counting Infinitary Logic. ICALP 2007: 558-570

Albert Atserias, Anuj Dawar, Phokion G. Kolaitis: On preservation under homomorphisms and unions of conjunctive queries. J. ACM 53(2): 208-237 (2006)

Albert Atserias: Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries. IEEE Conference on Computational Complexity 2006: 88-95

Albert Atserias, Anuj Dawar, Martin Grohe: Preservation Under Extensions on Well-Behaved Finite Structures. ICALP 2005: 1437-1449

Albert Atserias: Conjunctive Query Evaluation by Search Tree Revisited. ICDT 2005: 53-67

Albert Atserias: On Digraph Coloring Problems and Treewidth Duality. LICS 2005: 106-115

Albert Atserias: Definability on a Random 3-CNF Formula. LICS 2005: 458-466

Albert Atserias: Non-Uniform Hardness for NP via Black-Box Adversaries. Electronic Colloquium on Computational Complexity (ECCC)(154) (2005)

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, 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: Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms. Theor. Comput. Sci. 295: 27-39 (2003)

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, 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: 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, Nicola Galesi, Ricard Gavaldà: Monotone Proofs of the Pigeon Hole Principle. Math. Log. Q. 47(4): 461-474 (2001)

Albert Atserias, Nicola Galesi, Pavel Pudlák: Monotone Simulations of Nonmonotone Proofs. IEEE Conference on Computational Complexity 2001: 36-41

Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban: Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. ICALP 2001: 1005-1016

Albert Atserias: Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms. MFCS 2001: 148-158

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