| Publication | Date of Publication | Type |
|---|
Modular SAT-based techniques for reasoning tasks in team semantics
Journal of Computer and System Sciences | 2024-10-08 | Paper |
Enumeration classes defined by circuits
| 2024-08-06 | Paper |
Tractability Frontier of Data Complexity in Team Semantics
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
Tractability frontier of data complexity in team semantics
| 2021-12-03 | Paper |
Descriptive complexity of \#P functions: a new perspective
Journal of Computer and System Sciences | 2021-01-22 | Paper |
Model-theoretic characterization of Boolean and arithmetic circuit classes of small depth
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Expressivity and Complexity of Dependence Logic
Dependence Logic | 2020-02-04 | Paper |
Approximation and dependence via multiteam semantics
Annals of Mathematics and Artificial Intelligence | 2018-09-21 | Paper |
Probabilistic team semantics
| 2018-06-26 | Paper |
Descriptive complexity of \#AC\(^0\) functions
| 2017-07-19 | Paper |
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Homomorphism polynomials complete for VP
| 2017-04-25 | Paper |
The arithmetic complexity of tensor contractions
| 2017-01-30 | Paper |
Dependence logic with a majority quantifier
Journal of Logic, Language and Information | 2016-07-04 | Paper |
The arithmetic complexity of tensor contraction
Theory of Computing Systems | 2016-06-03 | Paper |
Homomorphism polynomials complete for VP
Chicago Journal of Theoretical Computer Science | 2016-05-24 | Paper |
Approximation and dependence via multiteam semantics
Lecture Notes in Computer Science | 2016-05-19 | Paper |
Structural tractability of counting of solutions to conjunctive queries
Theory of Computing Systems | 2016-04-18 | Paper |
Hierarchies in Dependence Logic
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Hypergraph acyclicity and propositional model counting
Lecture Notes in Computer Science | 2014-09-26 | Paper |
The complexity of weighted counting for acyclic conjunctive queries
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Fifty years of the spectrum problem: survey and new results
The Bulletin of Symbolic Logic | 2013-01-17 | Paper |
Trichotomies in the complexity of minimal inference
Theory of Computing Systems | 2012-12-06 | Paper |
Enumeration complexity of logical query problems with second-order variables
| 2012-09-18 | Paper |
Dependence logic with a majority quantifier
| 2012-08-31 | Paper |
Complexity issues for the sandwich homogeneous set problem
Discrete Applied Mathematics | 2011-04-19 | Paper |
Efficient enumeration for conjunctive queries over X-underbar structures
Computer Science Logic | 2010-09-03 | Paper |
On the counting complexity of propositional circumscription
Information Processing Letters | 2010-04-19 | Paper |
First-Order Queries over One Unary Function
Computer Science Logic | 2009-03-12 | Paper |
On Acyclic Conjunctive Queries and Constant Delay Enumeration
Computer Science Logic | 2009-03-05 | Paper |
Computing thejth solution of a first-order query
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
The expressive power of bijections over weakly arithmetized structures
Theory of Computing Systems | 2006-10-25 | Paper |
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science | 2005-09-22 | Paper |
scientific article; zbMATH DE number 2079026 (Why is no real title available?)
| 2004-07-21 | Paper |
scientific article; zbMATH DE number 1962835 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1418330 (Why is no real title available?)
| 2003-05-19 | Paper |
Nonerasing, counting, and majority over the linear time hierarchy
Information and Computation | 2003-01-14 | Paper |
Linear time and the power of one first-order universal quantifier
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1759419 (Why is no real title available?)
| 2002-11-04 | Paper |
On the complexity of recognizing the Hilbert basis of a linear Diophantine system
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1223621 (Why is no real title available?)
| 1998-11-15 | Paper |
Subclasses of binary NP
Journal Of Logic And Computation | 1998-07-28 | Paper |
First-order spectra with one binary predicate
Theoretical Computer Science | 1997-02-27 | Paper |
