Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Albert Atserias" ( http://dblp.L3S.de/Authors/Albert_Atserias )

  Author page on DBLP  Author page in RDF  Community of Albert Atserias in ASPL-2

Publication years (Num. hits)
1999-2002 (15) 2003-2006 (15) 2007-2011 (19) 2012 (2)
Publication types (Num. hits)
article(25) inproceedings(26)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(9) ICALP(6) LICS(5) CSL(4) IEEE Conference on Computation...(3) Inf. Comput.(3) Theor. Comput. Sci.(3) J. ACM(2) J. Comput. Syst. Sci.(2) MFCS(2) Computer Science Review(1) CP(1) Eur. J. Comb.(1) FOCS(1) ICDT(1) ITCS(1) More (+10 of total 22)
Authors
Albert Atserias(51) Anuj Dawar(7) Maria Luisa Bonet(6) Nicola Galesi(6) Elitza N. Maneva(5) Phokion G. Kolaitis(4) Víctor Dalmau(4) Andrei A. Bulatov(3) Martin Grohe(3) Pavel Pudlák(3) Ricard Gavaldà(3) Johannes Klaus Fichte(2) Juan Luis Esteban(2) Marc Thurley(2) Balder ten Cate(1) Dániel Marx(1) More (+10 of total 23)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 13 keywords
Results
Found 51 publication records. Showing 51 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Albert Atserias, Anuj Dawar Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Albert Atserias, Elitza N. Maneva Sherali-Adams relaxations and indistinguishability in counting logics. Search on Bibsonomy ITCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Elitza N. Maneva Graph Isomorphism, Sherali-Adams Relaxations and Expressibility in Counting Logics. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Albert Atserias, Elitza N. Maneva Mean-payoff games and propositional proofs. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Johannes Klaus Fichte, Marc Thurley Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. Search on Bibsonomy J. Artif. Intell. Res. (JAIR) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth Ross Foreword. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Albert Atserias A Why-on-Earth Tutorial on Finite Model Theory. Search on Bibsonomy LICS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Elitza N. Maneva Mean-payoff games and propositional proofs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Albert Atserias, Elitza N. Maneva Mean-Payoff Games and Propositional Proofs. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Andrei A. Bulatov, Anuj Dawar Affine systems of equations and counting infinitary logic. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Johannes Klaus Fichte, Marc Thurley Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Albert Atserias Four Subareas of the Theory of Constraints, and Their Links. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Mark Weyer Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. Search on Bibsonomy CSL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Albert 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). Search on Bibsonomy Computer Science Review The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Albert Atserias On digraph coloring problems and treewidth duality. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Víctor Dalmau A combinatorial characterization of resolution width. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Anuj Dawar, Martin Grohe Preservation under Extensions on Well-Behaved Finite Structures. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Martin Grohe, Dániel Marx Size Bounds and Query Plans for Relational Joins. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Albert Atserias Conjunctive query evaluation by search-tree revisited. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Andrei A. Bulatov, Anuj Dawar Affine Systems of Equations and Counting Infinitary Logic. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Andrei A. Bulatov, Víctor Dalmau On the Power of k -Consistency. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Anuj Dawar, Phokion G. Kolaitis On preservation under homomorphisms and unions of conjunctive queries. Search on Bibsonomy J. ACM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Datalog, first-order logic, Conjunctive queries, preservation, homomorphisms, finite model theory, graph minors, infinitary logic
1Albert Atserias Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Albert Atserias Non-Uniform Hardness for NP via Black-Box Adversaries Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Albert Atserias, Anuj Dawar, Martin Grohe Preservation Under Extensions on Well-Behaved Finite Structures. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Albert Atserias Conjunctive Query Evaluation by Search Tree Revisited. Search on Bibsonomy ICDT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Albert Atserias Definability on a Random 3-CNF Formula. Search on Bibsonomy LICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Albert Atserias On Digraph Coloring Problems and Treewidth Duality. Search on Bibsonomy LICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Maria Luisa Bonet On the automatizability of resolution and related propositional proof systems. Search on Bibsonomy Inf. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Albert Atserias On sufficient conditions for unsatisfiability of random formulas. Search on Bibsonomy J. ACM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Random CNF formulas, propositional resolution, satisfiability, datalog, phase transitions, pebble games
1Albert Atserias Notions of Average-Case Complexity for Random 3-SAT. Search on Bibsonomy CSL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Anuj Dawar, Phokion G. Kolaitis On Preservation under Homomorphisms and Unions of Conjunctive Queries. (PDF / PS) Search on Bibsonomy PODS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi Constraint Propagation as a Proof System. Search on Bibsonomy CP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Maria Luisa Bonet, Jordi Levy On Chvatal Rank and Cutting Planes Proofs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Albert Atserias Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Víctor Dalmau A Combinatorial Characterization of ResolutionWidth. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Maria Luisa Bonet On the Automatizability of Resolution and Related Propositional Proof Systems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Albert Atserias, Víctor Dalmau A Combinatorial Characterization of Resolution Width Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Nicola Galesi, Pavel Pudlák Monotone simulations of non-monotone proofs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Albert Atserias Unsatisfiable Random Formulas Are Hard to Certify. Search on Bibsonomy LICS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Maria Luisa Bonet On the Automatizability of Resolution and Related Propositional Proof Systems. Search on Bibsonomy CSL The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Nicola Galesi, Ricard Gavaldà Monotone Proofs of the Pigeon Hole Principle. Search on Bibsonomy Math. Log. Q. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Albert Atserias Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Weak Pigeonhole Principle, Proof Complexity, Bounded Arithmetic
1Albert Atserias, Nicola Galesi, Pavel Pudlák Monotone Simulations of Nonmonotone Proofs. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Nicola Galesi, Pavel Pudlák Monotone simulations of nonmonotone propositional proofs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2000 DBLP  BibTeX  RDF
1Albert Atserias, Nicola Galesi, Ricard Gavaldà Monotone Proofs of the Pigeon Hole Principle Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2000 DBLP  BibTeX  RDF
1Albert Atserias, Nicola Galesi, Ricard Gavaldà Monotone Proofs of the Pigeon Hole Principle. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Albert Atserias The Descriptive Comlexity of the Fixed-Points of Bounded Formulas. Search on Bibsonomy CSL The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Circuit uniformity, BIT predicate, logarithmic-time hierarchy, rudimentary languages, integer division
1Albert Atserias, Phokion G. Kolaitis First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. Search on Bibsonomy LICS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #51 of 51 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.