Thomas Thierauf
Orcid: 0000-0002-2962-594XAffiliations:
- Aalen University of Applied Sciences, Germany
- University of Ulm, Germany
According to our database1,
Thomas Thierauf
authored at least 80 papers
between 1990 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
10
2
2
3
4
1
2
2
1
4
2
2
1
3
3
1
1
1
3
1
1
1
1
2
2
7
1
3
1
1
4
1
4
1
1
1
1
1
2
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Comput. Complex., June, 2024
Electron. Colloquium Comput. Complex., 2024
2022
2021
SIAM J. Comput., 2021
Comput. Complex., 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
2020
Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT.
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
2019
2017
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs.
Comput. Complex., 2017
2016
Theory Comput. Syst., 2016
Dagstuhl Reports, 2016
2015
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games.
Electron. Colloquium Comput. Complex., 2015
2014
Electron. Colloquium Comput. Complex., 2014
Electron. Colloquium Comput. Complex., 2014
Reachability in K<sub>{3, 3}</sub>-free and K<sub>5</sub>-free Graphs is in Unambiguous Logspace.
Chic. J. Theor. Comput. Sci., 2014
Proceedings of the IEEE 29th Conference on Computational Complexity, 2014
2013
Electron. Colloquium Comput. Complex., 2013
2012
Theor. Comput. Sci., 2012
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421).
Dagstuhl Reports, 2012
2011
Electron. Colloquium Comput. Complex., 2011
2010
Graph Isomorphism for K<sub>3,3</sub>-free and K<sub>5</sub>-free graphs is in Log-space.
Electron. Colloquium Comput. Complex., 2010
2009
Reachability in K<sub>3,3</sub>-free Graphs and K<sub>5</sub>-free Graphs is in Unambiguous Log-Space.
Electron. Colloquium Comput. Complex., 2009
Electron. Colloquium Comput. Complex., 2009
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009
Reachability in <i>K</i><sub>3, 3</sub>-Free Graphs and <i>K</i><sub>5</sub>-Free Graphs Is in Unambiguous Log-Space.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009
Proceedings of the Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009, 2009
Proceedings of the Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009, 2009
2008
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008
2007
Electron. Colloquium Comput. Complex., 2007
Proceedings of the STACS 2007, 2007
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007
Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007
2006
Electron. Colloquium Comput. Complex., 2006
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
2005
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005
2004
Proceedings of the Algebraic Methods in Computational Complexity, 10.-15. October 2004, 2004
2003
Theor. Comput. Sci., 2003
2001
2000
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000
Lecture Notes in Computer Science 1852, Springer, ISBN: 3-540-41032-5, 2000
1999
1998
Chic. J. Theor. Comput. Sci., 1998
Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998
1997
Electron. Colloquium Comput. Complex., 1997
1996
RAIRO Theor. Informatics Appl., 1996
Electron. Colloquium Comput. Complex., 1996
Electron. Colloquium Comput. Complex., 1996
Proceedings of the STACS 96, 1996
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996
1995
1994
1993
Selectivity.
Proceedings of the Computing and Information, 1993
1992
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992
1990
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990