 | 2009 |
|---|
| 61 |       | Thomas Thierauf,
Fabian Wagner:
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space.
FCT 2009: 323-334 |
| 60 | | 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: 145-156 |
| 59 | | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar,
Thomas Thierauf,
Fabian Wagner:
Planar Graph Isomorphism is in Log-Space.
IEEE Conference on Computational Complexity 2009: 203-214 |
| 58 | | Sebastian Dörn,
Thomas Thierauf:
The quantum query complexity of the determinant.
Inf. Process. Lett. 109(6): 325-328 (2009) |
| 2008 |
|---|
| 57 |  | Manindra Agrawal,
Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 56 | | Sebastian Dörn,
Thomas Thierauf:
The Quantum Complexity of Group Testing.
SOFSEM 2008: 506-518 |
| 55 | | Thomas Thierauf,
Fabian Wagner:
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace.
STACS 2008: 633-644 |
| 54 | | Thomas Thierauf,
Fabian Wagner:
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
CoRR abs/0802.2825: (2008) |
| 53 | | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar,
Thomas Thierauf,
Fabian Wagner:
A Log-space Algorithm for Canonization of Planar Graphs
CoRR abs/0809.2319: (2008) |
| 2007 |
|---|
| 52 | | Manindra Agrawal,
Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity.
Algebraic Methods in Computational Complexity 2007 |
| 51 | | Manindra Agrawal,
Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
07411 Executive Summary -- Algebraic Methods in Computational Complexity.
Algebraic Methods in Computational Complexity 2007 |
| 50 | | Sebastian Dörn,
Thomas Thierauf:
The Quantum Query Complexity of Algebraic Properties.
FCT 2007: 250-260 |
| 49 | | Manindra Agrawal,
Thanh Minh Hoang,
Thomas Thierauf:
The Polynomially Bounded Perfect Matching Problem Is in NC 2.
STACS 2007: 489-499 |
| 48 | | Thomas Thierauf,
Fabian Wagner:
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace.
Electronic Colloquium on Computational Complexity (ECCC) 14(068): (2007) |
| 2006 |
|---|
| 47 | | Thanh Minh Hoang,
Meena Mahajan,
Thomas Thierauf:
On the Bipartite Unique Perfect Matching Problem.
ICALP (1) 2006: 453-464 |
| 46 | | Manindra Agrawal,
Thanh Minh Hoang,
Thomas Thierauf:
The polynomially bounded perfect matching problem is in NC^2.
Electronic Colloquium on Computational Complexity (ECCC) 13(129): (2006) |
| 2005 |
|---|
| 45 | | Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
Algebraic Methods in Computational Complexity, 10.-15. October 2004
IBFI, Schloss Dagstuhl, Germany 2005 |
| 44 | | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of the Inertia and Some Closure Properties of GapL.
IEEE Conference on Computational Complexity 2005: 28-37 |
| 2004 |
|---|
| 43 | | Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
04421 Abstracts Collection - Algebraic Methods in Computational Complexity.
Algebraic Methods in Computational Complexity 2004 |
| 42 | | Thomas Thierauf,
Thanh Minh Hoang:
On Closure Properties of GapL
Electronic Colloquium on Computational Complexity (ECCC)(024): (2004) |
| 41 | | Thanh Minh Hoang,
Thomas Thierauf:
On The Minimal Polynomial Of A Matrix.
Int. J. Found. Comput. Sci. 15(1): 89-105 (2004) |
| 40 | | Thanh Minh Hoang,
Thomas Thierauf:
Erratum: On The Minimal Polynomial Of A Matrix.
Int. J. Found. Comput. Sci. 15(4): 685 (2004) |
| 2003 |
|---|
| 39 | | Thanh Minh Hoang,
Thomas Thierauf:
The complexity of the characteristic and the minimal polynomial.
Theor. Comput. Sci. 295: 205-222 (2003) |
| 2002 |
|---|
| 38 | | Thanh Minh Hoang,
Thomas Thierauf:
On the Minimal Polynomial of a Matrix.
COCOON 2002: 37-46 |
| 37 | | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of the Inertia.
FSTTCS 2002: 206-217 |
| 2001 |
|---|
| 36 | | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of the Minimal Polynomial.
MFCS 2001: 408-420 |
| 35 | | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of the Minimal Polynomial
Electronic Colloquium on Computational Complexity (ECCC) 8(28): (2001) |
| 2000 |
|---|
| 34 | | Thomas Thierauf:
The Computational Complexity of Equivalence and Isomorphism Problems
Springer 2000 |
| 33 | | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity.
IEEE Conference on Computational Complexity 2000: 87- |
| 32 | | Manindra Agrawal,
Thomas Thierauf:
The Formula Isomorphism Problem.
SIAM J. Comput. 30(3): 990-1009 (2000) |
| 1999 |
|---|
| 31 | | Stephen A. Fenner,
Frederic Green,
Steven Homer,
Alan L. Selman,
Thomas Thierauf,
Heribert Vollmer:
Complements of Multivalued Functions.
Chicago J. Theor. Comput. Sci. 1999: (1999) |
| 1998 |
|---|
| 30 | | Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
Nonrelativizing Separations.
IEEE Conference on Computational Complexity 1998: 8-12 |
| 29 | | Manindra Agrawal,
Thomas Thierauf:
The Satisfiability Problem for Probabilistic Ordered Branching Programs.
IEEE Conference on Computational Complexity 1998: 81- |
| 28 | | Thomas Thierauf:
The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits.
Chicago J. Theor. Comput. Sci. 1998: (1998) |
| 27 | | Harry Buhrman,
Jim Kadin,
Thomas Thierauf:
Functions Computable with Nonadaptive Queries to NP.
Theory Comput. Syst. 31(1): 77-92 (1998) |
| 1997 |
|---|
| 26 | | Manindra Agrawal,
Thomas Thierauf:
The Satisfiability Problem for Probabilistic Ordered Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 4(60): (1997) |
| 25 | | Yenjo Han,
Lane A. Hemaspaandra,
Thomas Thierauf:
Threshold Computation and Cryptographic Security.
SIAM J. Comput. 26(1): 59-78 (1997) |
| 1996 |
|---|
| 24 | | Manindra Agrawal,
Thomas Thierauf:
The Boolean Isomorphism Problem.
FOCS 1996: 422-430 |
| 23 | | Manindra Agrawal,
Richard Beigel,
Thomas Thierauf:
Pinpointing Computation with Modular Queries in the Boolean Hierarchy.
FSTTCS 1996: 322-334 |
| 22 | | Stephen A. Fenner,
Frederic Green,
Steven Homer,
Alan L. Selman,
Thomas Thierauf,
Heribert Vollmer:
Complements of Multivalued Functions.
IEEE Conference on Computational Complexity 1996: 260-269 |
| 21 | | Harry Buhrman,
Thomas Thierauf:
The Complexity of Generating and Checking Proffs of Membership.
STACS 1996: 75-86 |
| 20 | | Manindra Agrawal,
Richard Beigel,
Thomas Thierauf:
Modulo Information from Nonadaptive Queries to NP
Electronic Colloquium on Computational Complexity (ECCC) 3(1): (1996) |
| 19 | | Manindra Agrawal,
Thomas Thierauf:
The Boolean Isomorphism Problem
Electronic Colloquium on Computational Complexity (ECCC) 3(32): (1996) |
| 18 | | Thomas Thierauf:
The Isomorphismproblem for One-Time-Only Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 3(40): (1996) |
| 17 | | Thomas Thierauf,
Seinosuke Toda,
Osamu Watanabe:
On Sets Bounded Truth-Table Reducible to P-Selective Sets.
ITA 30(2): 135-154 (1996) |
| 16 | | Yenjo Han,
Thomas Thierauf:
Restricted Information from Nonadaptive Queries to NP.
Inf. Comput. 128(2): 119-125 (1996) |
| 15 | | Mitsunori Ogihara,
Thomas Thierauf,
Seinosuke Toda,
Osamu Watanabe:
On Closure Properties of #P in the Context of PF ° #P.
J. Comput. Syst. Sci. 53(2): 171-179 (1996) |
| 14 | | Jin-yi Cai,
Frederic Green,
Thomas Thierauf:
On the Correlation of Symmetric Functions.
Mathematical Systems Theory 29(3): 245-258 (1996) |
| 1995 |
|---|
| 13 | | Yenjo Han,
Thomas Thierauf:
Restricted Information from Nonadaptive Queries to NP.
Structure in Complexity Theory Conference 1995: 206-213 |
| 12 | | 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. 6(4): 403-416 (1995) |
| 1994 |
|---|
| 11 | | Thomas Thierauf,
Seinosuke Toda,
Osamu Watanabe:
On Sets Bounded Truth-Table Reducible to P-selective Sets.
STACS 1994: 427-438 |
| 10 | | Harry Buhrman,
Jim Kadin,
Thomas Thierauf:
On Functions Computable with Nonadaptive Queries to NP.
Structure in Complexity Theory Conference 1994: 43-52 |
| 9 | | Thomas Thierauf,
Seinosuke Toda,
Osamu Watanabe:
On Closure Properties of GapP.
Computational Complexity 4: 242-261 (1994) |
| 8 | | Meena Mahajan,
Thomas Thierauf,
N. V. Vinodchandran:
A Note on SpanP Functions.
Inf. Process. Lett. 51(1): 7-10 (1994) |
| 7 | | Johannes Köbler,
Thomas Thierauf:
Complexity-Restricted Advice Functions.
SIAM J. Comput. 23(2): 261-275 (1994) |
| 1993 |
|---|
| 6 | | Lane A. Hemachandra,
Albrecht Hoene,
Mitsunori Ogiwara,
Alan L. Selman,
Thomas Thierauf,
Jie Wang:
Selectivity.
ICCI 1993: 55-59 |
| 5 | | Yenjo Han,
Lane A. Hemaspaandra,
Thomas Thierauf:
Threshold Computation and Cryptographic Security.
ISAAC 1993: 230-239 |
| 4 | | 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: 139-146 |
| 1992 |
|---|
| 3 | | 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: 1-46 |
| 2 | | 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: 162-173 |
| 1990 |
|---|
| 1 | | Johannes Köbler,
Thomas Thierauf:
Complexity Classes with Advice.
Structure in Complexity Theory Conference 1990: 305-315 |
