Maciej Liskiewicz 个人学术档案

引用次数

	总计	2019 年至今
引用	3017	2436
h 指数	20	13
i10 指数	33	17

600

300

150

450

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202410 12 6 5 21 6 9 2 11 12 13 15 22 19 22 15 20 18 34 16 31 20 33 46 44 92 162 274 377 486 596 541

开放获取的出版物数量

查看全部

21 篇文章

6 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Benito van der ZanderUniversität zu Lübeck在 benibela.de 的电子邮件经过验证
Johannes TextorData Science Section, Institute for Computing and Information Sciences, Radboud University, Nijmegen在 radboudumc.nl 的电子邮件经过验证
Marcel WienöbstPhD Student, University of Lübeck在 tcs.uni-luebeck.de 的电子邮件经过验证
Sebastian BerndtTechnische Hochschule Lübeck在 th-luebeck.de 的电子邮件经过验证
Mark S GilthorpeLeeds Beckett University & Alan Turing Institute在 leedsbeckett.ac.uk 的电子邮件经过验证
George EllisonProfessor of Data Science, Centre for Data Innovation, University of Central Lancashire在 uclan.ac.uk 的电子邮件经过验证
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, Germany在 cs.uni-saarland.de 的电子邮件经过验证
Max BannachEuropean Space Agency在 esa.int 的电子邮件经过验证
Ulrich WölfelUniversität Bonn在 uni-bonn.de 的电子邮件经过验证
Mitsunori OgiharaUniversity of Miami在 cs.miami.edu 的电子邮件经过验证
Bodo MantheyAssociate Professor, University of Twente在 utwente.nl 的电子邮件经过验证
Thomas EisenbarthUniversity of Lübeck在 uni-luebeck.de 的电子邮件经过验证
Alexander IdelbergerStudent of Computer Science, University of Lübeck在 student.uni-luebeck.de 的电子邮件经过验证
Malte LuttermannPhD Student, University of Lübeck在 uni-luebeck.de 的电子邮件经过验证
Okan SekerResearch Asistant, University of Lübeck在 uni-luebeck.de 的电子邮件经过验证
Ragnar NevriesPhD student, University of Rostock, Germany在 uni-rostock.de 的电子邮件经过验证
Aleksander MądryMIT在 mit.edu 的电子邮件经过验证
Thore TiemannUniversity of Lübeck在 uni-luebeck.de 的电子邮件经过验证
Marek PiotrówInstytut Informatyki, Uniwersytet Wrocławski在 cs.uni.wroc.pl 的电子邮件经过验证
Christian SchindelhauerComputer Networks and Telematics, University of Freiburg, Germany在 informatik.uni-freiburg.de 的电子邮件经过验证

关注

Maciej Liskiewicz

University of Lübeck

在 tcs.uni-luebeck.de 的电子邮件经过验证 - 首页

Algorithms Causality Cryptography Learning Computational complexity


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	1977	2016
Adjustment criteria in causal diagrams: An algorithmic perspective J Textor, M Liskiewicz Conference on Uncertainty in Artificial Intelligence (UAI) 27, 681--688, 2011	76	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	70	2014
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes M Liskiewicz, M Ogihara, S Toda Theoretical Computer Science 304 (1-3), 129-156, 2003	53*	2003
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	48	2019
Algorithm substitution attacks from a steganographic perspective S Berndt, M Liśkiewicz Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS …, 2017	41	2017
Space efficient algorithms for directed series–parallel graphs A Jakoby, M Liśkiewicz, R Reischuk Journal of Algorithms 60 (2), 85-114, 2006	39*	2006
The sublogarithmic alternating space world M Liśkiewicz, R Reischuk SIAM Journal on Computing 25 (4), 828-861, 1996	38*	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	36	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	30*	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	27	2021
Security levels in steganography–insecurity does not imply detectability M Liśkiewicz, R Reischuk, U Wölfel Theoretical Computer Science 692, 25-45, 2017	25	2017
Negative selection algorithms without generating detectors M Liśkiewicz, J Textor Annual Conference on Genetic and Evolutionary Computation (GECCO) 12, 1047-1054, 2010	25	2010
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	24	2016
On searching for generalized instrumental variables B Zander, M Liśkiewicz Artificial Intelligence and Statistics, 1214-1222, 2016	23	2016
Learning residual alternating automata S Berndt, M Liśkiewicz, M Lutter, R Reischuk Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017	22	2017
On the complexity of affine image matching C Hundt, M Liśkiewicz Annual Symposium on Theoretical Aspects of Computer Science (STACS), 284-295, 2007	21	2007
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	21	2003
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	20	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	20	2014

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用