Julian Dörfler

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 14

Top Topics

Complexity Theory

Subgraph Mining

Top Venues

SIAM J. Appl. Algebra Geom.

Publications

Julian Dörfler, Christian Ikenmeyer
Functional Closure Properties of Finite ℕ-weighted Automata. CoRR (2024)
Julian Dörfler, Christian Ikenmeyer
Functional Closure Properties of Finite ℕ-Weighted Automata. ICALP (2024)
Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz
Probabilistic and Causal Satisfiability: the Impact of Marginalization. CoRR (2024)
Markus Bläser, Julian Dörfler, Gorav Jindal
PosSLP and Sum of Squares. CoRR (2024)
Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander
The Existential Theory of the Reals with Summation Operators. CoRR (2024)
Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz
On the Complexity of Identification in Linear Structural Causal Models. CoRR (2024)
Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica 84 (2) (2022)
Markus Bläser, Julian Dörfler, Christian Ikenmeyer
On the Complexity of Evaluating Highest Weight Vectors. Computational Complexity Conference (2021)
Markus Bläser, Julian Dörfler, Christian Ikenmeyer
On the complexity of evaluating highest weight vectors. CoRR (2020)
Julian Dörfler, Christian Ikenmeyer, Greta Panova
On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. SIAM J. Appl. Algebra Geom. 4 (2) (2020)
Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. MFCS (2019)
Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. CoRR (2019)
Julian Dörfler, Christian Ikenmeyer, Greta Panova
On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions. CoRR (2019)
Julian Dörfler, Christian Ikenmeyer, Greta Panova
On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. ICALP (2019)