 |
 |
Technical Reports, Doctoral Theses, Student Theses of the Institute
Technical Reports- No. 01: Dartois, Luc; Kufleitner, Manfred; Lauser, Alexander: Rankers over Infinite Words, Technical Report No. 2010/01.
- No. 02: Kopecki, Steffen: On the Iterated Hairpin Completion, Technical Report No. 2010/02.
- No. 03: Kufleitner, Manfred; Lauser, Alexander: Partially Ordered Two-way Büchi Automata, Technical Report No. 2010/03.
- No. 04: Diekert, Volker; Kopecki, Steffen: Complexity Results and the Growths of Hairpin Completions of Regular Languages, Technical Report No. 2010/04.
- No. 05: Lewandowski, Stefan: Shortest Paths and Negative Cycle Detection in Graphs with Negative Weights - I: The Bellman-Ford-Moore Algorithm Revisited, Technical Report No. 2010/05.
- No. 06: Hoffmann, Benjamin: Comparison of Standard and Zipf-Based Document Retrieval Heuristics, Technical Report No. 2010/06.
- No. 08: Kallas, Jakub; Kufleitner, Manfred; Lauser, Alexander: First-order Fragments with Successor over Infinite Words, Technical Report No. 2010/08.
Diploma Theses (archive)- Bischoff, Bastian: Wortbegrenzung unter Involution, Diploma Thesis No. 3095, 2010.
- Debatin, Michael: SAT solving modulo nichtlinearer Theorien, Diploma Thesis No. 2, 2010.
- Klein, Kim-Manuel: Das Verhalten von Traversierenden Baumautomaten mit Marken, Diploma Thesis No. 3017, 2010.
- Thomaß, Bertram: SAT solving modulo nichtlinearer Theorien, Diploma Thesis No. 3094, 2010.
Master ThesesStudent Theses (archive)
|
|