50 years Univerity of Lübeck

Institute for Theoretical Computer Science

Publications 2017


Proceedings

  • A. Bernstein, W. Effelsberg, F. Freiling, S. Hölldobler, H.-P. Lenhof, P. Molitor, G. Neumann, R. Reischuk, N. Schweikardt, M. Spiliopoulou, S. Süsstrunk:
    Ausgezeichnete Informatikdissertationen 2016.
    Volume 17 of Lecture Notes in Informatics, GI, 2017.

Journal articles

  • 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
  • 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

Conference papers

  • Max Bannach, Sebastian Berndt, Thorsten Ehlers:
    Jdrasil: A Modular Library for Computing Tree Decompositions.
    In International Symposium on Experimental Algorithms (SEA 2017), Volume 75 of LIPIcs, pp. 28:1--28:21. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
    Go to website | Show PDF | Show abstract
  • 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.
    Proc. 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 1749-1755. AAAI Press, 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.
  • Till Tantau:
    Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk)..
    In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), pp. 4:1--4:4. DROPS, 2017.
    Go to website | Show abstract

Technical reports

  • Martin R. Schuster, Maciej Liskiewicz:
    New Abilities and Limitations of Spectral Graph Bisection.
    Technical report 1701.01337, arXiv, 2017.
    Go to website | Show abstract

PhD theses

  • Christoph Stockhusen:
    On the Space and Circuit Complexity of Parameterized Problems.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2017.
    Supervised by: Till Tantau, Heribert Vollmer.

Masters theses

  • D. H.:
    Dreiwertige Timed-LTL-Semantik.
    Universität zu Lübeck, Institut für Softwaretechnik und Programmiersprachen, 2017.
    Supervised by: Martin Leucker, Till Tantau.
  • A. A. L.:
    Möglichkeiten und Grenzen der parallelen Berechnung von Kerneln.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2017.
    Supervised by: Till Tantau, Martin Leucker.
  • A. P.:
    SMT-based Flat Model-Checking for LTL with Counting.
    Universität zu Lübeck, Institut für Softwaretechnik und Programmiersprachen, 2017.
    Supervised by: Martin Leucker, Till Tantau.
  • J. W.:
    Differential Privacy: Choosing Parameters for Multiple Studies.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2017.
    Supervised by: Rüdiger Reischuk, Thomas Eisenbarth.

Bachelors theses

  • P. D.:
    Randomisierte Algorithmen für das Färbungsproblem.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2017.
    Supervised by: Rüdiger Reischuk, Till Tantau.
  • T. P.:
    Effiziente parallele Kernel-Algorithmen für das Vertex-Cover-Problem.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2017.
    Supervised by: Till Tantau, Ralf Möller.
  • V. R.:
    Complexity of the Subgraph Homeomorphism Problem Parameterized by Directed Treewidth.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2017.
    Supervised by: Till Tantau, Rüdiger Reischuk.
  • L. S.:
    Algorithmische Konstruktion von Primern.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2017.
    Supervised by: Till Tantau, Amir Madany.
  • L. W.:
    Lange Wege in Gittergraphen.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2017.
    Supervised by: Rüdiger Reischuk, Christian Bey.