| 2025 | ICALP | Probabilistic and Causal Satisfiability: Constraining the Model. | Markus Blser, Julian Drfler, Maciej Liskiewicz, Benito van der Zander |
| 2025 | ICLR | From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy. | Julian Drfler, Benito van der Zander, Markus Blser, Maciej Liskiewicz |
| 2024 | AAAI | Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs. | Marcel Wienbst, Benito van der Zander, Maciej Liskiewicz |
| 2024 | ISAAC | The Existential Theory of the Reals with Summation Operators. | Markus Blser, Julian Drfler, Maciej Liskiewicz, Benito van der Zander |
| 2023 | AAAI | Efficient Enumeration of Markov Equivalent DAGs. | Marcel Wienbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz |
| 2023 | IJCAI | The Hardness of Reasoning about Probabilities and Causality. | Benito van der Zander, Markus Blser, Maciej Liskiewicz |
| 2022 | AISTATS | Identification in Tree-shaped Linear Structural Causal Models. | Benito van der Zander, Marcel Wienbst, Markus Blser, Maciej Liskiewicz |
| 2022 | UAI | A new constructive criterion for Markov equivalence of MAGs. | Marcel Wienbst, Max Bannach, Maciej Liskiewicz |
| 2021 | AAAI | Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. | Marcel Wienbst, Max Bannach, Maciej Liskiewicz |
| 2021 | KI | Recent Advances in Counting and Sampling Markov Equivalent DAGs. | Marcel Wienbst, Max Bannach, Maciej Liskiewicz |
| 2021 | KI | An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm. | Marcel Wienbst, Maciej Liskiewicz |
| 2021 | UAI | Extendability of causal graphical models: Algorithms and computational complexity. | Marcel Wienbst, Max Bannach, Maciej Liskiewicz |
| 2020 | AAAI | Recovering Causal Structures from Low-Order Conditional Independencies. | Marcel Wienbst, Maciej Liskiewicz |
| 2019 | UAI | Finding Minimal d-separators in Linear Time and Applications. | Benito van der Zander, Maciej Liskiewicz |
| 2018 | EuroCrypt | On the Gold Standard for Security of Universal Steganography. | Sebastian Berndt, Maciej Liskiewicz |
| 2017 | AAAI | Learning Residual Alternating Automata. | Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rdiger Reischuk |
| 2017 | CCS | Algorithm Substitution Attacks from a Steganographic Perspective. | Sebastian Berndt, Maciej Liskiewicz |
| 2017 | ESA | New Abilities and Limitations of Spectral Graph Bisection. | Martin R. Schuster, Maciej Liskiewicz |
| 2016 | AAAI | Separators and Adjustment Sets in Markov Equivalent DAGs. | Benito van der Zander, Maciej Liskiewicz |
| 2016 | AISTATS | On Searching for Generalized Instrumental Variables. | Benito van der Zander, Maciej Liskiewicz |
| 2016 | ISAAC | Hard Communication Channels for Steganography. | Sebastian Berndt, Maciej Liskiewicz |
| 2015 | IJCAI | Efficiently Finding Conditional Instruments for Causal Inference. | Benito van der Zander, Johannes Textor, Maciej Liskiewicz |
| 2015 | ISAAC | Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. | Matthias Ernst, Maciej Liskiewicz, Rdiger Reischuk |
| 2015 | UAI | Learning from Pairwise Marginal Independencies. | Johannes Textor, Alexander Idelberger, Maciej Liskiewicz |
| 2014 | GECCO | A generic finite automata based approach to implementing lymphocyte repertoire models. | Johannes Textor, Katharina Dannenberg, Maciej Liskiewicz |
| 2014 | UAI | Constructing Separators and Adjustment Sets in Ancestral Graphs. | Benito van der Zander, Maciej Liskiewicz, Johannes Textor |
| 2014 | UAI | Constructing Separators and Adjustment Sets in Ancestral Graphs. | Benito van der Zander, Maciej Liskiewicz, Johannes Textor |
| 2011 | UAI | Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective. | Johannes Textor, Maciej Liskiewicz |
| 2011 | TAMC | Grey-Box Steganography. | Maciej Liskiewicz, Rdiger Reischuk, Ulrich Wlfel |
| 2010 | GECCO | Negative selection algorithms without generating detectors. | Maciej Liskiewicz, Johannes Textor |
| 2009 | CPM | New Complexity Bounds for Image Matching under Rotation and Scaling. | Christian Hundt, Maciej Liskiewicz |
| 2008 | CPM | Two-Dimensional Pattern Matching with Combined Scaling and Rotation. | Christian Hundt, Maciej Liskiewicz |
| 2008 | MFCS | Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations. | Christian Hundt, Maciej Liskiewicz |
| 2007 | STACS | On the Complexity of Affine Image Matching. | Christian Hundt, Maciej Liskiewicz |
| 2007 | TAMC | Improving the Average Delay of Sorting. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk, Christian Schindelhauer |
| 2006 | ISAAC | Provably Secure Steganography and the Complexity of Sampling. | Christian Hundt, Maciej Liskiewicz, Ulrich Wlfel |
| 2005 | ASIACRYPT | Revealing Additional Information in Two-Party Computations. | Andreas Jakoby, Maciej Liskiewicz |
| 2004 | ASIACRYPT | Privacy in Non-private Environments. | Markus Blser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
| 2004 | WABI | Relation of Residues in the Variable Region of 16S rDNA Sequences and Their Relevance to Genus-Specificity. | Maciej Liskiewicz, Hemant J. Purohit, Dhananjay V. Raje |
| 2003 | FCT | One-Way Communication Complexity of Symmetric Boolean Functions. | Jan Arpe, Andreas Jakoby, Maciej Liskiewicz |
| 2003 | STACS | Private Computations in Networks: Topology versus Randomness. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 2002 | CRYPTO | Private Computation - k-Connected versus 1-Connected Networks. | Markus Blser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert |
| 2002 | ICALP | Paths Problems in Symmetric Logarithmic Space. | Andreas Jakoby, Maciej Liskiewicz |
| 2001 | ISAAC | The Complexity of Some Basic Problems for Dynamic Process Graphs. | Andreas Jakoby, Maciej Liskiewicz |
| 2001 | STACS | Space Efficient Algorithms for Series-Parallel Graphs. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 2000 | WG | The Expressive Power and Complexity of Dynamic Process Graphs. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 1999 | STACS | Scheduling Dynamic Graphs. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 1997 | MFCS | Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. | Maciej Liskiewicz, Rdiger Reischuk |
| 1997 | STACS | Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes. | Maciej Liskiewicz |
| 1993 | STACS | Separating the Lower Levels of the Sublogarithmic Space Hierarchy. | Maciej Liskiewicz, Rdiger Reischuk |
| 1989 | FCT | Some Time-Space Bounds for One-Tape Deterministic Turing Machines. | Maciej Liskiewicz, Krzysztof Lorys |
| 1989 | FOCS | On Reversal Complexity for Alternating Turing Machines (Extended Abstract) | Maciej Liskiewicz, Krzysztof Lorys |
| 1988 | MFCS | Two Applications of Frer's Counter to One-Tape Nondeterministic TMs. | Krzysztof Lorys, Maciej Liskiewicz |