Institute of Theoretical Computer Science
- 1:
Teaching. - 2: Research.
- 3: TheorieTag.
- 4: Members.
- 4.1:
Prof. Dr. Uwe Schöning. - 4.2: Prof. Dr. Jacobo Torán.
- 4.3: Prof. Dr. Enno Ohlebusch.
- 4.4: Waltraud Fromm.
- 4.5: Dipl.-Phys. Stefan Arnold.
- 4.6: Dipl. Inf. Adrian Balint.
- 4.7: Dipl.-Inf. Timo Beller.
- 4.8: Dipl.-Inf. Oliver Gableske.
- 4.9: M.SC.-Bioinf. Dominikus Krüger.
- 4.10: Dipl.-Inf. Adrian Kügel.
- 4.11: Dr. Markus Maucher.
- 4.12: Dipl.-Inf. Thomas Schnattinger.
- 4.13: Dipl.-Inf. Simon Straub.
- 4.14: Dipl.-Inf. Gunnar Völkel.
- 4.15: Ehemalige Mitarbeiter / Doktoranden.
- 4.15.1:
Dr. Martin Bader. - 4.15.2: Dipl.-Inf. Marcus Bombe.
- 4.15.3: Dr. Tobias Eibach.
- 4.15.4: Dipl.-Inf. Sebastian Doern.
- 4.15.5: Dipl.-Inf. Simon Gog.
- 4.15.6: Dr. Thanh Minh Hoang.
- 4.15.7: Dr. Fabian Wagner.
- 4.15.8: Dr. Henning Wunderlich.
- 4.15.1:
- 4.1:
- 5: Adresse.
- 6: Intern.
- 7: Imprint.
Dr. Thanh Minh Hoang
Interessen
- Komplexitätstheorie
- Parallele Algorithmen für linear algebraische Probleme
- Algorithmen für graphentheoretische Probleme
- Derandomisierung von Polynomgleichungen
Lehre
- Übungen: Komplexitätstheorie (SS 2006)
- Übungen: Algorithmen I (SS 2006)
- Übungen: Formale Grundlagen der Informatik (WS 2008/09)
- Seminar: Meilensteine der Informatik (WS 2008/09)
Publikationen
- Isolation of Matchings via Chinese Remaindering
Thanh Minh Hoang
ECCC Report TR10-194, 2010.
. 
On the Matching Problem for Special Graph Classes Thanh Minh Hoang 25th Annual IEEE Conference on Computational Complexity (CCC), p. 139-150, 2010. ECCC Report TR09-91, 2010
- The complexity of the inertia Thanh Minh Hoang Computational Complexity, 19(4): 559-580, 2010.
- The polynomially bounded perfect matching problem is in {NC}^2 Manindra Agrawal, Thanh Minh Hoang, and Thomas Thierauf 24th Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 4393, p. 489-499, 2007. ECCC Report TR09-91, 2006.
- On the Bipartite Unique Perfect Matching Problem
Thanh Minh Hoang, Meena Mahajan, and Thomas Thierauf
33rd International Colloquium on Automata, Languages and Programming (ICALP'06), LNCS 4051, p. 453-464, 2006.
- The Complexity of the Inertia and some Closure Properties of GapL
Thanh Minh Hoang and Thomas Thierauf
20th IEEE Conference on Computational Complexity (CCC'05), IEEE Computer Society, 28-37, 2005. - On Closure Properties of GapL
Thanh Minh Hoang and Thomas Thierauf
ECCC Report TR04-24, 2004. - On the Minimal Polynomial of a Matrix
Thanh Minh Hoang and Thomas Thierauf
International Journal of Foundations of Computer Science 15(1), 89-105, 2004. BibTeX - On the Complexity of some Problems in Linear Algebra
Thanh Minh Hoang
Ph.D. thesis, University of Ulm, 2003. - The Complexity of the Characteristic and the Minimal Polynomial
Thanh Minh Hoang and Thomas Thierauf
Theoretical Computer Science 295, 205-222, 2003.
BibTeX - The Complexity of the Inertia
Thanh Minh Hoang and Thomas Thierauf
22nd Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02),
Springer Verlag, LNCS 2556, 206-217, 2002.
BibTeX - On the Minimal Polynomial of a Matrix
Thanh Minh Hoang and Thomas Thierauf
8th Annual International Computing and Combinatorics Conference (COCOON'02),
Springer Verlag, LNCS 2387, 37-46, 2002.
BibTeX - The Complexity of the Minimal Polynomial
Thanh Minh Hoang and Thomas Thierauf
26th International Symposium on Mathematical Foundations of Computer Science (MFCS'01)
Springer Verlag, LNCS 2136, 408-420, 2001.
BibTeX - The Complexity of Verifying the Characteristic Polynomial and Testing Similarity
Thanh Minh Hoang and Thomas Thierauf
15th IEEE Conference on Computational Complexity (CCC'00), 87-95, 2000.
BibTeX