Julian Dörfler

22 papers A* 5A 1B 3Journal 12Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy. ICLR Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz
2025	A*	`conf`	Probabilistic and Causal Satisfiability: Constraining the Model. ICALP Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander
2025	J	`jnl`	Probabilistic and Causal Satisfiability: Constraining the Model. CoRR Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander
2025	B	`conf`	Which Graph Motif Parameters Count? MFCS Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer
2025	J	`jnl`	Which graph motif parameters count? CoRR Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer
2024	A*	`conf`	Functional Closure Properties of Finite ℕ-Weighted Automata. ICALP Julian Dörfler, Christian Ikenmeyer
2024	J	`jnl`	Functional Closure Properties of Finite ℕ-weighted Automata. CoRR Julian Dörfler, Christian Ikenmeyer
2024	A*	`conf`	On the Complexity of Identification in Linear Structural Causal Models. NeurIPS Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz
2024	J	`jnl`	On the Complexity of Identification in Linear Structural Causal Models. CoRR Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz
2024	—	`conf`	PosSLP and Sum of Squares. FSTTCS Markus Bläser, Julian Dörfler, Gorav Jindal
2024	J	`jnl`	PosSLP and Sum of Squares. CoRR Markus Bläser, Julian Dörfler, Gorav Jindal
2024	J	`jnl`	Probabilistic and Causal Satisfiability: the Impact of Marginalization. CoRR Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz
2024	B	`conf`	The Existential Theory of the Reals with Summation Operators. ISAAC Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander
2024	J	`jnl`	The Existential Theory of the Reals with Summation Operators. CoRR Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander
2022	J	`jnl`	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
2021	A	`conf`	On the Complexity of Evaluating Highest Weight Vectors. CCC Markus Bläser, Julian Dörfler, Christian Ikenmeyer
2020	J	`jnl`	On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. SIAM J. Appl. Algebra Geom. Julian Dörfler, Christian Ikenmeyer, Greta Panova
2020	J	`jnl`	On the complexity of evaluating highest weight vectors. CoRR Markus Bläser, Julian Dörfler, Christian Ikenmeyer
2019	B	`conf`	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. MFCS Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
2019	J	`jnl`	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. CoRR Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
2019	A*	`conf`	On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. ICALP Julian Dörfler, Christian Ikenmeyer, Greta Panova
2019	J	`jnl`	On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions. CoRR Julian Dörfler, Christian Ikenmeyer, Greta Panova