| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf |
Planarizing Gadgets for Perfect Matching do not Exist.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jochen Messner, Thomas Thierauf |
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jochen Messner, Thomas Thierauf |
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Dörn, Thomas Thierauf |
A note on the search for k elements via quantum walk. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Graph Isomorphism for K{3, 3}-free and K5-free graphs is in Log-space. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
The Complexity of the Inertia. |
Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf, Fabian Wagner |
The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Dörn, Thomas Thierauf |
The quantum query complexity of the determinant. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Wagner, Thomas Thierauf |
Reachability in K_{3, 3}-free Graphs and K_5-free Graphs is in Unambiguous Log-Space. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf |
Planar Graph Isomorphism is in Log-space. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Thomas Thierauf, Fabian Wagner |
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space. |
FCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Planar Graph Isomorphism is in Log-Space. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf, Fabian Wagner |
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
A Log-space Algorithm for Canonization of Planar Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Thomas Thierauf, Fabian Wagner |
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf (eds.) |
Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 |
Algebraic Methods in Computational Complexity |
2008 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Dörn, Thomas Thierauf |
The Quantum Complexity of Group Testing. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf, Fabian Wagner |
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf |
The Polynomially Bounded Perfect Matching Problem Is in NC 2. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf |
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. |
Algebraic Methods in Computational Complexity |
2007 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf |
07411 Executive Summary -- Algebraic Methods in Computational Complexity. |
Algebraic Methods in Computational Complexity |
2007 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Dörn, Thomas Thierauf |
The Quantum Query Complexity of Algebraic Properties. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf |
The polynomially bounded perfect matching problem is in NC^2. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Meena Mahajan, Thomas Thierauf |
On the Bipartite Unique Perfect Matching Problem. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, Thomas Thierauf (eds.) |
Algebraic Methods in Computational Complexity, 10.-15. October 2004 |
Algebraic Methods in Computational Complexity |
2005 |
DBLP BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
The Complexity of the Inertia and Some Closure Properties of GapL. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf, Thanh Minh Hoang |
On Closure Properties of GapL |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
On The Minimal Polynomial Of A Matrix. |
Int. J. Found. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
Erratum: On The Minimal Polynomial Of A Matrix. |
Int. J. Found. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, Thomas Thierauf |
04421 Abstracts Collection - Algebraic Methods in Computational Complexity. |
Algebraic Methods in Computational Complexity |
2004 |
DBLP BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
The complexity of the characteristic and the minimal polynomial. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
On the Minimal Polynomial of a Matrix. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
The Complexity of the Inertia. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
The Complexity of the Minimal Polynomial |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
The Complexity of the Minimal Polynomial. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Formula Isomorphism Problem. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf |
The Computational Complexity of Equivalence and Isomorphism Problems |
|
2000 |
DOI RDF |
|
| 1 | Thanh Minh Hoang, Thomas Thierauf |
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. |
Chicago J. Theor. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Thomas Thierauf |
The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits. |
Chicago J. Theor. Comput. Sci. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Jim Kadin, Thomas Thierauf |
Functions Computable with Nonadaptive Queries to NP. |
Theory Comput. Syst. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, Thomas Thierauf |
Nonrelativizing Separations. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Satisfiability Problem for Probabilistic Ordered Branching Programs. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Satisfiability Problem for Probabilistic Ordered Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf |
Threshold Computation and Cryptographic Security. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf |
The Isomorphismproblem for One-Time-Only Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Boolean Isomorphism Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Richard Beigel, Thomas Thierauf |
Modulo Information from Nonadaptive Queries to NP |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Thomas Thierauf, Seinosuke Toda, Osamu Watanabe |
On Sets Bounded Truth-Table Reducible to P-Selective Sets. |
ITA |
1996 |
DBLP BibTeX RDF |
|
| 1 | Yenjo Han, Thomas Thierauf |
Restricted Information from Nonadaptive Queries to NP. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Frederic Green, Thomas Thierauf |
On the Correlation of Symmetric Functions. |
Mathematical Systems Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitsunori Ogihara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe |
On Closure Properties of #P in the Context of PF ° #P. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Thomas Thierauf |
The Complexity of Generating and Checking Proffs of Membership. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Boolean Isomorphism Problem. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
Boolean isomorphism problem, one-round interactive proof, NP oracle, computational complexity, computational complexity, learning theory, Boolean formulas, polynomial hierarchy, equivalence queries |
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
multivalued functions, NPMV functions, coNPMV, complete functions, query hierarchy, functional analogue, Boolean hierarchy, computational complexity, complexity, multivalued logic, polynomial time hierarchy |
| 1 | Manindra Agrawal, Richard Beigel, Thomas Thierauf |
Pinpointing Computation with Modular Queries in the Boolean Hierarchy. |
FSTTCS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang |
Nondeterministically Selective Sets. |
Int. J. Found. Comput. Sci. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Yenjo Han, Thomas Thierauf |
Restricted Information from Nonadaptive Queries to NP. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran |
A Note on SpanP Functions. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf, Seinosuke Toda, Osamu Watanabe |
On Closure Properties of GapP. |
Computational Complexity |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Thomas Thierauf |
Complexity-Restricted Advice Functions. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf, Seinosuke Toda, Osamu Watanabe |
On Sets Bounded Truth-Table Reducible to P-selective Sets. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Jim Kadin, Thomas Thierauf |
On Functions Computable with Nonadaptive Queries to NP. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang |
Selectivity. |
ICCI |
1993 |
DBLP BibTeX RDF |
|
| 1 | Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf |
Threshold Computation and Cryptographic Security. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe |
On Closure Properties of #P in the Context of PF°#P. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf |
Reductions to Sets of Low Information Content. |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf |
Reductions to Sets of Low Information Content. |
Complexity Theory: Current Research |
1992 |
DBLP BibTeX RDF |
|
| 1 | Thomas Thierauf |
NP-uniforme Komplexitätsklassen. |
|
1990 |
RDF |
|
| 1 | Johannes Köbler, Thomas Thierauf |
Complexity Classes with Advice. |
Structure in Complexity Theory Conference |
1990 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")