| Publication | Date of Publication | Type |
|---|
On algorithms based on finitely many homomorphism counts
| 2024-08-06 | Paper |
Forbidden induced subgraphs and the Łoś-Tarski theorem
Journal of Symbolic Logic | 2024-05-29 | Paper |
A surprising relationship between descriptive complexity and proof complexity
| 2023-06-26 | Paper |
FO-Definability of Shrub-Depth
| 2023-02-07 | Paper |
Parameterized Parallel Computing and First-Order Logic
Fields of Logic and Computation III | 2022-11-09 | Paper |
Mathematical Logic
Graduate Texts in Mathematics | 2021-06-08 | Paper |
Tree-depth, quantifier elimination, and quantifier rank
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
| 2020-05-26 | Paper |
Some lower bounds in parameterized \(\mathrm{AC}^{0}\)
Information and Computation | 2019-05-29 | Paper |
Einführung in die mathematische Logik
| 2018-10-01 | Paper |
Some lower bounds in parameterized \(\mathrm{AC}^0\)
| 2018-03-21 | Paper |
On the ordered conjecture
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Query evaluation via tree-decompositions
Journal of the ACM | 2015-12-07 | Paper |
The Ehrenfeucht-Fraïssé method and the planted clique conjecture
Fields of Logic and Computation II | 2015-09-22 | Paper |
Hard Instances of Algorithms and Proof Systems
ACM Transactions on Computation Theory | 2015-09-03 | Paper |
Consistency, optimality, and incompleteness
Annals of Pure and Applied Logic | 2015-08-27 | Paper |
On optimal inverters
The Bulletin of Symbolic Logic | 2014-10-21 | Paper |
From almost optimal algorithms to logics for complexity classes via listings and a halting problem
Journal of the ACM | 2014-02-17 | Paper |
The exponential time hypothesis and the parameterized clique problem
Parameterized and Exact Computation | 2013-01-07 | Paper |
Some definitorial suggestions for parameterized proof complexity
Parameterized and Exact Computation | 2013-01-07 | Paper |
A Parameterized Halting Problem
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Hard instances of algorithms and proof systems
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Strong isomorphism reductions in complexity theory
Journal of Symbolic Logic | 2011-12-23 | Paper |
Consistency and optimality
Models of Computation in Context | 2011-09-09 | Paper |
Lower bounds for kernelizations and other preprocessing procedures
Theory of Computing Systems | 2011-05-25 | Paper |
On \(p\)-optimal proof systems and logics for PTIME
Automata, Languages and Programming | 2010-09-07 | Paper |
On slicewise monotone parameterized problems and optimal proof systems for TAUT
Computer Science Logic | 2010-09-03 | Paper |
A logic for PTIME and a parameterized halting problem
Fields of Logic and Computation | 2010-09-03 | Paper |
Lower bounds for kernelizations and other preprocessing procedures
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
W-hierarchies defined by symmetric gates
Theory of Computing Systems | 2010-05-10 | Paper |
On the complexity of Gödel's proof predicate
Journal of Symbolic Logic | 2010-03-15 | Paper |
scientific article; zbMATH DE number 5604125 (Why is no real title available?)
| 2009-09-15 | Paper |
scientific article; zbMATH DE number 5555973 (Why is no real title available?)
| 2009-05-22 | Paper |
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
Computer Science Logic | 2009-03-05 | Paper |
Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping
Journal Of Logic And Computation | 2009-03-02 | Paper |
The Parameterized Complexity of Maximality and Minimality Problems
Parameterized and Exact Computation | 2008-06-03 | Paper |
The parameterized complexity of maximality and minimality problems
Annals of Pure and Applied Logic | 2008-02-13 | Paper |
Parameterized Complexity and Logic
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Introduction to mathematical logic
| 2007-10-18 | Paper |
Model-Checking Problems as a Basis for Parameterized Intractability
Logical Methods in Computer Science | 2007-10-11 | Paper |
Bounded fixed-parameter tractability and reducibility
Annals of Pure and Applied Logic | 2007-09-28 | Paper |
An analysis of the W*-hierarchy
Journal of Symbolic Logic | 2007-07-09 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Parametrized complexity theory.
Texts in Theoretical Computer Science. An EATCS Series | 2006-05-24 | Paper |
On miniaturized problems in parameterized complexity theory
Theoretical Computer Science | 2006-04-06 | Paper |
Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
Journal of Computer and System Sciences | 2006-01-10 | Paper |
Finite Model Theory
Springer Monographs in Mathematics | 2005-11-17 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Machine-based methods in parameterized complexity theory
Theoretical Computer Science | 2005-06-30 | Paper |
scientific article; zbMATH DE number 2155183 (Why is no real title available?)
| 2005-04-11 | Paper |
The Parameterized Complexity of Counting Problems
SIAM Journal on Computing | 2005-02-21 | Paper |
Describing parameterized complexity classes
Information and Computation | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2086399 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2080462 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 1852932 (Why is no real title available?)
| 2003-01-29 | Paper |
scientific article; zbMATH DE number 2001368 (Why is no real title available?)
| 2003-01-01 | Paper |
Tree-decompositions and the model-checking problem
Bulletin of the European Association for Theoretical Computer Science EATCS | 2001-07-18 | Paper |
Fixed-parameter tractability, definability, and model-checking
SIAM Journal on Computing | 2001-06-21 | Paper |
On fixed-point logic with counting
Journal of Symbolic Logic | 2001-01-14 | Paper |
Games, kernels, and antitone operations
Order | 2000-10-30 | Paper |
Quantifiers and congruence closure
Studia Logica | 2000-10-25 | Paper |
Games and total Datalog\(^{\lnot}\) queries
Theoretical Computer Science | 2000-08-21 | Paper |
Pseudo-finite homogeneity and saturation
Journal of Symbolic Logic | 2000-04-11 | Paper |
scientific article; zbMATH DE number 1302670 (Why is no real title available?)
| 2000-01-18 | Paper |
scientific article; zbMATH DE number 1302492 (Why is no real title available?)
| 1999-11-23 | Paper |
An Extension of the Lemma of Rasiowa and Sikorski
Mathematical Logic Quarterly | 1999-08-31 | Paper |
scientific article; zbMATH DE number 1324669 (Why is no real title available?)
| 1999-08-17 | Paper |
scientific article; zbMATH DE number 1163937 (Why is no real title available?)
| 1998-06-11 | Paper |
scientific article; zbMATH DE number 930362 (Why is no real title available?)
| 1996-10-01 | Paper |
scientific article; zbMATH DE number 803291 (Why is no real title available?)
| 1995-10-09 | Paper |
scientific article; zbMATH DE number 612169 (Why is no real title available?)
| 1994-07-31 | Paper |
scientific article; zbMATH DE number 408792 (Why is no real title available?)
| 1993-09-06 | Paper |
scientific article; zbMATH DE number 108465 (Why is no real title available?)
| 1993-01-23 | Paper |
scientific article; zbMATH DE number 4116510 (Why is no real title available?)
| 1989-01-01 | Paper |
On topological spaces equivalent to ordinals
Journal of Symbolic Logic | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4051587 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4073948 (Why is no real title available?)
| 1988-01-01 | Paper |
χ‐Local Operations for Topological Structures
Mathematical Logic Quarterly | 1985-01-01 | Paper |
Maximale monadische Logiken
Archiv für Mathematische Logik und Grundlagenforschung | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3885853 (Why is no real title available?)
| 1984-01-01 | Paper |
Modelltheorie - topologische Modelltheorie
Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) | 1984-01-01 | Paper |
Topological model theory
Lecture Notes in Mathematics | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3619844 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3556053 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3556056 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3563055 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3532912 (Why is no real title available?)
| 1975-01-01 | Paper |
L(Q)-preservation theorems
Journal of Symbolic Logic | 1975-01-01 | Paper |
On Horn theories
Mathematische Zeitschrift | 1974-01-01 | Paper |
scientific article; zbMATH DE number 3487432 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3450187 (Why is no real title available?)
| 1974-01-01 | Paper |
Hanf numbers and well-ordering numbers
Archiv für Mathematische Logik und Grundlagenforschung | 1972-01-01 | Paper |
Die Automorphismenmengen der Modelle einerL Q x -Theorie
Archiv für Mathematische Logik und Grundlagenforschung | 1972-01-01 | Paper |
Bemerkungen über minimale Modelle
Archiv für Mathematische Logik und Grundlagenforschung | 1972-01-01 | Paper |
Ganzgeschlossene und prädikatengeschlossene Logiken I
Archiv für Mathematische Logik und Grundlagenforschung | 1971-01-01 | Paper |
Eine Formulierung des Herbrandschen Satzes ohne Skolemfunktionen
Archiv für Mathematische Logik und Grundlagenforschung | 1971-01-01 | Paper |
A remark on infinitary languages
Journal of Symbolic Logic | 1971-01-01 | Paper |
Ganzgeschlossene und Prädikatengeschlossene Logiken. II
Archiv für Mathematische Logik und Grundlagenforschung | 1971-01-01 | Paper |
