Jörg Flum

Yijia Chen, Jörg Flum: On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity. Electronic Colloquium on Computational Complexity (ECCC) 20: 65 (2013)

Yijia Chen, Jörg Flum: From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem. J. ACM 59(4): 17 (2012)

Yijia Chen, Jörg Flum: A Parameterized Halting Problem. The Multivariate Algorithmic Revolution and Beyond 2012: 364-397

Yijia Chen, Jörg Flum, Moritz Müller: Hard Instances of Algorithms and Proof Systems. CiE 2012: 118-128

Yijia Chen, Kord Eickmeyer, Jörg Flum: The Exponential Time Hypothesis and the Parameterized Clique Problem. IPEC 2012: 13-24

Jörg Flum, Moritz Müller: Some Definitorial Suggestions for Parameterized Proof Complexity. IPEC 2012: 73-84

Yijia Chen, Jörg Flum: On the Ordered Conjecture. LICS 2012: 225-234

Jörg Flum, Moritz Müller: Some definitorial suggestions for parameterized proof complexity. Electronic Colloquium on Computational Complexity (ECCC) 19: 18 (2012)

Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman, Moritz Müller: Strong isomorphism reductions in complexity theory. J. Symb. Log. 76(4): 1381-1402 (2011)

Yijia Chen, Jörg Flum, Moritz Müller: Lower Bounds for Kernelizations and Other Preprocessing Procedures. Theory Comput. Syst. 48(4): 803-839 (2011)

Yijia Chen, Jörg Flum, Moritz Müller: Consistency and Optimality. CiE 2011: 61-70

Yijia Chen, Jörg Flum: Listings and Logics. LICS 2011: 165-174

Jörg Flum: Invariantization of Listings. MFCS 2011: 2

Yijia Chen, Jörg Flum: Listings and logics. Electronic Colloquium on Computational Complexity (ECCC) 18: 20 (2011)

Yijia Chen, Jörg Flum, Moritz Müller: Hard instances of algorithms and proof systems. Electronic Colloquium on Computational Complexity (ECCC) 18: 85 (2011)

Yijia Chen, Jörg Flum: On the complexity of Gödel's proof predicate. J. Symb. Log. 75(1): 239-254 (2010)

Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond: W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. 46(2): 311-339 (2010)

Yijia Chen, Jörg Flum: A Logic for PTIME and a Parameterized Halting Problem. Fields of Logic and Computation 2010: 251-276

Yijia Chen, Jörg Flum: On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. CSL 2010: 200-214

Yijia Chen, Jörg Flum: On p-Optimal Proof Systems and Logics for PTIME. ICALP (2) 2010: 321-332

Yijia Chen, Jörg Flum: On optimal proof systems and logics for PTIME. Electronic Colloquium on Computational Complexity (ECCC) 17: 8 (2010)

Yijia Chen, Jörg Flum: Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping. J. Log. Comput. 19(1): 89-122 (2009)

Yijia Chen, Jörg Flum, Moritz Müller: Lower Bounds for Kernelizations and Other Preprocessing Procedures. CiE 2009: 118-128

Yijia Chen, Jörg Flum: A Logic for PTIME and a Parameterized Halting Problem. LICS 2009: 397-406

Yijia Chen, Jörg Flum: The parameterized complexity of maximality and minimality problems. Ann. Pure Appl. Logic 151(1): 22-61 (2008)

Jörg Flum, Erich Grädel, Thomas Wilke (Eds.): Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games 2, Amsterdam University Press 2008, isbn 978-90-5356-576-6

Yijia Chen, Jörg Flum: A logic for PTIME and a parameterized halting problem. Electronic Colloquium on Computational Complexity (ECCC) 15(083) (2008)

Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Einführung in die mathematische Logik (5. Aufl.). Spektrum Akademischer Verlag 2007, pp. I-IX, 1-339

Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer: Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Logic 148(1-3): 1-19 (2007)

Yijia Chen, Jörg Flum, Martin Grohe: An analysis of the W^*-hierarchy. J. Symb. Log. 72(2): 513-534 (2007)

Jörg Flum: Parameterized Complexity and Logic. CiE 2007: 278-289

Yijia Chen, Jörg Flum: On Parameterized Path and Chordless Path Problems. IEEE Conference on Computational Complexity 2007: 250-263

Yijia Chen, Jörg Flum: Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. CSL 2007: 389-404

Yijia Chen, Jörg Flum, Moritz Müller: Lower Bounds for Kernelizations. Electronic Colloquium on Computational Complexity (ECCC) 14(137) (2007)

Jörg Flum, Martin Grohe, Mark Weyer: Bounded fixed-parameter tractability and log²n nondeterministic bits. J. Comput. Syst. Sci. 72(1): 34-71 (2006)

Yijia Chen, Jörg Flum: On miniaturized problems in parameterized complexity theory. Theor. Comput. Sci. 351(3): 314-336 (2006)

Yijia Chen, Jörg Flum: The Parameterized Complexity of Maximality and Minimality Problems. IWPEC 2006: 25-37

Jörg Flum, Martin Grohe: Model-checking problems as a basis for parameterized intractability. Logical Methods in Computer Science 1(1) (2005)

Yijia Chen, Jörg Flum, Martin Grohe: Machine-based methods in parameterized complexity theory. Theor. Comput. Sci. 339(2-3): 167-199 (2005)

Jörg Flum, Martin Grohe: Model-Checking Problems as a Basis for Parameterized Intractability. CoRR abs/cs/0502005 (2005)

Jörg Flum, Martin Grohe: Parametrized Complexity and Subexponential Time (Column: Computational Complexity). Bulletin of the EATCS 84: 71-100 (2004)

Jörg Flum, Martin Grohe: The Parameterized Complexity of Counting Problems. SIAM J. Comput. 33(4): 892-922 (2004)

Jörg Flum, Martin Grohe, Mark Weyer: Bounded Fixed-Parameter Tractability and log²n Nondeterministic Bits. ICALP 2004: 555-567

Yijia Chen, Jörg Flum: On Miniaturized Problems in Parameterized Complexity Theory. IWPEC 2004: 108-120

Jörg Flum, Martin Grohe: Model-Checking Problems as a Basis for Parameterized Intractability. LICS 2004: 388-397

Jörg Flum, Martin Grohe: Describing parameterized complexity classes. Inf. Comput. 187(2): 291-319 (2003)

Yijia Chen, Jörg Flum, Martin Grohe: Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. IEEE Conference on Computational Complexity 2003: 13-29

Yijia Chen, Jörg Flum: Machine Characterization of the Classes of the W-Hierarchy. CSL 2003: 114-127

Jörg Flum, Markus Frick, Martin Grohe: Query evaluation via tree-decompositions. J. ACM 49(6): 716-752 (2002)

Jörg Flum, Martin Grohe: The Parameterized Complexity of Counting Problems. FOCS 2002: 538-

Jörg Flum, Martin Grohe: Describing Parameterized Complexity Classes. STACS 2002: 359-371

Jörg Flum: Tree-Decompositions and the Model-Checking Problem. Bulletin of the EATCS 73: 78-98 (2001)

Jörg Flum, Martin Grohe: Fixed-Parameter Tractability, Definability, and Model-Checking. SIAM J. Comput. 31(1): 113-145 (2001)

Jörg Flum, Markus Frick, Martin Grohe: Query Evaluation via Tree-Decompositions. ICDT 2001: 22-38

Jörg Flum, Martin Grohe: On Fixed-Point Logic With Counting. J. Symb. Log. 65(2): 777-787 (2000)

Jörg Flum: Games, Kernels, and Antitone Operations. Order 17(1): 61-73 (2000)

Jörg Flum, Max Kubierschky, Bertram Ludäscher: Games and total Datalog¬ queries. Theor. Comput. Sci. 239(2): 257-276 (2000)

Jörg Flum, Martin Ziegler: Pseudo-Finite Homogeneity and Saturation. J. Symb. Log. 64(4): 1689-1699 (1999)

Jörg Flum, Matthias Schiehlen, Jouko A. Väänänen: Quantifiers and Congruence Closure. Studia Logica 62(3): 315-340 (1999)

Jörg Flum, Mario Rodríguez-Artalejo (Eds.): Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings. Lecture Notes in Computer Science 1683, Springer 1999, isbn 3-540-66536-6

Jörg Flum, Martin Grohe: Fixed-parameter tractability, definability, and model checking. CoRR cs.CC/9910001 (1999)

Jörg Flum: An Extension of the Lemma of Rasiowa and Sikorski. Math. Log. Q. 44: 509-514 (1998)

Jörg Flum, Max Kubierschky, Bertram Ludäscher: Total and Partial Well-Founded Datalog Coincide. ICDT 1997: 113-124

Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Einführung in die mathematische Logik (4. Aufl.). Hochschultaschenbuch, Spektrum Akadem. Verl. 1996, isbn 978-3-8274-0130-4, pp. I-X, 1-309

Heinz-Dieter Ebbinghaus, Jörg Flum: Finite model theory. Perspectives in Mathematical Logic, Springer 1995, isbn 978-3-540-60149-4, pp. I-XV, 1-327

Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Mathematical logic (2. ed.). Undergraduate texts in mathematics, Springer 1994, isbn 978-3-540-94258-0, pp. I-X, 1-289

Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Einführung in die mathematische Logik (3. Aufl.). BI-Wissenschaftsverlag 1992, isbn 978-3-411-15603-0, pp. I-X, 1-338

Jörg Flum: On Bounded Theories. CSL 1991: 111-118

Jörg Flum, Juan Carlos Martínez: On Topological Spaces Equivalent to Ordinals. J. Symb. Log. 53(3): 785-795 (1988)

Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas: Mathematical logic. Undergraduate texts in mathematics, Springer 1984, isbn 978-0-387-90895-3, pp. I-IX, 1-216

Jörg Flum: L(Q)-Preservation Theorems. J. Symb. Log. 40(3): 410-418 (1975)

Jörg Flum: A Remark on Infinitary Languages. J. Symb. Log. 36(3): 461-462 (1971)