Jörg Flum

From MaRDI portal
Person:490658

Available identifiers

zbMath Open flum.jorgWikidataQ102172403 ScholiaQ102172403MaRDI QIDQ490658

List of research outcomes





PublicationDate of PublicationType
On algorithms based on finitely many homomorphism counts2024-08-06Paper
Forbidden induced subgraphs and the Łoś-Tarski theorem2024-05-29Paper
https://portal.mardi4nfdi.de/entity/Q61610592023-06-26Paper
FO-Definability of Shrub-Depth2023-02-07Paper
Parameterized Parallel Computing and First-Order Logic2022-11-09Paper
Mathematical Logic2021-06-08Paper
Tree-depth, quantifier elimination, and quantifier rank2021-01-20Paper
Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.2020-05-26Paper
Some lower bounds in parameterized \(\mathrm{AC}^{0}\)2019-05-29Paper
Einführung in die mathematische Logik2018-10-01Paper
Some Lower Bounds in Parameterized AC^0.2018-03-21Paper
On the Ordered Conjecture2017-05-16Paper
Query evaluation via tree-decompositions2015-12-07Paper
The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture2015-09-22Paper
Hard Instances of Algorithms and Proof Systems2015-09-03Paper
Consistency, optimality, and incompleteness2015-08-27Paper
On optimal inverters2014-10-21Paper
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem2014-02-17Paper
The Exponential Time Hypothesis and the Parameterized Clique Problem2013-01-07Paper
Some Definitorial Suggestions for Parameterized Proof Complexity2013-01-07Paper
A Parameterized Halting Problem2012-09-05Paper
Hard Instances of Algorithms and Proof Systems2012-08-14Paper
Strong isomorphism reductions in complexity theory2011-12-23Paper
Consistency and Optimality2011-09-09Paper
Lower bounds for kernelizations and other preprocessing procedures2011-05-25Paper
On p-Optimal Proof Systems and Logics for PTIME2010-09-07Paper
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT2010-09-03Paper
A Logic for PTIME and a Parameterized Halting Problem2010-09-03Paper
Lower Bounds for Kernelizations and Other Preprocessing Procedures2010-07-28Paper
W-hierarchies defined by symmetric gates2010-05-10Paper
On the complexity of Gödel's proof predicate2010-03-15Paper
https://portal.mardi4nfdi.de/entity/Q33960092009-09-15Paper
https://portal.mardi4nfdi.de/entity/Q36258292009-05-22Paper
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping2009-03-05Paper
Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping2009-03-02Paper
The Parameterized Complexity of Maximality and Minimality Problems2008-06-03Paper
The parameterized complexity of maximality and minimality problems2008-02-13Paper
Parameterized Complexity and Logic2007-11-13Paper
https://portal.mardi4nfdi.de/entity/Q54223342007-10-18Paper
Model-Checking Problems as a Basis for Parameterized Intractability2007-10-11Paper
Bounded fixed-parameter tractability and reducibility2007-09-28Paper
An analysis of the W*-hierarchy2007-07-09Paper
Computer Science Logic2007-06-21Paper
Parametrized complexity theory.2006-05-24Paper
On miniaturized problems in parameterized complexity theory2006-04-06Paper
Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits2006-01-10Paper
Finite Model Theory2005-11-17Paper
Automata, Languages and Programming2005-08-24Paper
Parameterized and Exact Computation2005-08-23Paper
Machine-based methods in parameterized complexity theory2005-06-30Paper
https://portal.mardi4nfdi.de/entity/Q46657302005-04-11Paper
The Parameterized Complexity of Counting Problems2005-02-21Paper
Describing parameterized complexity classes2004-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47368542004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44732592004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q47894622003-01-29Paper
https://portal.mardi4nfdi.de/entity/Q44343552003-01-01Paper
Tree-decompositions and the model-checking problem2001-07-18Paper
Fixed-parameter tractability, definability, and model-checking2001-06-21Paper
On fixed-point logic with counting2001-01-14Paper
Games, kernels, and antitone operations2000-10-30Paper
Quantifiers and congruence closure2000-10-25Paper
Games and total Datalog\(^{\lnot}\) queries2000-08-21Paper
Pseudo-finite homogeneity and saturation2000-04-11Paper
https://portal.mardi4nfdi.de/entity/Q42492222000-01-18Paper
https://portal.mardi4nfdi.de/entity/Q42478081999-11-23Paper
An Extension of the Lemma of Rasiowa and Sikorski1999-08-31Paper
https://portal.mardi4nfdi.de/entity/Q42555751999-08-17Paper
https://portal.mardi4nfdi.de/entity/Q43955611998-06-11Paper
https://portal.mardi4nfdi.de/entity/Q48941271996-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48500611995-10-09Paper
https://portal.mardi4nfdi.de/entity/Q42985711994-07-31Paper
https://portal.mardi4nfdi.de/entity/Q42029361993-09-06Paper
https://portal.mardi4nfdi.de/entity/Q40239261993-01-23Paper
https://portal.mardi4nfdi.de/entity/Q47311741989-01-01Paper
On topological spaces equivalent to ordinals1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37879891988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38054521988-01-01Paper
χ‐Local Operations for Topological Structures1985-01-01Paper
Maximale monadische Logiken1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32205451984-01-01Paper
Modelltheorie - topologische Modelltheorie1984-01-01Paper
Topological model theory1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41824651978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41285591976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41285621976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41354861976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41096411975-01-01Paper
L(Q)-preservation theorems1975-01-01Paper
On Horn theories1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40712251974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47736971974-01-01Paper
Hanf numbers and well-ordering numbers1972-01-01Paper
Die Automorphismenmengen der Modelle einerL Q x -Theorie1972-01-01Paper
Bemerkungen über minimale Modelle1972-01-01Paper
Ganzgeschlossene und prädikatengeschlossene Logiken I1971-01-01Paper
Eine Formulierung des Herbrandschen Satzes ohne Skolemfunktionen1971-01-01Paper
A remark on infinitary languages1971-01-01Paper
Ganzgeschlossene und Prädikatengeschlossene Logiken. II1971-01-01Paper

Research outcomes over time

This page was built for person: Jörg Flum