J. Flum

发表

On the (infinite) model theory of fixed-point logics

J. Flum, 1995 .

Finite Automata and Logic: A Microcosm of Finite Model Theory

J. Flum, H. Ebbinghaus, 1995 .

Logic and automata : history and perspectives

Thomas Wilke, E. Grädel, J. Flum, 2007 .

Parameterized Complexity Theory

Jörg Flum, Martin Grohe, Martin Grohe, 2006, Texts in Theoretical Computer Science. An EATCS Series.

Combinatorial Circuits and the W-hierarchy

Frances A. Rosamond, M. Fellows, J. Flum, 2007 .

Lower Bounds for Kernelizations Yijia

J. Flum, M. Müller, 2007 .

Parameterized Complexity and Subexponential Time

Martin Grohe, J. Flum, 2004 .

Mathematics of Logic Programming

J. Flum, H. Ebbinghaus, 2001 .

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Jörg Flum, Martin Grohe, Martin Grohe, 2006 .

Descriptive Complexity Theory

Jörg Flum, Heinz-Dieter Ebbinghaus, J. Flum, 1995 .

A Logic for PTIME and a Parameterized Halting Problem

Yijia Chen, Jörg Flum, J. Flum, 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

On Topological Spaces Equivalent to Ordinals

Jörg Flum, Juan Carlos Martínez, J. Flum, 1988, J. Symb. Log..

Model Theory of Regular and Compact Spaces

J. Flum, 1989 .

Topological Model Theory

M. Ziegler, J. Flum, 1980 .

Free Models and Logic Programming

Jörg Flum, H.-D. Ebbinghaus, Wolfgang Thomas, 2021, Mathematical Logic.

Tree-Decompositions and the Model-Checking Problem

Jörg Flum, J. Flum, 2001, Bull. EATCS.

χ-Local Operations for Topological Structures

Jörg Flum, Juan Carlos Martínez, J. Flum, 1985, Math. Log. Q..

L(Q)-preservation theorems

Jörg Flum, J. Flum, 1975, Journal of Symbolic Logic.

On Horn theories

J. Flum, 1974 .

On Bounded Theories

Jörg Flum, J. Flum, 1991, CSL.

Review: R. G. Downey, M. R. Fellows, Parameterized Complexity

Jörg Flum, J. Flum, 2002 .

A remark on infinitary languages

Jörg Flum, J. Flum, 1971, Journal of Symbolic Logic.

Logic and Computational Complexity (NII Shonan Meeting 2017-13)

Yijia Chen, Jörg Flum, Rodney G. Downey, 2017, NII Shonan Meet. Rep..

Model-checking problems as a basis for parameterized intractability

Jörg Flum, Martin Grohe, Martin Grohe, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

Topological Model Theory

Jörg Flum, Martin Ziegler, Martin Ziegler, 1980 .

Parametrized Complexity and Subexponential Time (Column: Computational Complexity)

Jörg Flum, Martin Grohe, Martin Grohe, 2004, Bull. EATCS.

Computability and Its Limitations

Jörg Flum, Heinz-Dieter Ebbinghaus, Wolfgang Thomas, 2021, Mathematical Logic.

Mathematical logic (2. ed.)

Jörg Flum, Wolfgang Thomas, Heinz-Dieter Ebbinghaus, 1994, Undergraduate texts in mathematics.

On Algorithms Based on Finitely Many Homomorphism Counts

J. Flum, Yijia Chen, Mingjun Liu, 2022, MFCS.

On the existence of prime ideals in Boolean algebras

J. Flum, 1999 .

Hanf numbers and well-ordering numbers

J. Flum, 1972 .

From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem

Yijia Chen, Jörg Flum, J. Flum, 2012, JACM.

ON OPTIMAL INVERTERS

Yijia Chen, Jörg Flum, J. Flum, 2014, The Bulletin of Symbolic Logic.

Mathematical logic

Jörg Flum, Wolfgang Thomas, Heinz-Dieter Ebbinghaus, 1985, Undergraduate texts in mathematics.

On Algorithms Based on Finitely Many Homomorphism Counts

J. Flum, Yijia Chen, Mingjun Liu, 2021, MFCS.

Tree-depth, quantifier elimination, and quantifier rank

Jörg Flum, Yijia Chen, J. Flum, 2018, LICS.

FO-Definability of Shrub-Depth

Yijia Chen, Jörg Flum, J. Flum, 2020, CSL.

The parameterized complexity of counting problems

Jörg Flum, Martin Grohe, Martin Grohe, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

The Exponential Time Hypothesis and the Parameterized Clique Problem

Yijia Chen, Jörg Flum, Kord Eickmeyer, 2012, IPEC.

Hard Instances of Algorithms and Proof Systems

Yijia Chen, Jörg Flum, Moritz Müller, 2012, TOCT.

On Parameterized Path and Chordless Path Problems

Yijia Chen, Jörg Flum, J. Flum, 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

Finite model theory

Jörg Flum, Heinz-Dieter Ebbinghaus, J. Flum, 1995, Perspectives in Mathematical Logic.

Bounded nondeterminism and alternation in parameterized complexity theory

Yijia Chen, Jörg Flum, Martin Grohe, 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

Describing parameterized complexity classes

Jörg Flum, Martin Grohe, Martin Grohe, 2002, Inf. Comput..

Query evaluation via tree-decompositions

Jörg Flum, Martin Grohe, Markus Frick, 2001, JACM.

Fixed-Parameter Tractability, Definability, and Model-Checking

Jörg Flum, Martin Grohe, Martin Grohe, 1999, SIAM J. Comput..

On fixed-point logic with counting

Jörg Flum, Martin Grohe, Martin Grohe, 2000, Journal of Symbolic Logic.

On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity

Yijia Chen, Jörg Flum, J. Flum, 2013, Electron. Colloquium Comput. Complex..

Quantifiers and Logical Reductions

Jörg Flum, Heinz-Dieter Ebbinghaus, J. Flum, 1995 .

Proceedings of the Eleventh ESSLLI Student Session

R. Bernardi, S. Katrenko, M. Aloni, 2006 .

Total and Partial Well-Founded Datalog Coincide

Jörg Flum, Bertram Ludäscher, Max Kubierschky, 1997, ICDT.

Bounded fixed-parameter tractability and log2n nondeterministic bits

Jörg Flum, Martin Grohe, Mark Weyer, 2004, J. Comput. Syst. Sci..

An Extension of the Lemma of Rasiowa and Sikorski

Jörg Flum, J. Flum, 1998, Math. Log. Q..

Model Theory of Topological Structures

J. Flum, 1995 .

On p-Optimal Proof Systems and Logics for PTIME

Yijia Chen, Jörg Flum, J. Flum, 2010, ICALP.

Pseudo-finite homogeneity and saturation

Jörg Flum, Martin Ziegler, M. Ziegler, 1999, Journal of Symbolic Logic.

On Queries Determined by a Constant Number of Homomorphism Counts

Yijia Chen, Jorg Flum, Mingjun Liu, 2021, ArXiv.

Strong isomorphism reductions in complexity theory

Yijia Chen, Jörg Flum, Samuel R. Buss, 2011, The Journal of Symbolic Logic.