- Links to
- Staff
- Winter semester 2018

*Sebastian Berndt, Maciej Liskiewicz*:**On the Gold Standard for Security of Universal Steganography.**

In*Proc. Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques,*Volume vol. 10820 of*LNCS,*pp. 29-60. Springer, 2018.

Go to website | Show abstract*Sebastian Berndt, Maciej Liskiewicz:***On the Gold Standard for Security of Universal Steganography.**

Technical report 106, IACR Cryptology ePrint Archive, 2018.

Go to website*Benito van der Zander, Maciej Liskiewicz, Johannes Textor:***Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework.**

Technical report arXiv:1803.00116 (2018), arXiv preprint, 2018.

Show PDF

*Sebastian Berndt, Maciej Liskiewicz*:**Algorithm Substitution Attacks from a Steganographic Perspective.**

In*Proc. 24th ACM Conference on Computer and Communications Security (CCS 2017),*pp. 1649-1660. ACM Press, 2017.

Go to website | Show abstract*Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:***Learning Residual Alternating Automata.***Electronic Colloquium on Computational Complexity (ECCC),*24(46)2017.

Go to website | Show abstract*Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk*:**Learning Residual Alternating Automata.**

Proc. 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 1749-1755. AAAI Press, 2017.

Go to website | Show abstract*Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:***Proper Learning of k-term DNF Formulas from Satisfying Assignments.***Electronic Colloquium on Computational Complexity (ECCC),*24(114)2017.

Go to website | Show abstract*Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:***Security levels in steganography - Insecurity does not imply detectability.***Theoret. Comput. Sci.,*(692):25-45, 2017.

Go to website*Martin R. Schuster, Maciej Liskiewicz:***New Abilities and Limitations of Spectral Graph Bisection.**

Technical report 1701.01337, arXiv, 2017.

Go to website | Show abstract*Martin R. Schuster, Maciej Liskiewicz*:**New Abilities and Limitations of Spectral Graph Bisection.**

In*25th Annual European Symposium on Algorithms, (ESA) 2017,*LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.

*Sebastian Berndt, Maciej Liskiewicz*:**Hard Communication Channels for Steganography.**

In*The 27th International Symposium on Algorithms and Computation (ISAAC 2016),*ISBN 978-3-95977-026-2, LIPICS Vol. 64, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2016.

Go to website | Show abstract*Sebastian Berndt, Maciej Liskiewicz*:**Provable Secure Universal Steganography of Optimal Rate.**

In*Proceedings of the 4rd ACM Workshop on Information Hiding and Multimedia Security, IH&MMSec 2016, Vigo, Spain, June 20 - 22, 2016,*pp. 387-394. ACM (Awarded Best Student Paper), 2016.

Go to website | Show abstract*Johannes Textor, Benito van der Zander, Mark S. Gilthorpe, Maciej Liskiewicz, George T.H. Ellison:***Robust causal inference using Directed Acyclic Graphs: the R package ’dagitty’.***International Journal of Epidemiology,*6(45):1887-1894, 2016.

Go to website*Benito Van der Zander, Maciej Liskiewicz*:**On Searching for Generalized Instrumental Variables.**

In*Proceedings of the The 19th International Conference on Artificial Intelligence and Statistics (AISTATS'16),*pp. 1214-1222. JMLR Proceedings, 2016.

Go to website*Benito van der Zander, Maciej Liskiewicz*:**Separators and Adjustment Sets in Markov Equivalent DAGs.**

In*Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI'16), Phoenix, Arizona USA,*pp. 3315-3321. AAAI Press, 2016.

Go to website

*Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk*:**Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples.**

In*Proc. International Symposium on Algorithms and Computation (ISAAC 2015),*Volume 9472 of*Lecture Notes in Computer Science,*pp. 151-162. Springer, 2015.

Go to website | Show abstract*Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:***Security Levels in Steganography - Insecurity does not Imply Detectability.***Electronic Colloquium on Computational Complexity (ECCC),*22(10)2015.

Go to website | Show abstract*Johannes Textor, Alexander Idelberger, Maciej Liskiewicz*:**On the Faithful DAGs of a Dependency Graph.**

In*Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (UAI'15),*pp. 882-891. AUAI Press, 2015.

Show PDF*Benito van der Zander, Johannes Textor, Maciej Liskiewicz*:**Efficiently Finding Conditional Instruments for Causal Inference.**

In*IJCAI 2015, Proceedings of the 24th International Joint Conference on Artificial Intelligence, Buenos Aires, Argentina, July 25-31, 2015,*pp. 3243-3249. AAAI Press / International Joint Conferences on Artificial Intelligence, 2015.

Show PDF

*Alexander Idelberger, Maciej Liskiewicz*:**On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals.**

In*Proceedings of the 26th Canadian Conference on Computational Geometry (CCCG'14),*Halifax, Nova Scotia, Canada, 2014.

Go to website*Maciej Liskiewicz, Martin R. Schuster:***A new upper bound for the traveling salesman problem in cubic graphs.***Journal of Discrete Algorithms,*(27):1-20, 2014.

Go to website*Johannes Textor, Katharina Dannenberg, Maciej Liskiewicz*:**A Generic Finite Automata Based Approach to Implementing Lymphocyte Repertoire Models.**

In*Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO'14),*pp. 129-136. ACM Press, 2014.

Go to website*Benito van der Zander, Johannes Textor, Maciej Liskiewicz*:**Constructing Separators and Adjustment Sets in Ancestral Graphs.**

In*Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence (UAI'14), Quebec, Canada,*pp. 907-916. AUAI Press, 2014.

Show PDF

*Maciej Liskiewicz, Martin R. Schuster*:**A new upper bound for the traveling salesman problem in cubic graphs.**

In*12th Cologne-Twente Workshop on Graphs and Combinatorial, Optimization, Enschede, Netherlands, May 21-23, 2013,*Volume WP 13-01 of*CTIT Workshop Proceedings,*pp. 159-162. , 2013.*Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:***Grey-box steganography.***Theoretical Computer Science,*(505):27-41, 2013.

Go to website

*Maciej Liskiewicz, Martin R. Schuster:***Improved Analysis of an Exact Algorithm for Cubic Graph TSP.***CoRR,*(abs/1207.4694)2012.

Go to website*Johannes Textor, Maciej Liskiewicz:***Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective.***CoRR,*(abs/1202.3764)2012.

Go to website

*Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:***Privacy in Non-private Environments.***Theory of Computing Systems,*48(1):211-245, 2011.

Go to website*Christian Hundt, Maciej Liskiewicz:***New complexity bounds for image matching under rotation and scaling.***Journal of Discrete Algorithms,*9:122–136, 2011.

Go to website*Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel*:**Grey-Box Steganography.**

Volume 6648 of*Lecture Notes in Computer Science,*pp. 390-402. Springer Verlag, Heidelberg, in Proceedings 8. TAMC, 2011.

Go to website*Johannes Textor, Maciej Liskiewicz*:**Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective.**

In*Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI 2011),*pp. 681-688. AUAI Press, 2011.

Show PDF | Go to website

*Maciej Liskiewicz, Johannes Textor*:**Negative Selection Algorithms Without Generating Detectors.**

In*Proceedings of the 12th annual conference on Genetic and evolutionary computation (GECCO'10),*pp. 1047-1054. ACM, 2010.

Show PDF | Go to website | Show abstract

*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer:***Improving the Average Delay of Sorting.***Theoretical Computer Science,*410(11):1030-1041, 2009.

Go to website*Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:***Grey-Box Steganography.**

Technical report SIIM-TR-A-09-03, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2009.

Show PDF | Show abstract*Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:***Privacy in Non-Private Environments.***Theory of Computing Systems,*2009.

Go to website*Christian Hundt, Maciej Liskiewicz, Ragnar Nevries:***A Combinatorial Geometric Approach to Two-dimensional Robustly Pattern Matching with Scaling and Rotation.***Theoretical Computer Science,*51(410):5317-5333, 2009.

Go to website*Christian Hundt, Maciej Liskiewicz*:**New Complexity Bounds for Image Matching under Rotation and Scaling.**

In*Proceedings of Symposium on Combinatorial Pattern Matching (CPM),*Volume 5577 of*Lecture Notes in Computer Science,*pp. 127-141. Springer, 2009.

Go to website

*Christian Hundt, Maciej Liskiewicz*:**Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations.**

In*Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS),*Volume 5162 of*Lecture Notes in Computer Science,*pp. 395-406. Springer, 2008.

Go to website*Christian Hundt, Maciej Liskiewicz*:**Two-dimensional Pattern Matching with Combined Scaling and Rotation.**

In*Proceedings of the 19th Symposium on Combinatorial Pattern Matching (CPM),*Volume 5029 of*Lecture Notes in Computer Science,*pp. 5-17. Springer, 2008.

Go to website*Andreas Jacoby, Maciej Liskiewicz, Aleksander Madry*:**Susceptible Two-party Quantum Computations.**

In*in Proceedings of the 2nd International Conference on Information Theoretic Security (ICITS),*Volume 5155 of*Lecture Notes in Computer Science,*pp. 121-136. Springer, 2008.

Go to website*Maciej Liskiewicz, Ulrich Wölfel*:**Computational Aspects of Digital Steganography.**

In*Multimedia Forensics and Security,*pp. 193-211. Information Science Reference, Hershey, New York, 2008.

Go to website

*Christian Hundt, Maciej Liskiewicz*:**On the Complexity of Affine Image Matching.**

In*Proceedings of the International Symposium on Theoretical Aspects of Computer Science (STACS 2007),*Volume 4393 of*Lecture Notes in Computer Science,*pp. 284-295. Springer, 2007.

Go to website*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer*:**Improving the Average Delay of Sorting.**

In*4th International Conference, Theory and Applications of Models of Computation, TAMC 2007,*Volume 4484 of*Lecture Notes in Computer Science,*pp. 330-341. Springer, 2007.

Go to website*Maciej Liskiewicz, Rüdiger Reischuk, Guest Eds.*:**Theory of Computing Systems.**

Volume 41/2 of*Theory of Computing Systems,*Springer, 2007.

Go to website

*Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:***Private computation -- 2-connected versus 1-connected networks.***Journal of Cryptology,*19(3):341-357, 2006.

Go to website*Christian Hundt, Maciej Liskiewicz, Ulrich Wölfel*:**Provably Secure Steganography and the Complexity of Sampling.**

In*Algorithms and Computation,*Volume 4288 of*Lecture Notes in Computer Science,*pp. 754-763. Springer, 2006.

Go to website*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:***Space Efficient Algorithms for Directed Series-Parallel Graphs.***Journal of Algorithms,*2(60):85-114, 2006.

Go to website*Maciej Liskiewicz*:**Multiparty Computations in Non-Private Environments.**

In*Information Transfer and Combinatorics,*Volume 4123 of*Lecture Notes in Computer Science,*pp. 1082-1084. Springer, 2006.

Go to website

*Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:***One-Way Communication Complexity of Symmetric Boolean Functions.***RAIRO - Theoretical Informatics and Applications,*39(4):687-706, 2005.

Go to website*Andreas Jakoby, Maciej Liskiewicz*:**Revealing Additional Information in Two-Party Computations.**

In*Proc. of the 11th Ann. Int. Conf. on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2005),*Volume 3788 of*Lecture Notes in Computer Science,*pp. 121-135. Springer, 2005.

Go to website*Maciej Liskiewicz, Ulrich Wölfel*:**On the Intractability of Inverting Geometric Distortions in Watermarking Schemes.**

In*Proc. 7th Information Hiding Workshop (IH 2005),*Volume 3727 of*Lecture Notes in Computer Science,*pp. 176-188. Springer, 2005.

Go to website*Maciej Liskiewicz, Rüdiger Reischuk*:**Proceedings of the 15th International Symposium On Fundamentals of Computation Theory (FCT), Lübeck 2005.**

Volume 3623 of*Lecture Notes in Computer Science,*Springer, 2005.

Go to website

*Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey*:**Privacy in Non-Private Environments.**

In*Proc. 10th Ann. Int. Conf. on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2004),*Volume 3329 of*Lecture Notes in Computer Science,*pp. 137-151. Springer, 2004.

Go to website*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:***Approximating Schedules for Dynamic Graphs Efficiently.***Journal of Discrete Algorithms,*4(2):471-500, 2004.

Go to website*Maciej Liskiewicz, Bodo Manthey:***New lower and upper bounds for the competitive ratio of transmission protocols.***Information Processing Letters,*89(6):297-301, 2004.

Go to website*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.**

In*Proc. 4th Workshop on Algorithms in Bioinformatics (WABI 2004),*Volume 3240 of*Lecture Notes in Computer Science,*pp. 362-373. Springer, 2004.

Go to website

*Jan Arpe, Andreas Jakoby, Maciej Liskiewicz*:**One-Way Communication Complexity of Symmetric Boolean Functions.**

In*Proc. 14th International Symposium on Fundamentals of Computation Theory (FCT 2003),*Volume 2751 of*Lecture Notes in Computer Science,*pp. 158-170. Springer, 2003.

Go to website*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk*:**Private Computations in Networks: Topology versus Randomness.**

In*21 GI Symposium on Theoretical Aspects of Computer Science STACS'2003,*Volume 2607 of*Lecture Notes in Computer Science,*pp. 189-198. Springer, 2003.

Go to website*Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda:***Counting Self-avoiding Walks in Some Regular Graphs.***SIGACT News,*34(3):26-39, 2003.*Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda:***The Complexity of Counting Self-avoiding Walks in Subgraphs of Two-dimensional Grids and Hypercubes.***Theoretical Computer Science,*304(1-3):129-156, 2003.

Go to website

*Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert*:**Private Computation - k-Connected versus 1-Connected Networks.**

In*Proc. 22nd Annual International Association for Cryptologic Research (IACR) Crypto Conference (CRYPTO 2002),,*Volume 2442 of*Lecture Notes in Computer Science,*pp. 194-209. Springer, 2002.

Go to website*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:***Dynamic Process Graphs and the Complexity of Scheduling.**

Technical report SIIM-TR-A-00-02, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2002.

Show postscript | Show abstract*Andreas Jakoby, Maciej Liskiewicz*:**Paths Problems in Symmetric Logarithmic Space.**

In*Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP 2002),*Volume 2380 of*Lecture Notes in Computer Science,*pp. 269-280. Springer, 2002.

Go to website

*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk*:**Space Efficient Algorithms for Series-Parallel Graphs.**

In*18 GI-MIMD Symposium on Theoretical Aspects of Computer Science STACS'2001,*Volume 2010 of*Lecture Notes in Computer Science,*pp. 339-352. Springer, 2001.

Go to website*Andreas Jakoby, Maciej Liskiewicz*:**The Complexity of Some Basic Problems for Dynamic Process Graphs.**

In*Proc. 12th Annual International Symposium on Algorithms and Computation (ISAAC 2001),*Volume 2223 of*Lecture Notes in Computer Science,*pp. 562-574. Springer, 2001.

Go to website

*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:***Space Efficient Algorithms for Series-Parallel Graphs.**

Technical report SIIM-TR-A-00-17, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2000.

Show postscript | Show abstract*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk*:**The Expressive Power and Complexity of Dynamic Process Graphs.**

In*26. Int. Workshop on Graph-Theoretical Concepts in Computer Science WG'2000,*Volume 1928 of*Lecture Notes in Computer Science,*pp. 230-242. Springer, 2000.

Go to website*Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:***The Expressive Power and Complexity of Dynamic Process Graphs.**

Technical report SIIM-TR-A-00-07, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2000.

Show postscript | Show abstract