NP-uniforme Komplexitätsklassen. - Thomas Thierauf (1990)

Complexity Classes with Advice. - Johannes Köbler; Thomas Thierauf (SCT, 1990)

Reductions to Sets of Low Information Content. - Vikraman Arvind; Yenjo Han; Lane A. Hemachandra; Johannes Köbler; Antoni Lozano; Martin Mundhenk; Mitsunori Ogiwara; Uwe Schöning; Riccardo Silvestri; Thomas Thierauf (ICALP, 1992)

Selectivity. - Lane A. Hemachandra; Albrecht Hoene; Mitsunori Ogiwara; Alan L. Selman; Thomas Thierauf; Jie Wang 002 (ICCI, 1993)

On Closure Properties of GapP. - Thomas Thierauf; Seinosuke Toda; Osamu Watanabe 001 (Comput. Complex., 1994)

A Note on SpanP Functions. - Meena Mahajan; Thomas Thierauf; N. V. Vinodchandran (Inf. Process. Lett., 1994)

Complexity-Restricted Advice Functions. - Johannes Köbler; Thomas Thierauf (SIAM J. Comput., 1994)

Nondeterministically Selective Sets. - Lane A. Hemaspaandra; Albrecht Hoene; Ashish V. Naik; Mitsunori Ogihara; Alan L. Selman; Thomas Thierauf; Jie Wang 002 (Int. J. Found. Comput. Sci., 1995)

Pinpointing Computation with Modular Queries in the Boolean Hierarchy. - Manindra Agrawal; Richard Beigel; Thomas Thierauf (FSTTCS, 1996)

The Complexity of Generating and Checking Proffs of Membership. - Harry Buhrman; Thomas Thierauf (STACS, 1996)

Modulo Information from Nonadaptive Queries to NP - Manindra Agrawal; Richard Beigel; Thomas Thierauf (Electron. Colloquium Comput. Complex., 1996)

The Boolean Isomorphism Problem - Manindra Agrawal; Thomas Thierauf (Electron. Colloquium Comput. Complex., 1996)

The Isomorphismproblem for One-Time-Only Branching Programs - Thomas Thierauf (Electron. Colloquium Comput. Complex., 1996)

Restricted Information from Nonadaptive Queries to NP. - Yenjo Han; Thomas Thierauf (Inf. Comput., 1996)

On Sets Bounded Truth-Table Reducible to P-Selective Sets. - Thomas Thierauf; Seinosuke Toda; Osamu Watanabe 001 (RAIRO Theor. Informatics Appl., 1996)

On Closure Properties of #P in the Context of PF ° #P. - Mitsunori Ogihara; Thomas Thierauf; Seinosuke Toda; Osamu Watanabe 001 (J. Comput. Syst. Sci., 1996)

On the Correlation of Symmetric Functions. - Jin-yi Cai; Frederic Green; Thomas Thierauf (Math. Syst. Theory, 1996)

The Satisfiability Problem for Probabilistic Ordered Branching Programs - Manindra Agrawal; Thomas Thierauf (Electron. Colloquium Comput. Complex., 1997)

Threshold Computation and Cryptographic Security. - Yenjo Han; Lane A. Hemaspaandra; Thomas Thierauf (SIAM J. Comput., 1997)

Nonrelativizing Separations. - Harry Buhrman; Lance Fortnow; Thomas Thierauf (CCC, 1998)

The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits. - Thomas Thierauf (Chic. J. Theor. Comput. Sci., 1998)

Functions Computable with Nonadaptive Queries to NP. - Harry Buhrman; Jim Kadin; Thomas Thierauf (Theory Comput. Syst., 1998)

Complements of Multivalued Functions. - Stephen A. Fenner; Frederic Green; Steven Homer; Alan L. Selman; Thomas Thierauf; Heribert Vollmer (Chic. J. Theor. Comput. Sci., 1999)

The Computational Complexity of Equivalence and Isomorphism Problems - Thomas Thierauf (Springer, 2000)

The Complexity of Verifying the Characteristic Polynomial and Testing Similarity. - Thanh Minh Hoang; Thomas Thierauf (CCC, 2000)

The Formula Isomorphism Problem. - Manindra Agrawal; Thomas Thierauf (SIAM J. Comput., 2000)

The Complexity of the Minimal Polynomial - Thanh Minh Hoang; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2001)

The complexity of the characteristic and the minimal polynomial. - Thanh Minh Hoang; Thomas Thierauf (Theor. Comput. Sci., 2003)

04421 Abstracts Collection - Algebraic Methods in Computational Complexity. - Harry Buhrman; Lance Fortnow; Thomas Thierauf (Algebraic Methods in Computational Complexity, 2004)

On Closure Properties of GapL - Thomas Thierauf; Thanh Minh Hoang (Electron. Colloquium Comput. Complex., 2004)

On The Minimal Polynomial Of A Matrix. - Thanh Minh Hoang; Thomas Thierauf (Int. J. Found. Comput. Sci., 2004)

Erratum: On The Minimal Polynomial Of A Matrix. - Thanh Minh Hoang; Thomas Thierauf (Int. J. Found. Comput. Sci., 2004)

The Complexity of the Inertia and Some Closure Properties of GapL. - Thanh Minh Hoang; Thomas Thierauf (CCC, 2005)

On the Bipartite Unique Perfect Matching Problem. - Thanh Minh Hoang; Meena Mahajan; Thomas Thierauf (ICALP (1), 2006)

The polynomially bounded perfect matching problem is in NC^2. - Manindra Agrawal; Thanh Minh Hoang; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2006)

07411 Executive Summary – Algebraic Methods in Computational Complexity. - Manindra Agrawal; Harry Buhrman; Lance Fortnow; Thomas Thierauf (Algebraic Methods in Computational Complexity, 2007)

07411 Abstracts Collection – Algebraic Methods in Computational Complexity. - Manindra Agrawal; Harry Buhrman; Lance Fortnow; Thomas Thierauf (Algebraic Methods in Computational Complexity, 2007)

The Quantum Query Complexity of Algebraic Properties. - Sebastian Dörn; Thomas Thierauf (FCT, 2007)

The Polynomially Bounded Perfect Matching Problem Is in NC 2. - Manindra Agrawal; Thanh Minh Hoang; Thomas Thierauf (STACS, 2007)

The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. - Thomas Thierauf; Fabian Wagner (Electron. Colloquium Comput. Complex., 2007)

The Quantum Complexity of Group Testing. - Sebastian Dörn; Thomas Thierauf (SOFSEM, 2008)

A Log-space Algorithm for Canonization of Planar Graphs - Samir Datta; Nutan Limaye; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (CoRR, 2008)

09421 Abstracts Collection - Algebraic Methods in Computational Complexity. - Manindra Agrawal; Lance Fortnow; Thomas Thierauf; Christopher Umans (Algebraic Methods in Computational Complexity, 2009)

09421 Executive Summary - Algebraic Methods in Computational Complexity. - Manindra Agrawal; Lance Fortnow; Thomas Thierauf; Christopher Umans (Algebraic Methods in Computational Complexity, 2009)

Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space. - Thomas Thierauf; Fabian Wagner (FCT, 2009)

Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. - Samir Datta; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (FSTTCS, 2009)

Planar Graph Isomorphism is in Log-space. - Fabian Wagner; Samir Datta; Nutan Limaye; Prajakta Nimbhorkar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2009)

Reachability in K3,3-free Graphs and K5-free Graphs is in Unambiguous Log-Space. - Fabian Wagner; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2009)

The quantum query complexity of the determinant. - Sebastian Dörn; Thomas Thierauf (Inf. Process. Lett., 2009)

The Complexity of the Inertia. - Thanh Minh Hoang; Thomas Thierauf (Comput. Complex., 2010)

Graph Isomorphism for K3,3-free and K5-free graphs is in Log-space. - Samir Datta; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (Electron. Colloquium Comput. Complex., 2010)

A note on the search for k elements via quantum walk. - Sebastian Dörn; Thomas Thierauf (Inf. Process. Lett., 2010)

Planarizing Gadgets for Perfect Matching do not Exist. - Rohit Gurjar; Arpita Korwar; Jochen Messner; Simon Straub; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2011)

Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421). - Manindra Agrawal; Thomas Thierauf; Christopher Umans (Dagstuhl Reports, 2012)

A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability. - Jochen Messner; Thomas Thierauf (Theor. Comput. Sci., 2012)

On Two-Level Poset Games. - Stephen A. Fenner; Rohit Gurjar; Arpita Korwar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2013)

Exact Perfect Matching in Complete Graphs. - Rohit Gurjar; Arpita Korwar; Jochen Messner; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2013)

Counting the Number of Perfect Matchings in K5-Free Graphs. - Simon Straub; Thomas Thierauf; Fabian Wagner (CCC, 2014)

Reachability in K{3, 3}-free and K5-free Graphs is in Unambiguous Logspace. - Thomas Thierauf; Fabian Wagner (Chic. J. Theor. Comput. Sci., 2014)

Algebra in Computational Complexity (Dagstuhl Seminar 14391). - Manindra Agrawal; Valentine Kabanets; Thomas Thierauf; Christopher Umans (Dagstuhl Reports, 2014)

Deterministic Identity Testing for Sum of Read Once ABPs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2014)

Counting the Number of Perfect Matchings in K5-free Graphs. - Simon Straub; Thomas Thierauf; Fabian Wagner (Electron. Colloquium Comput. Complex., 2014)

Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. - Stephen A. Fenner; Daniel Grier; Jochen Messner; Luke Schaeffer; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2015)

Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411). - Valentine Kabanets; Thomas Thierauf; Jacobo Torán; Christopher Umans (Dagstuhl Reports, 2016)

Counting the Number of Perfect Matchings in K 5-Free Graphs. - Simon Straub; Thomas Thierauf; Fabian Wagner (Theory Comput. Syst., 2016)

Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001; Thomas Thierauf (Comput. Complex., 2017)

Guest Column: Parallel Algorithms for Perfect Matching. - Stephen A. Fenner; Rohit Gurjar; Thomas Thierauf (SIGACT News, 2017)

A deterministic parallel algorithm for bipartite perfect matching. - Stephen A. Fenner; Rohit Gurjar; Thomas Thierauf (Commun. ACM, 2019)

Linear Matroid Intersection is in Quasi-NC. - Rohit Gurjar; Thomas Thierauf (Comput. Complex., 2020)

Depth-2 QAC circuits cannot simulate quantum parity. - Daniel Padé; Stephen A. Fenner; Daniel Grier; Thomas Thierauf (CoRR, 2020)

Impossibility of Derandomizing the Isolation Lemma for all Families. - Manindra Agrawal; Rohit Gurjar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2020)

Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT. - Pranjal Dutta; Nitin Saxena 001; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2020)

A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization. - Pranjal Dutta; Nitin Saxena 001; Thomas Thierauf (ITCS, 2021)

Factorization of Polynomials Given by Arithmetic Branching Programs. - Amit Sinhababu; Thomas Thierauf (Comput. Complex., 2021)

Bipartite Perfect Matching is in Quasi-NC. - Stephen A. Fenner; Rohit Gurjar; Thomas Thierauf (SIAM J. Comput., 2021)

Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. - Rohit Gurjar; Thomas Thierauf; Nisheeth K. Vishnoi (SIAM J. Comput., 2021)

The complexity of regex crosswords. - Stephen A. Fenner; Daniel Padé; Thomas Thierauf (Inf. Comput., 2022)

The Complexity of Poset Games. - Stephen A. Fenner; Daniel Grier; Rohit Gurjar; Arpita Korwar; Thomas Thierauf (J. Graph Algorithms Appl., 2022)

Derandomizing Multivariate Polynomial Factoring for Low Degree Factors. - Pranjal Dutta; Amit Sinhababu; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2024)

Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply VP ≠q VNP. - Pranjal Dutta; Nitin Saxena 001; Thomas Thierauf (Comput. Complex., 2024)

2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs. - Rohit Gurjar; Kilian Rothmund; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2025)

Tight bounds on depth-2 QAC-circuits computing parity. - Stephen A. Fenner; Daniel Grier; Daniel Padé; Thomas Thierauf (CoRR, 2025)