BibSLEIGH — Albert

Travelled to:

1 × Canada
1 × Denmark
1 × Finland
1 × Germany
1 × Greece
1 × Italy
1 × Japan
1 × Switzerland
1 × USA
2 × France
2 × Poland
2 × Portugal
3 × United Kingdom

Collaborated with:

∅ A.Dawar P.G.Kolaitis M.L.Bonet A.A.Bulatov J.L.Balcázar E.N.Maneva M.Weyer S.Torunczyk J.K.Fichte M.Thurley V.Dalmau M.Grohe J.L.Esteban N.Galesi R.Gavaldà

Talks about:

bound (6) proof (5) resolut (4) formula (4) finit (4) problem (3) random (3) logic (3) structur (2) proposit (2)

Person: Albert Atserias

DBLP: Atserias:Albert

Contributed to:

2015

2013

2012

2011

2010

2009

2007

2005

2004

2002

2001

2000

1999

2016

2018

Wrote 22 papers:

LICS-2015-AtseriasB #probability: Entailment among Probabilistic Implications (AA, JLB), pp. 621–632.
SAT-2013-Atserias #algebra #bound #problem #proving: The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs (AA), pp. 1–17.
ICALP-v2-2012-AtseriasD #approximate #bound #quantifier: Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (AA, AD), pp. 67–78.
LICS-2011-Atserias #finite #tutorial: A Why-on-Earth Tutorial on Finite Model Theory (AA), p. 3.
ICALP-v1-2010-AtseriasM #game studies #proving: Mean-Payoff Games and Propositional Proofs (AA, ENM), pp. 102–113.
CSL-2009-AtseriasW #consistency #constraints #decidability #problem: Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (AA, MW), pp. 102–116.
SAT-2009-AtseriasFT #algorithm #bound: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (AA, JKF, MT), pp. 114–127.
ICALP-2007-AtseriasBD #on the #power of: On the Power of k -Consistency (AA, AAB, VD), pp. 279–290.
ICALP-2007-AtseriasBD07a #equation #logic: Affine Systems of Equations and Counting Infinitary Logic (AA, AAB, AD), pp. 558–570.
ICALP-2005-AtseriasDG #finite: Preservation Under Extensions on Well-Behaved Finite Structures (AA, AD, MG), pp. 1437–1449.
LICS-2005-Atserias #on the #problem: On Digraph Coloring Problems and Treewidth Duality (AA), pp. 106–115.
LICS-2005-Atserias05a #random: Definability on a Random 3-CNF Formula (AA), pp. 458–466.
CSL-2004-Atserias #complexity #random #satisfiability: Notions of Average-Case Complexity for Random 3-SAT (AA), pp. 1–5.
PODS-2004-AtseriasDK #morphism #on the #query: On Preservation under Homomorphisms and Unions of Conjunctive Queries (AA, AD, PGK), pp. 319–329.
CSL-2002-AtseriasB #on the #proving: On the Automatizability of Resolution and Related Propositional Proof Systems (AA, MLB), pp. 569–583.
LICS-2002-Atserias #random #satisfiability: Unsatisfiable Random Formulas Are Hard to Certify (AA), pp. 325–334.
ICALP-2001-AtseriasBE #bound: Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution (AA, MLB, JLE), pp. 1005–1016.
CSL-2000-Atserias #bound #complexity #fixpoint: The Descriptive Complexity of the Fixed-Points of Bounded Formulas (AA), pp. 172–186.
ICALP-2000-AtseriasGG #principle #proving: Monotone Proofs of the Pigeon Hole Principle (AA, NG, RG), pp. 151–162.
LICS-1999-AtseriasK #finite #first-order #fixpoint #logic #set: First-Order Logic vs. Fixed-Point Logic in Finite Set Theory (AA, PGK), pp. 275–284.
CSL-2016-AtseriasT #finite: Non-Homogenizable Classes of Finite Structures (AA, ST), p. 16.
CSL-2018-AtseriasD #challenge: Definable Inapproximability: New Challenges for Duplicator (AA, AD), p. 21.