| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
CoRR
|
| 2024 | J | jnl |
Comput. Complex.
|
| 2024 | J | jnl |
CoRR
|
| 2024 | A | conf |
ICDT
|
| 2024 | J | jnl |
CoRR
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
ACM Trans. Comput. Theory
|
| 2021 | J | jnl |
CoRR
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
Algorithmica
|
| 2020 | A* | conf |
IJCAI
|
| 2020 | J | jnl |
CoRR
|
| 2020 | B | conf |
ISAAC
|
| 2020 | J | jnl |
CoRR
|
| 2019 | A* | conf |
PODS
|
| 2019 | J | jnl |
SIAM J. Comput.
|
| 2019 | J | jnl |
Theory Comput. Syst.
|
| 2019 | J | jnl |
J. Mach. Learn. Res.
|
| 2019 | A* | conf |
PODS
|
| 2019 | B | conf |
WG
|
| 2019 | A* | conf |
PODS
|
| 2018 | B | conf |
IPEC
|
| 2018 | J | jnl |
CoRR
|
| 2018 | — | conf |
NAACL-HLT (2)
|
| 2017 | J | jnl |
ACM Trans. Comput. Theory
|
| 2017 | J | jnl |
CoRR
|
| 2017 | A | conf |
ICDT
|
| 2017 | J | jnl |
ACM Trans. Comput. Log.
|
| 2017 | J | jnl |
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness.
ACM Trans. Comput. Theory
|
| 2017 | J | jnl |
Theory Comput. Syst.
|
| 2017 | J | jnl |
J. ACM
|
| 2017 | A* | conf |
LICS
|
| 2016 | J | jnl |
CoRR
|
| 2016 | A* | conf |
PODS
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
SIAM J. Comput.
|
| 2016 | A* | conf |
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness.
ICALP
|
| 2016 | B | conf |
CSL
|
| 2016 | A* | conf |
FOCS
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
CoRR
|
| 2015 | A | conf |
ICDT
|
| 2015 | A* | conf |
COLT
|
| 2015 | B | conf |
IPEC
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
Log. Methods Comput. Sci.
|
| 2015 | J | jnl |
ACM Trans. Comput. Theory
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
J. Comput. Syst. Sci.
|
| 2014 | J | jnl |
CoRR
|
| 2014 | J | jnl |
CoRR
|
| 2014 | J | jnl |
Log. Methods Comput. Sci.
|
| 2014 | J | jnl |
ACM Trans. Comput. Log.
|
| 2014 | — | conf |
CSL-LICS
|
| 2014 | J | jnl |
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness.
CoRR
|
| 2014 | A | conf |
ICDT
|
| 2014 | J | jnl |
CoRR
|
| 2014 | — | conf |
CSL-LICS
|
| 2014 | J | jnl |
Int. J. Algebra Comput.
|
| 2013 | J | jnl |
J. Log. Comput.
|
| 2013 | — | conf |
ICALP (2)
|
| 2013 | J | jnl |
Int. J. Game Theory
|
| 2013 | J | jnl |
Inf. Comput.
|
| 2013 | J | jnl |
CoRR
|
| 2013 | J | jnl |
CoRR
|
| 2013 | A* | conf |
PODS
|
| 2012 | J | jnl |
Log. Methods Comput. Sci.
|
| 2012 | A* | conf |
LICS
|
| 2012 | A* | conf |
LICS
|
| 2012 | J | jnl |
CoRR
|
| 2012 | C | conf |
TIME
|
| 2012 | J | jnl |
CoRR
|
| 2012 | — | conf |
Logic and Program Semantics
|
| 2012 | J | jnl |
CoRR
|
| 2012 | J | jnl |
SIAM J. Discret. Math.
|
| 2012 | J | jnl |
Theory Comput. Syst.
|
| 2011 | J | jnl |
CoRR
|
| 2011 | — | conf |
ICALP (2)
|
| 2010 | J | jnl |
CoRR
|
| 2010 | J | jnl |
J. Comput. Syst. Sci.
|
| 2010 | J | jnl |
J. Comput. Syst. Sci.
|
| 2010 | J | jnl |
Theor. Comput. Sci.
|
| 2010 | J | jnl |
SIAM J. Comput.
|
| 2010 | J | jnl |
J. Symb. Log.
|
| 2009 | J | jnl |
ACM Comput. Surv.
|
| 2009 | J | jnl |
Inf. Comput.
|
| 2009 | J | jnl |
Theor. Comput. Sci.
|
| 2009 | — | conf |
The Constraint Satisfaction Problem: Complexity and Approximability
|
| 2009 | C | conf |
WoLLIC
|
| 2009 | J | jnl |
J. Log. Comput.
|
| 2009 | J | jnl |
Constraints An Int. J.
|
| 2009 | J | jnl |
Inf. Comput.
|
| 2008 | A* | conf |
ICAPS
|
| 2008 | J | jnl |
Comput. Complex.
|
| 2008 | J | jnl |
CoRR
|
| 2008 | — | conf |
ICALP (2)
|
| 2008 | A* | conf |
LICS
|
| 2008 | J | jnl |
SIAM J. Comput.
|
| 2007 | A* | conf |
ICAPS
|
| 2007 | J | jnl |
Theor. Comput. Sci.
|
| 2007 | A* | conf |
ICALP
|
| 2007 | B | conf |
CSL
|
| 2007 | A* | conf |
LICS
|
| 2006 | J | jnl |
SIGACT News
|
| 2006 | B | conf |
CSL
|
| 2006 | — | conf |
Complexity of Constraints
|
| 2006 | J | jnl |
CoRR
|
| 2006 | J | jnl |
CoRR
|
| 2005 | A* | conf |
IJCAI
|
| 2005 | J | jnl |
CoRR
|
| 2005 | A | conf |
CP
|
| 2005 | J | jnl |
CoRR
|
| 2005 | B | conf |
CSL
|
| 2005 | A* | conf |
IJCAI
|
| 2005 | J | jnl |
Constraints An Int. J.
|
| 2005 | J | jnl |
Electron. Colloquium Comput. Complex.
|
| 2005 | A | conf |
STACS
|
| 2005 | J | jnl |
Ann. Math. Artif. Intell.
|
| 2004 | A | conf |
CP
|
| 2004 | J | jnl |
CoRR
|
| 2004 | J | jnl |
Theor. Comput. Sci.
|
| 2004 | A* | conf |
AAAI
|
| 2004 | B | conf |
ALT
|
| 2004 | A | conf |
SAT
|
| 2004 | — | conf |
SAT (Selected Papers
|
| 2004 | B | conf |
MFCS
|
| 2004 | — | conf |
CSFW
|
| 2004 | A | conf |
CP
|
| 2004 | A | conf |
ECAI
|
| 2004 | — | conf |
AI&M
|
| 2003 | — | conf |
CMCS
|
| 2003 | A* | conf |
IJCAI
|
| 2003 | A | conf |
SAT
|
| 2003 | B | conf |
MFCS
|
| 2003 | A* | conf |
IJCAI
|
| 2003 | B | conf |
MFCS
|
| 2003 | A | conf |
CP
|
| 2001 | J | jnl |
Electron. Colloquium Comput. Complex.
|
| 2001 | A | conf |
CP
|
| 2001 | J | jnl |
Electron. Colloquium Comput. Complex.
|