50 years Univerity of Lübeck

Institute for Theoretical Computer Science

Publications 2007


Proceedings

  • Maciej Liskiewicz, Rüdiger Reischuk, Guest Eds.:
    Theory of Computing Systems.
    Volume 41/2 of Theory of Computing Systems, Springer, 2007.
    Go to website
  • A. Bernstein, T. Dreier, S. Hölldobler, G. Hotz, K. Lohr, P. Molitor, R. Reischuk, D. Saupe, M. Spiliopoulou, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2006.
    Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2007.

Journal articles

  • Jan Arpe, Rüdiger Reischuk:
    Learning Juntas in the Presence of Noise.
    Theoretical Computer Science, 1(384):2-21, 2007.
    Go to website
  • Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau:
    Haplotyping with Missing Data via Perfect Path Phylogenies.
    Discrete and Applied Mathematics, 155:788-805, 2007.
    Show abstract
  • Markus Hinkelmann, Andreas Jakoby:
    Communications in unknown networks: Preserving the secret of topology.
    Theoretical Computer Science, 384(2-3):184-200, 2007.
    Show abstract
  • Bodo Manthey, Rüdiger Reischuk:
    Smoothed Analysis of Binary Search Trees.
    Theoretical Computer Science, 378(3):292-315, 2007.
    Go to website | Show abstract
  • Till Tantau:
    Logspace Optimization Problems and Their Approximability Properties.
    Theory of Computing Systems, 41(2):327-350, 2007.
    Show abstract

Conference papers

  • Jan Arpe, Rüdiger Reischuk:
    When Does Greedy Learning of Relevant Attributes Succeed? - A Fourier-based Characterization.
    In 13th Annual International Conference, Computing and Combinatorics, COCOON 2007, Volume 4598 of Lecture Notes in Computer Science, pp. 296-306. Springer, 2007.
    Go to website
  • Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe:
    On the Complexity of Kings.
    In Proceedings of FCT 2007, Volume 4639 of Lecture Notes in Computer Science, pp. 328--340. Springer, 2007.
    Show abstract
  • Markus Hinkelmann, Andreas Jakoby, Peer Stechert:
    t-Private and Secure Auctions.
    In 4th International Conference on Theory and Applications of Models of Computation (TAMC 2007), Volume 4484 of Lecture Notes in Computer Science, pp. 486-498. Springer, 2007.
  • 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
  • Andreas Jakoby, Till Tantau:
    Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.
    In Proceedings of the 27th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2007), Volume 4855 of Lecture Notes in Computer Science, pp. 216-227. Springer, 2007.
    Show abstract
  • Rüdiger Reischuk:
    Designing Boolean Sorting Circuits with Optimal Average Delay.
    In Oberwolfach Reports X, Mathematisches Forschungsinstitut Oberwolfach, 2007.
  • Matthias Schmalz, Hagen Völzer, Daniele Varacca:
    Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths.
    In Proceedings of the 27th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2007), Volume 4855 of Lecture Notes in Computer Science, pp. 532-543. Springer, 2007.
    Show abstract
  • Johannes Textor, Jürgen Westermann:
    Modeling Migration, Compartmentalization, and Exit of Naive T Cells in Lymph Nodes Without Chemotaxis.
    In 6th International Conference on Artificial Immune Systems (ICARIS 2007), Volume 4628 of Lecture Notes in Computer Science, pp. 228-239. Springer, 2007.
    Show PDF | Go to website | Show abstract

Technical reports

  • Bodo Manthey, Till Tantau:
    Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.
    Technical report ECCC-TR07-039, Electronic Colloquium on Computational Complexity, 2007.
    Go to website | Show abstract

Masters theses

  • Annika Hansen:
    Modellierung der Regulation in E.coli durch Petri-Netze.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2007.
    Supervised by: Rüdiger Reischuk.
  • Matthias Schmalz:
    Extensions of an Algorithm for Generalised Fair Model Checking.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2007.
    Supervised by: Rüdiger Reischuk.
  • Michael Elberfeld:
    Komplexität von Haplotypisierung mittels perfekten Phylogenien und kleinsten Haplotypmengen.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2007.
    Supervised by: Till Tantau, Hans-Martin Teichert.
    Show PDF
  • Christoph Reineke:
    Optimierung von Reload-Strategien im Web durch Komponenten-Tracking.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2007.
    Supervised by: Dirk Kukulen, Maciej Liskiewicz.

Bachelors theses

  • Björn Hansen:
    Partikelsimulation einer Reaktions-Diffusions-Gleichung.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2007.
    Supervised by: Till Tantau, Dirk Langemann.
    Show PDF | Show abstract
  • Steve Gießer:
    Implementierung und Anwendung von Algorithmen zur Orientierung von Protein-Protein-Interaktionsnetzwerken.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2007.
    Supervised by: Till Tantau, Christian Claussen.