default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörg Flum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]Yijia Chen, Jörg Flum:
Forbidden induced subgraphs and the łOś-Tarski Theorem. J. Symb. Log. 89(2): 516-548 (2024)- 2022
- [j35]Yijia Chen, Jörg Flum, Moritz Müller:
A Surprising Relationship Between Descriptive Complexity and Proof Complexity. Bull. EATCS 138 (2022) - [c35]Yijia Chen
, Jörg Flum, Mingjun Liu, Zhiyang Xun:
On Algorithms Based on Finitely Many Homomorphism Counts. MFCS 2022: 32:1-32:15 - 2021
- [c34]Yijia Chen, Jörg Flum:
Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. LICS 2021: 1-13 - [i14]Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun:
On Queries Determined by a Constant Number of Homomorphism Counts. CoRR abs/2111.13269 (2021) - 2020
- [c33]Yijia Chen, Jörg Flum:
Parameterized Parallel Computing and First-Order Logic. Fields of Logic and Computation III 2020: 57-78 - [c32]Yijia Chen, Jörg Flum:
FO-Definability of Shrub-Depth. CSL 2020: 15:1-15:16 - [i13]Yijia Chen, Jörg Flum:
Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. CoRR abs/2008.00420 (2020)
2010 – 2019
- 2019
- [j34]Yijia Chen, Jörg Flum:
Some lower bounds in parameterized AC0. Inf. Comput. 267: 116-134 (2019) - 2018
- [c31]Yijia Chen, Jörg Flum:
Tree-depth, quantifier elimination, and quantifier rank. LICS 2018: 225-234 - 2017
- [c30]Yijia Chen, Jörg Flum, Xuangui Huang:
Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. CSL 2017: 19:1-19:16 - [i12]Yijia Chen, Jörg Flum, Xuangui Huang:
Slicewise definability in first-order logic with bounded quantifier rank. CoRR abs/1704.03167 (2017) - [i11]Yijia Chen, Rodney G. Downey, Jörg Flum:
Logic and Computational Complexity (NII Shonan Meeting 2017-13). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [c29]Yijia Chen, Jörg Flum:
Some Lower Bounds in Parameterized AC^0. MFCS 2016: 27:1-27:14 - [i10]Yijia Chen, Jörg Flum:
Some lower bounds in parameterized AC0. CoRR abs/1606.08014 (2016) - 2015
- [c28]Yijia Chen, Jörg Flum:
The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture. Fields of Logic and Computation II 2015: 87-108 - 2014
- [j33]Yijia Chen, Jörg Flum:
On Optimal Inverters. Bull. Symb. Log. 20(1): 1-23 (2014) - [j32]Yijia Chen, Jörg Flum, Moritz Müller:
Hard Instances of Algorithms and Proof Systems. ACM Trans. Comput. Theory 6(2): 7:1-7:25 (2014) - 2013
- [j31]Yijia Chen, Jörg Flum, Moritz Müller:
Consistency, optimality, and incompleteness. Ann. Pure Appl. Log. 164(12): 1224-1235 (2013) - [i9]Yijia Chen, Jörg Flum:
On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j30]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:1-17:34 (2012) - [c27]Yijia Chen, Jörg Flum:
A Parameterized Halting Problem. The Multivariate Algorithmic Revolution and Beyond 2012: 364-397 - [c26]Yijia Chen, Jörg Flum, Moritz Müller:
Hard Instances of Algorithms and Proof Systems. CiE 2012: 118-128 - [c25]Yijia Chen, Kord Eickmeyer, Jörg Flum:
The Exponential Time Hypothesis and the Parameterized Clique Problem. IPEC 2012: 13-24 - [c24]Jörg Flum, Moritz Müller:
Some Definitorial Suggestions for Parameterized Proof Complexity. IPEC 2012: 73-84 - [c23]Yijia Chen, Jörg Flum:
On the Ordered Conjecture. LICS 2012: 225-234 - [i8]Jörg Flum, Moritz Müller:
Some definitorial suggestions for parameterized proof complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j29]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) - [j28]Yijia Chen, Jörg Flum, Moritz Müller:
Lower Bounds for Kernelizations and Other Preprocessing Procedures. Theory Comput. Syst. 48(4): 803-839 (2011) - [c22]Yijia Chen, Jörg Flum, Moritz Müller:
Consistency and Optimality. CiE 2011: 61-70 - [c21]Yijia Chen, Jörg Flum:
Listings and Logics. LICS 2011: 165-174 - [c20]Jörg Flum:
Invariantization of Listings. MFCS 2011: 2 - [i7]Yijia Chen, Jörg Flum:
Listings and logics. Electron. Colloquium Comput. Complex. TR11 (2011) - [i6]Yijia Chen, Jörg Flum, Moritz Müller:
Hard instances of algorithms and proof systems. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j27]Yijia Chen, Jörg Flum:
On the complexity of Gödel's proof predicate. J. Symb. Log. 75(1): 239-254 (2010) - [j26]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) - [c19]Yijia Chen, Jörg Flum:
A Logic for PTIME and a Parameterized Halting Problem. Fields of Logic and Computation 2010: 251-276 - [c18]Yijia Chen, Jörg Flum:
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. CSL 2010: 200-214 - [c17]Yijia Chen, Jörg Flum:
On p-Optimal Proof Systems and Logics for PTIME. ICALP (2) 2010: 321-332 - [i5]Yijia Chen, Jörg Flum:
On optimal proof systems and logics for PTIME. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j25]Yijia Chen, Jörg Flum:
Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping. J. Log. Comput. 19(1): 89-122 (2009) - [c16]Yijia Chen, Jörg Flum, Moritz Müller:
Lower Bounds for Kernelizations and Other Preprocessing Procedures. CiE 2009: 118-128 - [c15]Yijia Chen, Jörg Flum:
A Logic for PTIME and a Parameterized Halting Problem. LICS 2009: 397-406 - 2008
- [j24]Yijia Chen, Jörg Flum:
The parameterized complexity of maximality and minimality problems. Ann. Pure Appl. Log. 151(1): 22-61 (2008) - [e2]Jörg Flum, Erich Grädel, Thomas Wilke:
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 [contents] - [i4]Yijia Chen, Jörg Flum:
A logic for PTIME and a parameterized halting problem. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [b7]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 - [j23]Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer:
Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Log. 148(1-3): 1-19 (2007) - [j22]Yijia Chen, Jörg Flum, Martin Grohe:
An analysis of the W*-hierarchy. J. Symb. Log. 72(2): 513-534 (2007) - [c14]Jörg Flum:
Parameterized Complexity and Logic. CiE 2007: 278-289 - [c13]Yijia Chen, Jörg Flum:
On Parameterized Path and Chordless Path Problems. CCC 2007: 250-263 - [c12]Yijia Chen, Jörg Flum:
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. CSL 2007: 389-404 - [i3]Yijia Chen, Jörg Flum, Moritz Müller:
Lower Bounds for Kernelizations. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [b6]Jörg Flum, Martin Grohe:
Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, Springer 2006, ISBN 978-3-540-29952-3, pp. 1-495 - [j21]Jörg Flum, Martin Grohe, Mark Weyer:
Bounded fixed-parameter tractability and log2n nondeterministic bits. J. Comput. Syst. Sci. 72(1): 34-71 (2006) - [j20]Yijia Chen, Jörg Flum:
On miniaturized problems in parameterized complexity theory. Theor. Comput. Sci. 351(3): 314-336 (2006) - [c11]Yijia Chen, Jörg Flum:
The Parameterized Complexity of Maximality and Minimality Problems. IWPEC 2006: 25-37 - 2005
- [j19]Jörg Flum, Martin Grohe:
Model-checking problems as a basis for parameterized intractability. Log. Methods Comput. Sci. 1(1) (2005) - [j18]Yijia Chen, Jörg Flum, Martin Grohe:
Machine-based methods in parameterized complexity theory. Theor. Comput. Sci. 339(2-3): 167-199 (2005) - [i2]Jörg Flum, Martin Grohe:
Model-Checking Problems as a Basis for Parameterized Intractability. CoRR abs/cs/0502005 (2005) - 2004
- [j17]Jörg Flum, Martin Grohe:
Parametrized Complexity and Subexponential Time (Column: Computational Complexity). Bull. EATCS 84: 71-100 (2004) - [j16]Jörg Flum, Martin Grohe:
The Parameterized Complexity of Counting Problems. SIAM J. Comput. 33(4): 892-922 (2004) - [c10]Jörg Flum, Martin Grohe, Mark Weyer:
Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. ICALP 2004: 555-567 - [c9]Yijia Chen, Jörg Flum:
On Miniaturized Problems in Parameterized Complexity Theory. IWPEC 2004: 108-120 - [c8]Jörg Flum, Martin Grohe:
Model-Checking Problems as a Basis for Parameterized Intractability. LICS 2004: 388-397 - 2003
- [j15]Jörg Flum, Martin Grohe:
Describing parameterized complexity classes. Inf. Comput. 187(2): 291-319 (2003) - [c7]Yijia Chen, Jörg Flum, Martin Grohe:
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. CCC 2003: 13-29 - [c6]Yijia Chen, Jörg Flum:
Machine Characterization of the Classes of the W-Hierarchy. CSL 2003: 114-127 - 2002
- [j14]Jörg Flum, Markus Frick, Martin Grohe:
Query evaluation via tree-decompositions. J. ACM 49(6): 716-752 (2002) - [c5]Jörg Flum, Martin Grohe:
The Parameterized Complexity of Counting Problems. FOCS 2002: 538- - [c4]Jörg Flum, Martin Grohe:
Describing Parameterized Complexity Classes. STACS 2002: 359-371 - 2001
- [j13]Jörg Flum:
Tree-Decompositions and the Model-Checking Problem. Bull. EATCS 73: 78-98 (2001) - [j12]Jörg Flum, Martin Grohe:
Fixed-Parameter Tractability, Definability, and Model-Checking. SIAM J. Comput. 31(1): 113-145 (2001) - [c3]Jörg Flum, Markus Frick, Martin Grohe:
Query Evaluation via Tree-Decompositions. ICDT 2001: 22-38 - 2000
- [j11]Jörg Flum, Martin Grohe:
On Fixed-Point Logic With Counting. J. Symb. Log. 65(2): 777-787 (2000) - [j10]Jörg Flum:
Games, Kernels, and Antitone Operations. Order 17(1): 61-73 (2000) - [j9]Jörg Flum, Max Kubierschky, Bertram Ludäscher:
Games and total Datalog¬ queries. Theor. Comput. Sci. 239(2): 257-276 (2000)
1990 – 1999
- 1999
- [j8]Jörg Flum, Martin Ziegler:
Pseudo-Finite Homogeneity and Saturation. J. Symb. Log. 64(4): 1689-1699 (1999) - [j7]Jörg Flum, Matthias Schiehlen, Jouko A. Väänänen:
Quantifiers and Congruence Closure. Stud Logica 62(3): 315-340 (1999) - [e1]Jörg Flum, Mario Rodríguez-Artalejo:
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 [contents] - [i1]Jörg Flum, Martin Grohe:
Fixed-parameter tractability, definability, and model checking. CoRR cs.CC/9910001 (1999) - 1998
- [j6]Jörg Flum:
An Extension of the Lemma of Rasiowa and Sikorski. Math. Log. Q. 44: 509-514 (1998) - 1997
- [c2]Jörg Flum, Max Kubierschky, Bertram Ludäscher:
Total and Partial Well-Founded Datalog Coincide. ICDT 1997: 113-124 - 1996
- [b5]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 - 1995
- [b4]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 - 1994
- [b3]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 - 1992
- [b2]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 - 1991
- [c1]Jörg Flum:
On Bounded Theories. CSL 1991: 111-118
1980 – 1989
- 1988
- [j5]Jörg Flum, Juan Carlos Martínez:
On Topological Spaces Equivalent to Ordinals. J. Symb. Log. 53(3): 785-795 (1988) - 1985
- [j4]Jörg Flum:
Maximale monadische Logiken. Arch. Math. Log. 25(1): 145-152 (1985) - [j3]Jörg Flum, Juan Carlos Martínez:
χ-Local Operations for Topological Structures. Math. Log. Q. 31(21-23): 345-349 (1985) - 1984
- [b1]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
1970 – 1979
- 1975
- [j2]Jörg Flum:
L(Q)-Preservation Theorems. J. Symb. Log. 40(3): 410-418 (1975) - 1971
- [j1]Jörg Flum:
A Remark on Infinitary Languages. J. Symb. Log. 36(3): 461-462 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-15 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
