Maciej Liskiewicz

About Maciej Liskiewicz

Maciej Liskiewicz, With an exceptional h-index of 18 and a recent h-index of 12 (since 2020), a distinguished researcher at Universität zu Lübeck, specializes in the field of Algorithms, Causality, Cryptography, Learning, Computational complexity.

His recent articles reflect a diverse array of research interests and contributions to the field:

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs

Practical Algorithms for Orientations of Partially Directed Graphical Models

“Act natural!”: Exchanging Private Messages on Public Blockchains

Efficient enumeration of Markov equivalent DAGs

Corrigendum to “Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework”[Artif. Intell. 270 (2019) 1–40]

The Hardness of Reasoning about Probabilities and Causality

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications

Learning residual alternating automata

Maciej Liskiewicz Information

University

Position

___

Citations(all)

2529

Citations(since 2020)

1949

Cited By

1130

hIndex(all)

18

hIndex(since 2020)

12

i10Index(all)

30

i10Index(since 2020)

15

Email

University Profile Page

Google Scholar

Maciej Liskiewicz Skills & Research Interests

Algorithms

Causality

Cryptography

Learning

Computational complexity

Top articles of Maciej Liskiewicz

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs

2024

Practical Algorithms for Orientations of Partially Directed Graphical Models

2023/8/10

“Act natural!”: Exchanging Private Messages on Public Blockchains

2023/7/3

Efficient enumeration of Markov equivalent DAGs

Proceedings of the AAAI Conference on Artificial Intelligence

2023/6/26

Corrigendum to “Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework”[Artif. Intell. 270 (2019) 1–40]

Artificial Intelligence

2023

The Hardness of Reasoning about Probabilities and Causality

2023

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications

Journal of Machine Learning Research

2023

Learning residual alternating automata

Information and Computation

2022/11/1

A new constructive criterion for markov equivalence of mags

2022/8/17

Identification in Tree-shaped Linear Structural Causal Models

2022/5/3

A white-box masking scheme resisting computational and algebraic attacks

IACR Transactions on Cryptographic Hardware and Embedded Systems

2021/2/23

An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm

2021

Recent Advances in Counting and Sampling Markov Equivalent DAGs

2021

"Act natural!": Having a Private Chat on a Public Blockchain

Cryptology ePrint Archive, Report 2021/1073

2021

Extendability of Causal Graphical Models: Algorithms and Computational Complexity

2021

On the universal steganography of optimal rate

Information and Computation

2020/12/1

The generic combinatorial algorithm for image matching with classes of projective transformations

Information and Computation

2020/12/1

Recovering Causal Structures from Low-Order Conditional Independencies

2020

Marcel Wienöbst
Marcel Wienöbst

H-Index: 1

Maciej Liskiewicz
Maciej Liskiewicz

H-Index: 11

See List of Professors in Maciej Liskiewicz University(Universität zu Lübeck)

Co-Authors

academic-engine