Maciej Liskiewicz
Cited by
Cited by
Robust causal inference using directed acyclic graphs: the R package ‘dagitty’
J Textor, B Van der Zander, MS Gilthorpe, M Liśkiewicz, GTH Ellison
International journal of epidemiology 45 (6), 1887-1894, 2016
Adjustment criteria in causal diagrams: An algorithmic perspective
J Textor, M Liskiewicz
Conference on Uncertainty in Artificial Intelligence (UAI) 27, 681--688, 2011
Constructing Separators and Adjustment Sets in Ancestral Graphs
B van der Zander, M Liskiewicz, J Textor
Conference on Uncertainty in Artificial Intelligence (UAI) 30, 11-24, 2014
Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework
B Van Der Zander, M Liśkiewicz, J Textor
Artificial Intelligence 270, 1-40, 2019
Algorithm substitution attacks from a steganographic perspective
S Berndt, M Liśkiewicz
Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS …, 2017
Space efficient algorithms for directed series–parallel graphs
A Jakoby, M Liśkiewicz, R Reischuk
Journal of Algorithms 60 (2), 85-114, 2006
The sublogarithmic alternating space world
M Liśkiewicz, R Reischuk
SIAM Journal on Computing 25 (4), 828-861, 1996
Efficiently finding conditional instruments for causal inference
B Van der Zander, J Textor, M Liśkiewicz
Proc. 24th International Joint Conference on Artificial Intelligence (IJCAI …, 2015
Private computation: k-connected versus 1-connected networks
M Bläser, A Jakoby, M Liskiewicz, B Manthey
Journal of Cryptology 19 (3), 341-357, 2006
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs
M Wienöbst, M Bannach, M Liskiewicz
35th AAAI Conference on Artificial Intelligence, 2021, 12198-12206, 2021
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
M Liśkiewicz, M Ogihara, S Toda
Theoretical Computer Science 304 (1-3), 129-156, 2003
Security levels in steganography–insecurity does not imply detectability
M Liśkiewicz, R Reischuk, U Wölfel
Theoretical Computer Science 692, 25-45, 2017
Separators and Adjustment Sets in Markov Equivalent DAGs.
B van der Zander, M Liskiewicz
30th AAAI Conference on Artificial Intelligence (AAAI) 2016, 3315-3321, 2016
Negative selection algorithms without generating detectors
M Liśkiewicz, J Textor
Annual Conference on Genetic and Evolutionary Computation (GECCO) 12, 1047-1054, 2010
Learning Residual Alternating Automata.
S Berndt, M Liskiewicz, M Lutter, R Reischuk
31st AAAI Conference on Artificial Intelligence 2017, 1749-1755, 2017
On searching for generalized instrumental variables
B Zander, M Liśkiewicz
Artificial Intelligence and Statistics, 1214-1222, 2016
On the complexity of affine image matching
C Hundt, M Liśkiewicz
Annual Symposium on Theoretical Aspects of Computer Science (STACS), 284-295, 2007
A white-box masking scheme resisting computational and algebraic attacks
O Seker, T Eisenbarth, M Liskiewicz
IACR Transactions on Cryptographic Hardware and Embedded Systems, 61-105, 2021
A new upper bound for the traveling salesman problem in cubic graphs
M Liśkiewicz, MR Schuster
Journal of Discrete Algorithms 27, 1-20, 2014
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
C Hundt, M Liśkiewicz, R Nevries
Theoretical Computer Science 410 (51), 5317-5333, 2009
The system can't perform the operation now. Try again later.
Articles 1–20