The SCEAS System
| |||||||

## Search the dblp DataBase
Thomas Thierauf:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Manindra Agrawal, Thomas Thierauf
**The Satisfiability Problem for Probabilistic Ordered Branching Programs.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1998, pp:81-0 [Conf] - Harry Buhrman, Lance Fortnow, Thomas Thierauf
**Nonrelativizing Separations.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1998, pp:8-12 [Conf] - Harry Buhrman, Jim Kadin, Thomas Thierauf
**On Functions Computable with Nonadaptive Queries to NP.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1994, pp:43-52 [Conf] - Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
**Complements of Multivalued Functions.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:260-269 [Conf] - Yenjo Han, Thomas Thierauf
**Restricted Information from Nonadaptive Queries to NP.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:206-213 [Conf] - Thanh Minh Hoang, Thomas Thierauf
**The Complexity of Verifying the Characteristic Polynomial and Testing Similarity.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:87-0 [Conf] - Thanh Minh Hoang, Thomas Thierauf
**The Complexity of the Inertia and Some Closure Properties of GapL.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:28-37 [Conf] - Johannes Köbler, Thomas Thierauf
**Complexity Classes with Advice.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:305-315 [Conf] - Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
**On Closure Properties of #P in the Context of PF°#P.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:139-146 [Conf] - Thanh Minh Hoang, Thomas Thierauf
**On the Minimal Polynomial of a Matrix.**[Citation Graph (0, 0)][DBLP] COCOON, 2002, pp:37-46 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Complexity Theory: Current Research, 1992, pp:1-46 [Conf] - Harry Buhrman, Lance Fortnow, Thomas Thierauf
**04421 Abstracts Collection - Algebraic Methods in Computational Complexity.**[Citation Graph (0, 0)][DBLP] Algebraic Methods in Computational Complexity, 2004, pp:- [Conf] - Manindra Agrawal, Thomas Thierauf
**The Boolean Isomorphism Problem.**[Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:422-430 [Conf] - Manindra Agrawal, Richard Beigel, Thomas Thierauf
**Pinpointing Computation with Modular Queries in the Boolean Hierarchy.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1996, pp:322-334 [Conf] - Thanh Minh Hoang, Thomas Thierauf
**The Complexity of the Inertia.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2002, pp:206-217 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ICALP, 1992, pp:162-173 [Conf] - Thanh Minh Hoang, Meena Mahajan, Thomas Thierauf
**On the Bipartite Unique Perfect Matching Problem.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:453-464 [Conf] - Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang
**Selectivity.**[Citation Graph (0, 0)][DBLP] ICCI, 1993, pp:55-59 [Conf] - Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
**Threshold Computation and Cryptographic Security.**[Citation Graph (0, 0)][DBLP] ISAAC, 1993, pp:230-239 [Conf] - Thanh Minh Hoang, Thomas Thierauf
**The Complexity of the Minimal Polynomial.**[Citation Graph (0, 0)][DBLP] MFCS, 2001, pp:408-420 [Conf] - Harry Buhrman, Thomas Thierauf
**The Complexity of Generating and Checking Proffs of Membership.**[Citation Graph (0, 0)][DBLP] STACS, 1996, pp:75-86 [Conf] - Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
**On Sets Bounded Truth-Table Reducible to P-selective Sets.**[Citation Graph (0, 0)][DBLP] STACS, 1994, pp:427-438 [Conf] - Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf
**The Polynomially Bounded Perfect Matching Problem Is in NC**[Citation Graph (0, 0)][DBLP]^{2}. STACS, 2007, pp:489-499 [Conf] - Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
**On Closure Properties of GapP.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1994, v:4, n:, pp:242-261 [Journal] - Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
**Complements of Multivalued Functions.**[Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal] - Thomas Thierauf
**The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits.**[Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 1998, v:1998, n:, pp:- [Journal] - Thanh Minh Hoang, Thomas Thierauf
**The Complexity of the Minimal Polynomial**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:28, pp:- [Journal] - Thomas Thierauf, Thanh Minh Hoang
**On Closure Properties of GapL**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:024, pp:- [Journal] - Thomas Thierauf
**The Isomorphismproblem for One-Time-Only Branching Programs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:40, pp:- [Journal] - Yenjo Han, Thomas Thierauf
**Restricted Information from Nonadaptive Queries to NP.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1996, v:128, n:2, pp:119-125 [Journal] - Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang
**Nondeterministically Selective Sets.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1995, v:6, n:4, pp:403-416 [Journal] - Thanh Minh Hoang, Thomas Thierauf
**On The Minimal Polynomial Of A Matrix.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2004, v:15, n:1, pp:89-105 [Journal] - Thanh Minh Hoang, Thomas Thierauf
**Erratum: On The Minimal Polynomial Of A Matrix.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2004, v:15, n:4, pp:685- [Journal] - Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran
**A Note on SpanP Functions.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:51, n:1, pp:7-10 [Journal] - Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
**On Sets Bounded Truth-Table Reducible to P-Selective Sets.**[Citation Graph (0, 0)][DBLP] ITA, 1996, v:30, n:2, pp:135-154 [Journal] - Mitsunori Ogihara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
**On Closure Properties of #P in the Context of PF ° #P.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1996, v:53, n:2, pp:171-179 [Journal] - Harry Buhrman, Jim Kadin, Thomas Thierauf
**Functions Computable with Nonadaptive Queries to NP.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 1998, v:31, n:1, pp:77-92 [Journal] - Jin-yi Cai, Frederic Green, Thomas Thierauf
**On the Correlation of Symmetric Functions.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1996, v:29, n:3, pp:245-258 [Journal] - Manindra Agrawal, Thomas Thierauf
**The Formula Isomorphism Problem.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:3, pp:990-1009 [Journal] - Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
**Threshold Computation and Cryptographic Security.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:1, pp:59-78 [Journal] - Johannes Köbler, Thomas Thierauf
**Complexity-Restricted Advice Functions.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:2, pp:261-275 [Journal] - Thanh Minh Hoang, Thomas Thierauf
**The complexity of the characteristic and the minimal polynomial.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:, pp:205-222 [Journal] - Sebastian Dörn, Thomas Thierauf
**The Quantum Query Complexity of Algebraic Properties.**[Citation Graph (0, 0)][DBLP] FCT, 2007, pp:250-260 [Conf] **Planar Graph Isomorphism is in Log-Space.**[Citation Graph (, )][DBLP]**07411 Executive Summary -- Algebraic Methods in Computational Complexity.**[Citation Graph (, )][DBLP]**07411 Abstracts Collection -- Algebraic Methods in Computational Complexity.**[Citation Graph (, )][DBLP]**Reachability in**[Citation Graph (, )][DBLP]*K*_{3, 3}-Free Graphs and*K*_{5}-Free Graphs Is in Unambiguous Log-Space.**Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space.**[Citation Graph (, )][DBLP]**The Quantum Complexity of Group Testing.**[Citation Graph (, )][DBLP]**The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace.**[Citation Graph (, )][DBLP]**The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace**[Citation Graph (, )][DBLP]**A Log-space Algorithm for Canonization of Planar Graphs**[Citation Graph (, )][DBLP]**The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace.**[Citation Graph (, )][DBLP]**The polynomially bounded perfect matching problem is in NC^2.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.008secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |