Dr. Thanh Minh Hoang
Interessen
- 碍辞尘辫濒别虫颈迟盲迟蝉迟丑别辞谤颈别
- Parallele Algorithmen f眉r linear algebraische Probleme
- Algorithmen f眉r graphentheoretische Probleme
- Derandomisierung von Polynomgleichungen
Lehre
- 脺bungen: 碍辞尘辫濒别虫颈迟盲迟蝉迟丑别辞谤颈别 (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 , 2010.
. - On the Matching Problem for Special Graph Classes Thanh Minh Hoang 25th Annual IEEE Conference on Computational Complexity (CCC), p. 139-150, 2010. , 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. , 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
, 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.- 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.
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.
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.
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.
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.