Reinhardt, Klaus - Wilhelm-Schickard-Institut für Informatik, Universität Tübingen

• The complexity of the bigamist matching problem Klaus Reinhardt
• Ubungen zur Vorlesung Informatik III
• umgekehrt. Bei doppelten xKoordinaten erst die linken und dann die rechten Seiten behandeln.
• Ubungen zur Vorlesung Informatik III
• Ubungen zur Vorlesung Universit at T ubingen
• Ubungen zur Vorlesung Informatik III
• Uber die Multiparty-Kommunikationskomplexitat regularer Sprachen Pavel Pudlak
• Ubungen zur Vorlesung Informatik III
• Some more regular languages that are Church Rosser congruential Klaus Reinhardt
• Prufungsfach: Theoretische Grundlagen II , MKI Blatt 1 Fakultat Informatik Hochschule Reutlingen
• Reachability in Petri nets with Inhibitor arcs
• Searching Paths of Constant Bandwidth Bernd Borchert
• Searching Paths of Constant Klaus Reinhardt
• On the parameterized complexity of a generalized Rush Hour puzzle
• Strict Sequential P-completeness Klaus Reinhardt
• Finding the shore of a lake Klaus Reinhardt
• Ubungen zur Vorlesung Kryptologie
• Auszug aus dem Skript von Maciej Liskiewicz und Henning Fernau 1 Ein bisschen Informationstheorie
• Ubungen zur Vorlesung Kryptologie
• Algorithmische Geometrie Skript zur Vorlesung
• On some Recognizable Picturelanguages ? Klaus Reinhardt
• PL = p PR = q e := H(p, q) # H(q, p)
• Refining the Nonterminal Complexity of Graphcontrolled Grammars
• Correction to [Rei02] Klaus Reinhardt
• 45. Workshop f ur Komplexit atstheorie,
• Reachability in Petri Nets with Inhibitor arcs Klaus Reinhardt
• The #a = #b Pictures are Recognizable Klaus Reinhardt
• On the synchronization of semi-traces Klaus Reinhardt
• Ubungen zur Vorlesung Kryptologie
• Deterministically and Sudoku-deterministically recognizable
• Empty Alternation Klaus-Jorn Lange Klaus Reinhardt
• Counting as Method, Model and Task in Theoretical Computer Science
• On Codings of Traces Extended Abstract
• Some more regular languages that are Church Rosser congruential Klaus Reinhardt
• Visuelle Kryptographie Bernd Borchert, 26.1.06
• Ubungen zur Vorlesung Kryptologie
• Ubungen zur Vorlesung Kryptologie
• Counting and empty alternating pushdown automata Klaus Reinhardt
• A parallel context-free derivation hierarchy ? Klaus Reinhardt
• A parallel context-free derivation hierarchy ? Klaus Reinhardt
• Making Nondeterminism Unambiguous Klaus Reinhardt \Lambda
• Sorting In-Place with a Worst Case Complexity of n log n-1.3n + O(log n) Comparisons and
• Refining the Nonterminal Complexity of Graph-controlled Grammars
• Counting and empty alternating pushdown automata Klaus Reinhardt
• Hierarchies over the context-free Languages Klaus Reinhardt
• On some Recognizable Picture-languages ? Klaus Reinhardt
• On the synchronization of semi-traces? Klaus Reinhardt
• Empty Alternation ? Klaus-J"orn Lange Klaus Reinhardt
• Vorlesung Algorithmen (RN/MK/AZ) WSI fr Informatik, Universitt Tbingen 1 Algorithmen
• Ubungen zur Vorlesung Kryptologie
• Searching Paths of Constant Bandwidth Bernd Borchert and Klaus Reinhardt
• Ubungen zur Vorlesung Kryptologie
• Annahme: alle Liniensegmente haben verschiedene x und yEndkoordinaten. Algorithmusskizze
• Ubungen zur Vorlesung Universit at T ubingen
• On Codings of Traces Extended Abstract ?
• Finding the shore of a lake Klaus Reinhardt
• On the parameterized complexity of a generalized Rush Hour puzzle
• Strict Sequential P-completeness ? Klaus Reinhardt
• Sorting In-Place with a Worst Case Complexity of n log n-1.3n + O(log n) Comparisons and
• Reachability in Petri Nets with Inhibitor arcs * Klaus Reinhardt
• The #a = #b Pictures are Recognizable Klaus Reinhardt
• Making Nondeterminism Unambiguous Klaus Reinhardt*
• 1 Towards Optimal Locality in Mesh-Indexings