Hubie Chen
Affiliations:- King's College London, Department of Informatics, UK
- Birkbeck University of London, UK
- University of the Basque Country (UPV/EHU), San Sebastián, Spain (former)
- Pompeu Fabra University, Department of Technology, Barcelona, Spain (former)
- Cornell University, Department of Computer Science, Ithaca, NY, USA (PhD 2004)
According to our database1,
Hubie Chen
authored at least 93 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on kcl.ac.uk
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Comput. Complex., June, 2024
Intermediate Relation Size Bounds for Select-Project-Join Query Plans: Asymptotically Tight Characterizations.
CoRR, 2024
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity.
Proceedings of the 27th International Conference on Database Theory, 2024
2023
ACM Trans. Comput. Theory, 2023
CoRR, 2023
2020
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
2019
SIAM J. Comput., 2019
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019
2018
Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2018
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018
2017
Theory Comput. Syst., 2017
Homomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one.
CoRR, 2017
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
Proceedings of the 20th International Conference on Database Theory, 2017
2016
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016
2015
ACM Trans. Comput. Theory, 2015
The complexity of equivalence, entailment, and minimization in existential positive logic.
J. Comput. Syst. Sci., 2015
CoRR, 2015
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015
Proceedings of the 18th International Conference on Database Theory, 2015
Proceedings of The 28th Conference on Learning Theory, 2015
2014
Int. J. Algebra Comput., 2014
Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction.
Log. Methods Comput. Sci., 2014
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014
One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014
2013
Int. J. Game Theory, 2013
The fine classification of conjunctive queries and parameterized logarithmic space complexity.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
2012
Proceedings of the 19th International Symposium on Temporal Representation and Reasoning, 2012
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012
Proceedings of the Logic and Program Semantics, 2012
2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
2010
J. Symb. Log., 2010
2009
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 25.10., 2009
2008
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case.
SIAM J. Comput., 2008
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008
2007
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
Proceedings of the Computer Science Logic, 21st International Workshop, 2007
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007
2006
Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006
Proceedings of the Computer Science Logic, 20th International Workshop, 2006
2005
Constraints An Int. J., 2005
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms.
Proceedings of the STACS 2005, 2005
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005
Proceedings of the Principles and Practice of Constraint Programming, 2005
2004
The Computational Complexity of Quantified Constraint Satisfaction.
PhD thesis, 2004
Proceedings of the SAT 2004, 2004
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004
Quantified Constraint Satisfaction and Bounded Treewidth.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004
Proceedings of the Principles and Practice of Constraint Programming, 2004
Proceedings of the Principles and Practice of Constraint Programming, 2004
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004
2003
Proceedings of the Theory and Applications of Satisfiability Testing, 2003
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Proceedings of the IJCAI-03, 2003
Proceedings of the Principles and Practice of Constraint Programming, 2003
2001
Electron. Colloquium Comput. Complex., 2001
Electron. Colloquium Comput. Complex., 2001
Proceedings of the Principles and Practice of Constraint Programming, 2001