Maciej Liskiewicz

129 papers A* 15A 20B 14C 5Misc 2Journal 64Unranked 9

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
2024	A*	`conf`	Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs. AAAI Marcel Wienöbst, Benito van der Zander, Maciej Liskiewicz
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	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
2023	A	`conf`	"Act natural!": Exchanging Private Messages on Public Blockchains. EuroS&P Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz
2023	J	`jnl`	Corrigendum to "Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework" [Artif. Intell. 270 (2019) 1-40]. Artif. Intell. Benito van der Zander, Maciej Liskiewicz, Johannes Textor
2023	A*	`conf`	Efficient Enumeration of Markov Equivalent DAGs. AAAI Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz
2023	J	`jnl`	Efficient Enumeration of Markov Equivalent DAGs. CoRR Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz
2023	J	`jnl`	Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. J. Mach. Learn. Res. Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2023	—	`conf`	Practical Algorithms for Orientations of Partially Directed Graphical Models. CLeaR Malte Luttermann, Marcel Wienöbst, Maciej Liskiewicz
2023	J	`jnl`	Practical Algorithms for Orientations of Partially Directed Graphical Models. CoRR Malte Luttermann, Marcel Wienöbst, Maciej Liskiewicz
2023	A*	`conf`	The Hardness of Reasoning about Probabilities and Causality. IJCAI Benito van der Zander, Markus Bläser, Maciej Liskiewicz
2023	J	`jnl`	The Hardness of Reasoning about Probabilities and Causality. CoRR Benito van der Zander, Markus Bläser, Maciej Liskiewicz
2022	A	`conf`	A new constructive criterion for Markov equivalence of MAGs. UAI Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2022	J	`jnl`	Finding Front-Door Adjustment Sets in Linear Time. CoRR Marcel Wienöbst, Benito van der Zander, Maciej Liskiewicz
2022	A	`conf`	Identification in Tree-shaped Linear Structural Causal Models. AISTATS Benito van der Zander, Marcel Wienöbst, Markus Bläser, Maciej Liskiewicz
2022	J	`jnl`	Identification in Tree-shaped Linear Structural Causal Models. CoRR Benito van der Zander, Marcel Wienöbst, Markus Bläser, Maciej Liskiewicz
2022	J	`jnl`	Learning residual alternating automata. Inf. Comput. Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2022	J	`jnl`	Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. CoRR Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2021	J	`jnl`	"Act natural!": Having a Private Chat on a Public Blockchain. IACR Cryptol. ePrint Arch. Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz
2021	J	`jnl`	A White-Box Masking Scheme Resisting Computational and Algebraic Attacks. IACR Trans. Cryptogr. Hardw. Embed. Syst. Okan Seker, Thomas Eisenbarth, Maciej Liskiewicz
2021	Misc	`conf`	An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm. KI Marcel Wienöbst, Maciej Liskiewicz
2021	A	`conf`	Extendability of causal graphical models: Algorithms and computational complexity. UAI Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2021	A*	`conf`	Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. AAAI Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2021	Misc	`conf`	Recent Advances in Counting and Sampling Markov Equivalent DAGs. KI Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2020	J	`jnl`	A White-Box Masking Scheme Resisting Computational and Algebraic Attacks. IACR Cryptol. ePrint Arch. Okan Seker, Thomas Eisenbarth, Maciej Liskiewicz
2020	J	`jnl`	On the universal steganography of optimal rate. Inf. Comput. Sebastian Berndt, Maciej Liskiewicz
2020	J	`jnl`	Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. CoRR Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2020	A*	`conf`	Recovering Causal Structures from Low-Order Conditional Independencies. AAAI Marcel Wienöbst, Maciej Liskiewicz
2020	J	`jnl`	Recovering Causal Structures from Low-Order Conditional Independencies. CoRR Marcel Wienöbst, Maciej Liskiewicz
2020	J	`jnl`	The generic combinatorial algorithm for image matching with classes of projective transformations. Inf. Comput. Christian Rosenke, Maciej Liskiewicz
2019	A	`conf`	Finding Minimal d-separators in Linear Time and Applications. UAI Benito van der Zander, Maciej Liskiewicz
2019	J	`jnl`	Proper learning of J. Comput. Syst. Sci. Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2019	J	`jnl`	Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework. Artif. Intell. Benito van der Zander, Maciej Liskiewicz, Johannes Textor
2018	—	`conf`	On the Gold Standard for Security of Universal Steganography. EUROCRYPT (1) Sebastian Berndt, Maciej Liskiewicz
2018	J	`jnl`	On the Gold Standard for Security of Universal Steganography. CoRR Sebastian Berndt, Maciej Liskiewicz
2018	J	`jnl`	On the Gold Standard for Security of Universal Steganography. IACR Cryptol. ePrint Arch. Sebastian Berndt, Maciej Liskiewicz
2018	J	`jnl`	Separators and Adjustment Sets in Causal Graphs: Complete Criteria and an Algorithmic Framework. CoRR Benito van der Zander, Maciej Liskiewicz, Johannes Textor
2017	J	`jnl`	Abilities and Limitations of Spectral Graph Bisection. CoRR Martin R. Schuster, Maciej Liskiewicz
2017	A*	`conf`	Algorithm Substitution Attacks from a Steganographic Perspective. CCS Sebastian Berndt, Maciej Liskiewicz
2017	J	`jnl`	Algorithm Substitution Attacks from a Steganographic Perspective. CoRR Sebastian Berndt, Maciej Liskiewicz
2017	A*	`conf`	Learning Residual Alternating Automata. AAAI Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2017	J	`jnl`	Learning Residual Alternating Automata. Electron. Colloquium Comput. Complex. Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2017	A	`conf`	New Abilities and Limitations of Spectral Graph Bisection. ESA Martin R. Schuster, Maciej Liskiewicz
2017	J	`jnl`	Proper Learning of k-term DNF Formulas from Satisfying Assignments. Electron. Colloquium Comput. Complex. Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2017	J	`jnl`	Security levels in steganography - Insecurity does not imply detectability. Theor. Comput. Sci. Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
2016	B	`conf`	Hard Communication Channels for Steganography. ISAAC Sebastian Berndt, Maciej Liskiewicz
2016	A	`conf`	On Searching for Generalized Instrumental Variables. AISTATS Benito van der Zander, Maciej Liskiewicz
2016	C	`conf`	Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions. IH&MMSec Sebastian Berndt, Maciej Liskiewicz
2016	A*	`conf`	Separators and Adjustment Sets in Markov Equivalent DAGs. AAAI Benito van der Zander, Maciej Liskiewicz
2015	B	`conf`	Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. ISAAC Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk
2015	A*	`conf`	Efficiently Finding Conditional Instruments for Causal Inference. IJCAI Benito van der Zander, Johannes Textor, Maciej Liskiewicz
2015	A	`conf`	Learning from Pairwise Marginal Independencies. UAI Johannes Textor, Alexander Idelberger, Maciej Liskiewicz
2015	J	`jnl`	Learning from Pairwise Marginal Independencies. CoRR Johannes Textor, Alexander Idelberger, Maciej Liskiewicz
2015	J	`jnl`	Security Levels in Steganography - Insecurity does not Imply Detectability. Electron. Colloquium Comput. Complex. Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
2014	A	`conf`	A generic finite automata based approach to implementing lymphocyte repertoire models. GECCO Johannes Textor, Katharina Dannenberg, Maciej Liskiewicz
2014	J	`jnl`	A new upper bound for the traveling salesman problem in cubic graphs. J. Discrete Algorithms Maciej Liskiewicz, Martin R. Schuster
2014	—	`conf`	Constructing Separators and Adjustment Sets in Ancestral Graphs. CI@UAI Benito van der Zander, Maciej Liskiewicz, Johannes Textor
2014	A	`conf`	Constructing Separators and Adjustment Sets in Ancestral Graphs. UAI Benito van der Zander, Maciej Liskiewicz, Johannes Textor
2014	—	`conf`	On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals. CCCG Alexander Idelberger, Maciej Liskiewicz
2013	C	`conf`	A new upper bound for the traveling salesman problem in cubic graphs. CTW Maciej Liskiewicz, Martin R. Schuster
2013	J	`jnl`	Grey-box steganography. Theor. Comput. Sci. Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
2012	J	`jnl`	Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective CoRR Johannes Textor, Maciej Liskiewicz
2012	J	`jnl`	Improved Analysis of an Exact Algorithm for Cubic Graph TSP CoRR Maciej Liskiewicz, Martin R. Schuster
2011	A	`conf`	Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective. UAI Johannes Textor, Maciej Liskiewicz
2011	C	`conf`	Grey-Box Steganography. TAMC Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
2011	J	`jnl`	New complexity bounds for image matching under rotation and scaling. J. Discrete Algorithms Christian Hundt, Maciej Liskiewicz
2011	J	`jnl`	Privacy in Non-private Environments. Theory Comput. Syst. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2010	A	`conf`	Negative selection algorithms without generating detectors. GECCO Maciej Liskiewicz, Johannes Textor
2009	J	`jnl`	A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation. Theor. Comput. Sci. Christian Hundt, Maciej Liskiewicz, Ragnar Nevries
2009	J	`jnl`	Improving the average delay of sorting. Theor. Comput. Sci. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
2009	B	`conf`	New Complexity Bounds for Image Matching under Rotation and Scaling. CPM Christian Hundt, Maciej Liskiewicz
2008	B	`conf`	Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations. MFCS Christian Hundt, Maciej Liskiewicz
2008	—	`conf`	Susceptible Two-Party Quantum Computations. ICITS Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
2008	B	`conf`	Two-Dimensional Pattern Matching with Combined Scaling and Rotation. CPM Christian Hundt, Maciej Liskiewicz
2007	J	`jnl`	A Combinatorial Geometric Approach to Linear Image Matching. Electron. Colloquium Comput. Complex. Christian Hundt, Maciej Liskiewicz
2007	C	`conf`	Improving the Average Delay of Sorting. TAMC Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
2007	A	`conf`	On the Complexity of Affine Image Matching. STACS Christian Hundt, Maciej Liskiewicz
2007	J	`jnl`	Preface. Theory Comput. Syst. Maciej Liskiewicz, Rüdiger Reischuk
2006	—	`conf`	Multiparty Computations in Non-private Environments. GTIT-C Maciej Liskiewicz
2006	J	`jnl`	Private Computation: k-Connected versus 1-Connected Networks. J. Cryptol. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2006	B	`conf`	Provably Secure Steganography and the Complexity of Sampling. ISAAC Christian Hundt, Maciej Liskiewicz, Ulrich Wölfel
2006	J	`jnl`	Space efficient algorithms for directed series-parallel graphs. J. Algorithms Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2006	—	`conf`	Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Complexity of Boolean Functions Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
2006	J	`jnl`	Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Electron. Colloquium Comput. Complex. Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
2006	J	`jnl`	Using quantum oblivious transfer to cheat sensitive quantum bit commitment CoRR Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
2005	B	`ed.`	Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings FCT Maciej Liskiewicz, Rüdiger Reischuk
2005	—	`conf`	On the Intractability of Inverting Geometric Distortions in Watermarking Schemes. Information Hiding Maciej Liskiewicz, Ulrich Wölfel
2005	J	`jnl`	One-way communication complexity of symmetric Boolean functions. RAIRO Theor. Informatics Appl. Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
2005	A	`conf`	Revealing Additional Information in Two-Party Computations. ASIACRYPT Andreas Jakoby, Maciej Liskiewicz
2004	J	`jnl`	Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2004	J	`jnl`	New lower and upper bounds for the competitive ratio of transmission protocols. Inf. Process. Lett. Maciej Liskiewicz, Bodo Manthey
2004	A	`conf`	Privacy in Non-private Environments. ASIACRYPT Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2004	C	`conf`	Relation of Residues in the Variable Region of 16S rDNA Sequences and Their Relevance to Genus-Specificity. WABI Maciej Liskiewicz, Hemant J. Purohit, Dhananjay V. Raje
2003	J	`jnl`	One-Way Communication Complexity of Symmetric Boolean Functions Electron. Colloquium Comput. Complex. Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
2003	B	`conf`	One-Way Communication Complexity of Symmetric Boolean Functions. FCT Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
2003	J	`jnl`	Privacy in Non-Private Environments Electron. Colloquium Comput. Complex. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2003	J	`jnl`	Private Computation - k-connected versus 1-connected Networks Electron. Colloquium Comput. Complex. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2003	A	`conf`	Private Computations in Networks: Topology versus Randomness. STACS Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2003	J	`jnl`	The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda
2002	A*	`conf`	Paths Problems in Symmetric Logarithmic Space. ICALP Andreas Jakoby, Maciej Liskiewicz
2002	A*	`conf`	Private Computation - k-Connected versus 1-Connected Networks. CRYPTO Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert
2002	J	`jnl`	Space Efficient Algorithms for Directed Series-Parallel Graphs Electron. Colloquium Comput. Complex. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2001	J	`jnl`	Dynamic Process Graphs and the Complexity of Scheduling Electron. Colloquium Comput. Complex. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2001	A	`conf`	Space Efficient Algorithms for Series-Parallel Graphs. STACS Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2001	B	`conf`	The Complexity of Some Basic Problems for Dynamic Process Graphs. ISAAC Andreas Jakoby, Maciej Liskiewicz
2000	B	`conf`	The Expressive Power and Complexity of Dynamic Process Graphs. WG Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
1999	J	`jnl`	On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. Comput. Complex. Maciej Liskiewicz, Rüdiger Reischuk
1999	A	`conf`	Scheduling Dynamic Graphs. STACS Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
1997	B	`conf`	Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. MFCS Maciej Liskiewicz, Rüdiger Reischuk
1997	A	`conf`	Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes. STACS Maciej Liskiewicz
1996	J	`jnl`	The Sublogarithmic Alternating Space World. SIAM J. Comput. Maciej Liskiewicz, Rüdiger Reischuk
1995	J	`jnl`	On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals. Math. Syst. Theory Maciej Liskiewicz
1995	J	`jnl`	The Sublogarithmic Alternating Space World Electron. Colloquium Comput. Complex. Maciej Liskiewicz, Rüdiger Reischuk
1994	—	`conf`	The Complexity World below Logarithmic Space. SCT Maciej Liskiewicz, Rüdiger Reischuk
1993	J	`jnl`	On the Relationship Between Deterministic Time and Deterministic Reversal. Inf. Process. Lett. Maciej Liskiewicz
1993	A	`conf`	Separating the Lower Levels of the Sublogarithmic Space Hierarchy. STACS Maciej Liskiewicz, Rüdiger Reischuk
1990	J	`jnl`	Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones. SIAM J. Comput. Maciej Liskiewicz, Krzysztof Lorys
1990	J	`jnl`	Reversal Complexity Classes for Alternating Turing Machines. SIAM J. Comput. Miroslaw Kutylowski, Maciej Liskiewicz, Krzysztof Lorys
1989	A*	`conf`	On Reversal Complexity for Alternating Turing Machines (Extended Abstract) FOCS Maciej Liskiewicz, Krzysztof Lorys
1989	B	`conf`	Some Time-Space Bounds for One-Tape Deterministic Turing Machines. FCT Maciej Liskiewicz, Krzysztof Lorys
1988	J	`jnl`	Alternating Real-Time Computations. Inf. Process. Lett. Maciej Liskiewicz, Krzysztof Lorys
1988	B	`conf`	Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs. MFCS Krzysztof Lorys, Maciej Liskiewicz
1987	J	`jnl`	On Reversal Bounded Alternating Turing Machines. Theor. Comput. Sci. Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów