50 Jahre Uni Lübeck

Prof. Dr. Maciej Liśkiewicz

Veröffentlichungen


Editorium

  • Maciej Liskiewicz, Rüdiger Reischuk:
    Proceedings of the 15th International Symposium On Fundamentals of Computation Theory (FCT), Lübeck 2005.
    Band 3623 von Lecture Notes in Computer Science, Springer, 2005.
    Website anzeigen
  • Maciej Liskiewicz, Rüdiger Reischuk, Guest Eds.:
    Theory of Computing Systems.
    Band 41/2 von Theory of Computing Systems, Springer, 2007.
    Website anzeigen

Konferenzbeiträge

  • Krzysztof Lorys, Maciej Liskiewicz:
    Two applications of Fürer's counter to one-tape nondeterministic TMs,
    In Proc. Mathematical Foundations of Computer Science (MFCS 88), Band 324 von Lecture Notes in Computer Science, S. 445-453. Springer, 1988.
    Website anzeigen
  • Maciej Liskiewicz, Krzysztof Lorys:
    On reversal complexity for alternating TMs.
    In Proc. 30th Annual IEEE Symposium on the Foundations of Computer Science (FOCS 89), S. 618-623. IEEE Computer Society Press, 1989.
    Website anzeigen
  • Maciej Liskiewicz, Krzysztof Lorys:
    Some time-space bounds for one-tape deterministic Turing machines.
    In Proc. Fundamentals of Computations Theory (FCT 89), Band 380 von Lecture Notes in Computer Science, S. 297-307. Springer, 1989.
    Website anzeigen
  • Maciej Liskiewicz, Rüdiger Reischuk:
    Separating the Lower Levels of the Sublogarithmic Space Hierarchy.
    In 10. GI-AFCET Symposium on Theoretical Aspects of Computer Science STACS'93, Band 665 von Lecture Notes in Computer Science, S. 16-27. Springer, 1993.
    Website anzeigen
  • Maciej Liskiewicz, Rüdiger Reischuk:
    The Complexity World below Logarithmic Space.
    In 9. Ann. IEEE - SIGACT - EATCS Symposium on Structure in Complexity Theory STRUCTURES'94, S. 64-78. IEEE Computer Society, 1994.
  • Maciej Liskiewicz, Rüdiger Reischuk:
    Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds.
    In 22. Int. Symposium on Mathematical Foundations of Computer Science MFCS'97, Band 1295 von Lecture Notes in Computer Science, S. 91-107. Springer, 1997.
    Website anzeigen
  • Maciej Liskiewicz:
    Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes.
    In Proc. 14th Symposium on Theoretical Aspects of Computer Science (STACS 1997), Band 1200 von Lecture Notes in Computer Science, S. 129-140. Springer, 1997.
    Website anzeigen
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Scheduling Dynamic Graphs.
    In 16. GI-MIMD Symposium on Theoretical Aspects of Computer Science STACS'99, Band 1563 von Lecture Notes in Computer Science, S. 383-393. Springer, 1999.
    Website anzeigen
  • 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, Band 1928 von Lecture Notes in Computer Science, S. 230-242. Springer, 2000.
    Website anzeigen
  • 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, Band 2010 von Lecture Notes in Computer Science, S. 339-352. Springer, 2001.
    Website anzeigen
  • 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), Band 2223 von Lecture Notes in Computer Science, S. 562-574. Springer, 2001.
    Website anzeigen
  • 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),, Band 2442 von Lecture Notes in Computer Science, S. 194-209. Springer, 2002.
    Website anzeigen
  • Andreas Jakoby, Maciej Liskiewicz:
    Paths Problems in Symmetric Logarithmic Space.
    In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP 2002), Band 2380 von Lecture Notes in Computer Science, S. 269-280. Springer, 2002.
    Website anzeigen
  • 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), Band 2751 von Lecture Notes in Computer Science, S. 158-170. Springer, 2003.
    Website anzeigen
  • 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, Band 2607 von Lecture Notes in Computer Science, S. 189-198. Springer, 2003.
    Website anzeigen
  • 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), Band 3329 von Lecture Notes in Computer Science, S. 137-151. Springer, 2004.
    Website anzeigen
  • 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), Band 3240 von Lecture Notes in Computer Science, S. 362-373. Springer, 2004.
    Website anzeigen
  • 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), Band 3788 von Lecture Notes in Computer Science, S. 121-135. Springer, 2005.
    Website anzeigen
  • Maciej Liskiewicz, Ulrich Wölfel:
    On the Intractability of Inverting Geometric Distortions in Watermarking Schemes.
    In Proc. 7th Information Hiding Workshop (IH 2005), Band 3727 von Lecture Notes in Computer Science, S. 176-188. Springer, 2005.
    Website anzeigen
  • Christian Hundt, Maciej Liskiewicz, Ulrich Wölfel:
    Provably Secure Steganography and the Complexity of Sampling.
    In Algorithms and Computation, Band 4288 von Lecture Notes in Computer Science, S. 754-763. Springer, 2006.
    Website anzeigen
  • Maciej Liskiewicz:
    Multiparty Computations in Non-Private Environments.
    In Information Transfer and Combinatorics, Band 4123 von Lecture Notes in Computer Science, S. 1082-1084. Springer, 2006.
    Website anzeigen
  • 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), Band 4393 von Lecture Notes in Computer Science, S. 284-295. Springer, 2007.
    Website anzeigen
  • 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, Band 4484 von Lecture Notes in Computer Science, S. 330-341. Springer, 2007.
    Website anzeigen
  • 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), Band 5162 von Lecture Notes in Computer Science, S. 395-406. Springer, 2008.
    Website anzeigen
  • Christian Hundt, Maciej Liskiewicz:
    Two-dimensional Pattern Matching with Combined Scaling and Rotation.
    In Proceedings of the 19th Symposium on Combinatorial Pattern Matching (CPM), Band 5029 von Lecture Notes in Computer Science, S. 5-17. Springer, 2008.
    Website anzeigen
  • Andreas Jacoby, Maciej Liskiewicz, Aleksander Madry:
    Susceptible Two-party Quantum Computations.
    In in Proceedings of the 2nd International Conference on Information Theoretic Security (ICITS), Band 5155 von Lecture Notes in Computer Science, S. 121-136. Springer, 2008.
    Website anzeigen
  • Benito van der Zander, Maciej Liskiewicz:
    Finding minimal d-separators in linear time and applications.
    In Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence (UAI'19), AUAI Press, 2019.
    PDF anzeigen
  • 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, Band vol. 10820 von LNCS, S. 29-60. Springer, 2018.
    Website anzeigen | Zusammenfassung anzeigen
  • Sebastian Berndt, Maciej Liskiewicz:
    Algorithm Substitution Attacks from a Steganographic Perspective.
    In Proc. 24th ACM Conference on Computer and Communications Security (CCS 2017), S. 1649-1660. ACM Press, 2017.
    Website anzeigen | Zusammenfassung anzeigen
  • Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Learning Residual Alternating Automata.
    Proc. 31st AAAI Conference on Artificial Intelligence (AAAI 2017), S. 1749-1755. AAAI Press, 2017.
    Website anzeigen | Zusammenfassung anzeigen
  • 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.
    Website anzeigen | Zusammenfassung anzeigen
  • 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, S. 387-394. ACM (Awarded Best Student Paper), 2016.
    Website anzeigen | Zusammenfassung anzeigen
  • 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), S. 1214-1222. JMLR Proceedings, 2016.
    Website anzeigen
  • 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, S. 3315-3321. AAAI Press, 2016.
    Website anzeigen
  • 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), Band 9472 von Lecture Notes in Computer Science, S. 151-162. Springer, 2015.
    Website anzeigen | Zusammenfassung anzeigen
  • 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), S. 882-891. AUAI Press, 2015.
    PDF anzeigen
  • 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, S. 3243-3249. AAAI Press / International Joint Conferences on Artificial Intelligence, 2015.
    PDF anzeigen
  • 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.
    Website anzeigen
  • 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), S. 129-136. ACM Press, 2014.
    Website anzeigen
  • 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, S. 907-916. AUAI Press, 2014.
    PDF anzeigen
  • 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, Band WP 13-01 von CTIT Workshop Proceedings, S. 159-162. , 2013.
  • Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
    Grey-Box Steganography.
    Band 6648 von Lecture Notes in Computer Science, S. 390-402. Springer Verlag, Heidelberg, in Proceedings 8. TAMC, 2011.
    Website anzeigen
  • 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), S. 681-688. AUAI Press, 2011.
    PDF anzeigen | Website anzeigen
  • Maciej Liskiewicz, Johannes Textor:
    Negative Selection Algorithms Without Generating Detectors.
    In Proceedings of the 12th annual conference on Genetic and evolutionary computation (GECCO'10), S. 1047-1054. ACM, 2010.
    PDF anzeigen | Website anzeigen | Zusammenfassung anzeigen
  • Christian Hundt, Maciej Liskiewicz:
    New Complexity Bounds for Image Matching under Rotation and Scaling.
    In Proceedings of Symposium on Combinatorial Pattern Matching (CPM), Band 5577 von Lecture Notes in Computer Science, S. 127-141. Springer, 2009.
    Website anzeigen