Maciej Liskiewicz

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 50

Top Venues

CoRR

AAAI

UAI

IACR Cryptol. ePrint Arch.

Publications

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, 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)
Marcel Wienöbst, Benito van der Zander, Maciej Liskiewicz
Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs. AAAI (2024)
Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz
Efficient Enumeration of Markov Equivalent DAGs. AAAI (2023)
Benito van der Zander, Markus Bläser, Maciej Liskiewicz
The Hardness of Reasoning about Probabilities and Causality. IJCAI (2023)
Benito van der Zander, Markus Bläser, Maciej Liskiewicz
The Hardness of Reasoning about Probabilities and Causality. CoRR (2023)
Benito van der Zander, Maciej Liskiewicz, Johannes Textor
Corrigendum to "Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework" [Artif. Intell. 270 (2019) 1-40]. Artif. Intell. 321 (2023)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. J. Mach. Learn. Res. 24 (2023)
Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz
"Act natural!": Exchanging Private Messages on Public Blockchains. EuroS&P (2023)
Malte Luttermann, Marcel Wienöbst, Maciej Liskiewicz
Practical Algorithms for Orientations of Partially Directed Graphical Models. CoRR (2023)
Malte Luttermann, Marcel Wienöbst, Maciej Liskiewicz
Practical Algorithms for Orientations of Partially Directed Graphical Models. CLeaR (2023)
Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz
Efficient Enumeration of Markov Equivalent DAGs. CoRR (2023)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
A new constructive criterion for Markov equivalence of MAGs. UAI (2022)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. CoRR (2022)
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Learning residual alternating automata. Inf. Comput. 289 (Part) (2022)
Benito van der Zander, Marcel Wienöbst, Markus Bläser, Maciej Liskiewicz
Identification in Tree-shaped Linear Structural Causal Models. AISTATS (2022)
Marcel Wienöbst, Benito van der Zander, Maciej Liskiewicz
Finding Front-Door Adjustment Sets in Linear Time. CoRR (2022)
Benito van der Zander, Marcel Wienöbst, Markus Bläser, Maciej Liskiewicz
Identification in Tree-shaped Linear Structural Causal Models. CoRR (2022)
Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz
"Act natural!": Having a Private Chat on a Public Blockchain. IACR Cryptol. ePrint Arch. 2021 (2021)
Marcel Wienöbst, Maciej Liskiewicz
An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm. KI (2021)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Recent Advances in Counting and Sampling Markov Equivalent DAGs. KI (2021)
Okan Seker, Thomas Eisenbarth, Maciej Liskiewicz
A White-Box Masking Scheme Resisting Computational and Algebraic Attacks. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021 (2) (2021)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. AAAI (2021)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Extendability of causal graphical models: Algorithms and computational complexity. UAI (2021)
Christian Rosenke, Maciej Liskiewicz
The generic combinatorial algorithm for image matching with classes of projective transformations. Inf. Comput. 275 (2020)
Sebastian Berndt, Maciej Liskiewicz
On the universal steganography of optimal rate. Inf. Comput. 275 (2020)
Marcel Wienöbst, Maciej Liskiewicz
Recovering Causal Structures from Low-Order Conditional Independencies. AAAI (2020)
Marcel Wienöbst, Maciej Liskiewicz
Recovering Causal Structures from Low-Order Conditional Independencies. CoRR (2020)
Okan Seker, Thomas Eisenbarth, Maciej Liskiewicz
A White-Box Masking Scheme Resisting Computational and Algebraic Attacks. IACR Cryptol. ePrint Arch. 2020 (2020)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. CoRR (2020)
Benito van der Zander, Maciej Liskiewicz, Johannes Textor
Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework. Artif. Intell. 270 (2019)
Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
-term DNF formulas from satisfying assignments. J. Comput. Syst. Sci. 106 (2019)
Benito van der Zander, Maciej Liskiewicz
Finding Minimal d-separators in Linear Time and Applications. UAI (2019)
Sebastian Berndt, Maciej Liskiewicz
On the Gold Standard for Security of Universal Steganography. EUROCRYPT (1) (2018)
Sebastian Berndt, Maciej Liskiewicz
On the Gold Standard for Security of Universal Steganography. IACR Cryptol. ePrint Arch. 2018 (2018)
Sebastian Berndt, Maciej Liskiewicz
On the Gold Standard for Security of Universal Steganography. CoRR (2018)
Benito van der Zander, Maciej Liskiewicz, Johannes Textor
Separators and Adjustment Sets in Causal Graphs: Complete Criteria and an Algorithmic Framework. CoRR (2018)
Martin R. Schuster, Maciej Liskiewicz
New Abilities and Limitations of Spectral Graph Bisection. ESA (2017)
Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Proper Learning of k-term DNF Formulas from Satisfying Assignments. Electron. Colloquium Comput. Complex. 24 (2017)
Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
Security levels in steganography - Insecurity does not imply detectability. Theor. Comput. Sci. 692 (2017)
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Learning Residual Alternating Automata. AAAI (2017)
Sebastian Berndt, Maciej Liskiewicz
Algorithm Substitution Attacks from a Steganographic Perspective. CoRR (2017)
Sebastian Berndt, Maciej Liskiewicz
Algorithm Substitution Attacks from a Steganographic Perspective. CCS (2017)
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Learning Residual Alternating Automata. Electron. Colloquium Comput. Complex. 24 (2017)
Martin R. Schuster, Maciej Liskiewicz
Abilities and Limitations of Spectral Graph Bisection. CoRR (2017)
Benito van der Zander, Maciej Liskiewicz
On Searching for Generalized Instrumental Variables. AISTATS (2016)
Sebastian Berndt, Maciej Liskiewicz
Hard Communication Channels for Steganography. ISAAC (2016)
Benito van der Zander, Maciej Liskiewicz
Separators and Adjustment Sets in Markov Equivalent DAGs. AAAI (2016)
Sebastian Berndt, Maciej Liskiewicz
Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions. IH&MMSec (2016)
Johannes Textor, Alexander Idelberger, Maciej Liskiewicz
Learning from Pairwise Marginal Independencies. UAI (2015)
Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk
Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. ISAAC (2015)
Johannes Textor, Alexander Idelberger, Maciej Liskiewicz
Learning from Pairwise Marginal Independencies. CoRR (2015)
Benito van der Zander, Johannes Textor, Maciej Liskiewicz
Efficiently Finding Conditional Instruments for Causal Inference. IJCAI (2015)
Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
Security Levels in Steganography - Insecurity does not Imply Detectability. Electron. Colloquium Comput. Complex. 22 (2015)
Benito van der Zander, Maciej Liskiewicz, Johannes Textor
Constructing Separators and Adjustment Sets in Ancestral Graphs. CI@UAI (2014)
Benito van der Zander, Maciej Liskiewicz, Johannes Textor
Constructing Separators and Adjustment Sets in Ancestral Graphs. UAI (2014)
Maciej Liskiewicz, Martin R. Schuster
A new upper bound for the traveling salesman problem in cubic graphs. J. Discrete Algorithms 27 (2014)
Alexander Idelberger, Maciej Liskiewicz
On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals. CCCG (2014)
Johannes Textor, Katharina Dannenberg, Maciej Liskiewicz
A generic finite automata based approach to implementing lymphocyte repertoire models. GECCO (2014)
Maciej Liskiewicz, Martin R. Schuster
A new upper bound for the traveling salesman problem in cubic graphs. CTW (2013)
Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
Grey-box steganography. Theor. Comput. Sci. 505 (2013)
Johannes Textor, Maciej Liskiewicz
Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective CoRR (2012)
Maciej Liskiewicz, Martin R. Schuster
Improved Analysis of an Exact Algorithm for Cubic Graph TSP CoRR (2012)
Johannes Textor, Maciej Liskiewicz
Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective. UAI (2011)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Privacy in Non-private Environments. Theory Comput. Syst. 48 (1) (2011)
Christian Hundt, Maciej Liskiewicz
New complexity bounds for image matching under rotation and scaling. J. Discrete Algorithms 9 (1) (2011)
Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
Grey-Box Steganography. TAMC (2011)
Maciej Liskiewicz, Johannes Textor
Negative selection algorithms without generating detectors. GECCO (2010)
Christian Hundt, Maciej Liskiewicz
New Complexity Bounds for Image Matching under Rotation and Scaling. CPM (2009)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
Improving the average delay of sorting. Theor. Comput. Sci. 410 (11) (2009)
Christian Hundt, Maciej Liskiewicz, Ragnar Nevries
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation. Theor. Comput. Sci. 410 (51) (2009)
Christian Hundt, Maciej Liskiewicz
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations. MFCS (2008)
Christian Hundt, Maciej Liskiewicz
Two-Dimensional Pattern Matching with Combined Scaling and Rotation. CPM (2008)
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
Susceptible Two-Party Quantum Computations. ICITS (2008)
Christian Hundt, Maciej Liskiewicz
On the Complexity of Affine Image Matching. STACS (2007)
Maciej Liskiewicz, Rüdiger Reischuk
Preface. Theory Comput. Syst. 41 (2) (2007)
Christian Hundt, Maciej Liskiewicz
A Combinatorial Geometric Approach to Linear Image Matching. Electron. Colloquium Comput. Complex. 14 (066) (2007)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
Improving the Average Delay of Sorting. TAMC (2007)
Maciej Liskiewicz
Multiparty Computations in Non-private Environments. GTIT-C (2006)
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
Using quantum oblivious transfer to cheat sensitive quantum bit commitment CoRR (2006)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60 (2) (2006)
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Complexity of Boolean Functions (2006)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Private Computation: k-Connected versus 1-Connected Networks. J. Cryptol. 19 (3) (2006)
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Electron. Colloquium Comput. Complex. 13 (085) (2006)
Christian Hundt, Maciej Liskiewicz, Ulrich Wölfel
Provably Secure Steganography and the Complexity of Sampling. ISAAC (2006)
Maciej Liskiewicz, Ulrich Wölfel
On the Intractability of Inverting Geometric Distortions in Watermarking Schemes. Information Hiding (2005)
Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
One-way communication complexity of symmetric Boolean functions. RAIRO Theor. Informatics Appl. 39 (4) (2005)
Andreas Jakoby, Maciej Liskiewicz
Revealing Additional Information in Two-Party Computations. ASIACRYPT (2005)
Maciej Liskiewicz, Hemant J. Purohit, Dhananjay V. Raje
Relation of Residues in the Variable Region of 16S rDNA Sequences and Their Relevance to Genus-Specificity. WABI (2004)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Privacy in Non-private Environments. ASIACRYPT (2004)
Maciej Liskiewicz, Bodo Manthey
New lower and upper bounds for the competitive ratio of transmission protocols. Inf. Process. Lett. 89 (6) (2004)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms 2 (4) (2004)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Privacy in Non-Private Environments Electron. Colloquium Comput. Complex. (071) (2003)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Private Computation - k-connected versus 1-connected Networks Electron. Colloquium Comput. Complex. 10 (009) (2003)
Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
One-Way Communication Complexity of Symmetric Boolean Functions Electron. Colloquium Comput. Complex. (083) (2003)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Private Computations in Networks: Topology versus Randomness. STACS (2003)
Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
One-Way Communication Complexity of Symmetric Boolean Functions. FCT (2003)
Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 304 (1-3) (2003)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert
Private Computation - k-Connected versus 1-Connected Networks. CRYPTO (2002)

Maciej Liskiewicz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Maciej Liskiewicz