On Reversal Bounded Alternating Turing Machines. - Maciej Liskiewicz; Krzysztof Lorys; Marek Piotrów (Theor. Comput. Sci., 1987)

Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs. - Krzysztof Lorys; Maciej Liskiewicz (MFCS, 1988)

Alternating Real-Time Computations. - Maciej Liskiewicz; Krzysztof Lorys (Inf. Process. Lett., 1988)

Some Time-Space Bounds for One-Tape Deterministic Turing Machines. - Maciej Liskiewicz; Krzysztof Lorys (FCT, 1989)

On Reversal Complexity for Alternating Turing Machines (Extended Abstract) - Maciej Liskiewicz; Krzysztof Lorys (FOCS, 1989)

Reversal Complexity Classes for Alternating Turing Machines. - Miroslaw Kutylowski; Maciej Liskiewicz; Krzysztof Lorys (SIAM J. Comput., 1990)

Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones. - Maciej Liskiewicz; Krzysztof Lorys (SIAM J. Comput., 1990)

Separating the Lower Levels of the Sublogarithmic Space Hierarchy. - Maciej Liskiewicz; Rüdiger Reischuk (STACS, 1993)

On the Relationship Between Deterministic Time and Deterministic Reversal. - Maciej Liskiewicz (Inf. Process. Lett., 1993)

The Complexity World below Logarithmic Space. - Maciej Liskiewicz; Rüdiger Reischuk (SCT, 1994)

On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals. - Maciej Liskiewicz (Math. Syst. Theory, 1995)

The Sublogarithmic Alternating Space World. - Maciej Liskiewicz; Rüdiger Reischuk (SIAM J. Comput., 1996)

Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. - Maciej Liskiewicz; Rüdiger Reischuk (MFCS, 1997)

Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes. - Maciej Liskiewicz (STACS, 1997)

Scheduling Dynamic Graphs. - Andreas Jakoby; Maciej Liskiewicz; Rüdiger Reischuk (STACS, 1999)

On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. - Maciej Liskiewicz; Rüdiger Reischuk (Comput. Complex., 1999)

The Expressive Power and Complexity of Dynamic Process Graphs. - Andreas Jakoby; Maciej Liskiewicz; Rüdiger Reischuk (WG, 2000)

The Complexity of Some Basic Problems for Dynamic Process Graphs. - Andreas Jakoby; Maciej Liskiewicz (ISAAC, 2001)

Space Efficient Algorithms for Series-Parallel Graphs. - Andreas Jakoby; Maciej Liskiewicz; Rüdiger Reischuk (STACS, 2001)

Dynamic Process Graphs and the Complexity of Scheduling - Andreas Jakoby; Maciej Liskiewicz; Rüdiger Reischuk (Electron. Colloquium Comput. Complex., 2001)

Paths Problems in Symmetric Logarithmic Space. - Andreas Jakoby; Maciej Liskiewicz (ICALP, 2002)

Space Efficient Algorithms for Directed Series-Parallel Graphs - Andreas Jakoby; Maciej Liskiewicz; Rüdiger Reischuk (Electron. Colloquium Comput. Complex., 2002)

Private Computations in Networks: Topology versus Randomness. - Andreas Jakoby; Maciej Liskiewicz; Rüdiger Reischuk (STACS, 2003)

Private Computation - k-connected versus 1-connected Networks - Markus Bläser; Andreas Jakoby; Maciej Liskiewicz; Bodo Manthey (Electron. Colloquium Comput. Complex., 2003)

Privacy in Non-Private Environments - Markus Bläser; Andreas Jakoby; Maciej Liskiewicz; Bodo Manthey (Electron. Colloquium Comput. Complex., 2003)

One-Way Communication Complexity of Symmetric Boolean Functions - Jan Arpe; Andreas Jakoby; Maciej Liskiewicz (Electron. Colloquium Comput. Complex., 2003)

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. - Maciej Liskiewicz; Mitsunori Ogihara; Seinosuke Toda (Theor. Comput. Sci., 2003)

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 (WABI, 2004)

New lower and upper bounds for the competitive ratio of transmission protocols. - Maciej Liskiewicz; Bodo Manthey (Inf. Process. Lett., 2004)

Approximating schedules for dynamic process graphs efficiently. - Andreas Jakoby; Maciej Liskiewicz; Rüdiger Reischuk (J. Discrete Algorithms, 2004)

Revealing Additional Information in Two-Party Computations. - Andreas Jakoby; Maciej Liskiewicz (ASIACRYPT, 2005)

On the Intractability of Inverting Geometric Distortions in Watermarking Schemes. - Maciej Liskiewicz; Ulrich Wölfel (Information Hiding, 2005)

Multiparty Computations in Non-private Environments. - Maciej Liskiewicz (GTIT-C, 2006)

Provably Secure Steganography and the Complexity of Sampling. - Christian Hundt 001; Maciej Liskiewicz; Ulrich Wölfel (ISAAC, 2006)

Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. - Andreas Jakoby; Maciej Liskiewicz; Aleksander Madry (Electron. Colloquium Comput. Complex., 2006)

On the Complexity of Affine Image Matching. - Christian Hundt 001; Maciej Liskiewicz (STACS, 2007)

A Combinatorial Geometric Approach to Linear Image Matching. - Christian Hundt 001; Maciej Liskiewicz (Electron. Colloquium Comput. Complex., 2007)

Preface. - Maciej Liskiewicz; Rüdiger Reischuk (Theory Comput. Syst., 2007)

Two-Dimensional Pattern Matching with Combined Scaling and Rotation. - Christian Hundt 001; Maciej Liskiewicz (CPM, 2008)

Susceptible Two-Party Quantum Computations. - Andreas Jakoby; Maciej Liskiewicz; Aleksander Madry (ICITS, 2008)

Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations. - Christian Hundt 001; Maciej Liskiewicz (MFCS, 2008)

A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation. - Christian Hundt 001; Maciej Liskiewicz; Ragnar Nevries (Theor. Comput. Sci., 2009)

Improving the average delay of sorting. - Andreas Jakoby; Maciej Liskiewicz; Rüdiger Reischuk; Christian Schindelhauer (Theor. Comput. Sci., 2009)

Negative selection algorithms without generating detectors. - Maciej Liskiewicz; Johannes Textor (GECCO, 2010)

Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective. - Johannes Textor; Maciej Liskiewicz (UAI, 2011)

New complexity bounds for image matching under rotation and scaling. - Christian Hundt 001; Maciej Liskiewicz (J. Discrete Algorithms, 2011)

Improved Analysis of an Exact Algorithm for Cubic Graph TSP - Maciej Liskiewicz; Martin R. Schuster (CoRR, 2012)

Grey-box steganography. - Maciej Liskiewicz; Rüdiger Reischuk; Ulrich Wölfel (Theor. Comput. Sci., 2013)

On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals. - Alexander Idelberger; Maciej Liskiewicz (CCCG, 2014)

A generic finite automata based approach to implementing lymphocyte repertoire models. - Johannes Textor; Katharina Dannenberg; Maciej Liskiewicz (GECCO, 2014)

Constructing Separators and Adjustment Sets in Ancestral Graphs. - Benito van der Zander; Maciej Liskiewicz; Johannes Textor (UAI, 2014)

A new upper bound for the traveling salesman problem in cubic graphs. - Maciej Liskiewicz; Martin R. Schuster (J. Discrete Algorithms, 2014)

Efficiently Finding Conditional Instruments for Causal Inference. - Benito van der Zander; Johannes Textor; Maciej Liskiewicz (IJCAI, 2015)

Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. - Matthias Ernst; Maciej Liskiewicz; Rüdiger Reischuk (ISAAC, 2015)

Learning from Pairwise Marginal Independencies. - Johannes Textor; Alexander Idelberger; Maciej Liskiewicz (UAI, 2015)

Separators and Adjustment Sets in Markov Equivalent DAGs. - Benito van der Zander; Maciej Liskiewicz (AAAI, 2016)

On Searching for Generalized Instrumental Variables. - Benito van der Zander; Maciej Liskiewicz (AISTATS, 2016)

Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions. - Sebastian Berndt 001; Maciej Liskiewicz (IH&MMSec, 2016)

Hard Communication Channels for Steganography. - Sebastian Berndt 001; Maciej Liskiewicz (ISAAC, 2016)

Algorithm Substitution Attacks from a Steganographic Perspective. - Sebastian Berndt 001; Maciej Liskiewicz (CCS, 2017)

New Abilities and Limitations of Spectral Graph Bisection. - Martin R. Schuster; Maciej Liskiewicz (ESA, 2017)

Abilities and Limitations of Spectral Graph Bisection. - Martin R. Schuster; Maciej Liskiewicz (CoRR, 2017)

Learning Residual Alternating Automata. - Sebastian Berndt 001; Maciej Liskiewicz; Matthias Lutter; Rüdiger Reischuk (Electron. Colloquium Comput. Complex., 2017)

Proper Learning of k-term DNF Formulas from Satisfying Assignments. - Maciej Liskiewicz; Matthias Lutter; Rüdiger Reischuk (Electron. Colloquium Comput. Complex., 2017)

Security levels in steganography - Insecurity does not imply detectability. - Maciej Liskiewicz; Rüdiger Reischuk; Ulrich Wölfel (Theor. Comput. Sci., 2017)

On the Gold Standard for Security of Universal Steganography. - Sebastian Berndt 001; Maciej Liskiewicz (IACR Cryptol. ePrint Arch., 2018)

Finding Minimal d-separators in Linear Time and Applications. - Benito van der Zander; Maciej Liskiewicz (UAI, 2019)

Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework. - Benito van der Zander; Maciej Liskiewicz; Johannes Textor (Artif. Intell., 2019)

Proper learning of k-term DNF formulas from satisfying assignments. - Maciej Liskiewicz; Matthias Lutter; Rüdiger Reischuk (J. Comput. Syst. Sci., 2019)

Recovering Causal Structures from Low-Order Conditional Independencies. - Marcel Wienöbst; Maciej Liskiewicz (AAAI, 2020)

On the universal steganography of optimal rate. - Sebastian Berndt 001; Maciej Liskiewicz (Inf. Comput., 2020)

The generic combinatorial algorithm for image matching with classes of projective transformations. - Christian Rosenke; Maciej Liskiewicz (Inf. Comput., 2020)

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (AAAI, 2021)

Recent Advances in Counting and Sampling Markov Equivalent DAGs. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (KI, 2021)

An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm. - Marcel Wienöbst; Maciej Liskiewicz (KI, 2021)

Extendability of causal graphical models: Algorithms and computational complexity. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (UAI, 2021)

"Act natural!": Having a Private Chat on a Public Blockchain. - Thore Tiemann; Sebastian Berndt 001; Thomas Eisenbarth 001; Maciej Liskiewicz (IACR Cryptol. ePrint Arch., 2021)

A White-Box Masking Scheme Resisting Computational and Algebraic Attacks. - Okan Seker; Thomas Eisenbarth 001; Maciej Liskiewicz (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021)

Identification in Tree-shaped Linear Structural Causal Models. - Benito van der Zander; Marcel Wienöbst; Markus Bläser; Maciej Liskiewicz (AISTATS, 2022)

A new constructive criterion for Markov equivalence of MAGs. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (UAI, 2022)

Finding Front-Door Adjustment Sets in Linear Time. - Marcel Wienöbst; Benito van der Zander; Maciej Liskiewicz (CoRR, 2022)

Efficient Enumeration of Markov Equivalent DAGs. - Marcel Wienöbst; Malte Luttermann; Max Bannach; Maciej Liskiewicz (AAAI, 2023)

Practical Algorithms for Orientations of Partially Directed Graphical Models. - Malte Luttermann; Marcel Wienöbst; Maciej Liskiewicz (CLeaR, 2023)

"Act natural!": Exchanging Private Messages on Public Blockchains. - Thore Tiemann; Sebastian Berndt 001; Thomas Eisenbarth 001; Maciej Liskiewicz (EuroS&P, 2023)

The Hardness of Reasoning about Probabilities and Causality. - Benito van der Zander; Markus Bläser; Maciej Liskiewicz (IJCAI, 2023)

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (J. Mach. Learn. Res., 2023)

Corrigendum to "Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework" [Artif. Intell. 270 (2019) 1-40]. - Benito van der Zander; Maciej Liskiewicz; Johannes Textor (Artif. Intell., 2023)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs. - Marcel Wienöbst; Benito van der Zander; Maciej Liskiewicz (AAAI, 2024)

The Existential Theory of the Reals with Summation Operators. - Markus Bläser; Julian Dörfler; Maciej Liskiewicz; Benito van der Zander (ISAAC, 2024)

On the Complexity of Identification in Linear Structural Causal Models. - Julian Dörfler; Benito van der Zander; Markus Bläser; Maciej Liskiewicz (NeurIPS, 2024)

Probabilistic and Causal Satisfiability: the Impact of Marginalization. - Julian Dörfler; Benito van der Zander; Markus Bläser; Maciej Liskiewicz (CoRR, 2024)

Probabilistic and Causal Satisfiability: Constraining the Model. - Markus Bläser; Julian Dörfler; Maciej Liskiewicz; Benito van der Zander (ICALP, 2025)

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy. - Julian Dörfler; Benito van der Zander; Markus Bläser; Maciej Liskiewicz (ICLR, 2025)