Learning the Space of Word Meanings for Information Retrieval Systems. - Koichi Hori; Seinosuke Toda; Hisashi Yasunaga (COLING, 1986)

Sigma_2 SPACE(n) is Closed under Complement. - Seinosuke Toda (J. Comput. Syst. Sci., 1987)

On the Computational Power of PP and +P - Seinosuke Toda (FOCS, 1989)

The Complexity of Finding Medians - Seinosuke Toda (FOCS, 1990)

Structural Analyses on the Complexity of Inverting Functions. - Osamu Watanabe 001; Seinosuke Toda (SIGAL International Symposium on Algorithms, 1990)

On the Complexity of Topological Sorting. - Seinosuke Toda (Inf. Process. Lett., 1990)

Positive Relativizations for Log Space Computability. - Seinosuke Toda (Theor. Comput. Sci., 1990)

On the Complexity of Computing Optimal Solutions. - Zhi-Zhong Chen; Seinosuke Toda (Int. J. Found. Comput. Sci., 1991)

On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets. - Seinosuke Toda (Math. Syst. Theory, 1991)

PP is as Hard as the Polynomial-Time Hierarchy. - Seinosuke Toda (SIAM J. Comput., 1991)

On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. - Richard Beigel; Jun Tarui; Seinosuke Toda (ISAAC, 1992)

Turing Machines with Few Accepting Computations and Low Sets for PP. - Johannes Köbler; Uwe Schöning; Seinosuke Toda; Jacobo Torán (J. Comput. Syst. Sci., 1992)

Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. - Seinosuke Toda; Mitsunori Ogiwara (SIAM J. Comput., 1992)

Restricted Relativizations of Probablistic Polynomial Time. - Seinosuke Toda (Theor. Comput. Sci., 1992)

Polynomial Time 1-Turing Reductions from #PH to #P. - Seinosuke Toda; Osamu Watanabe 001 (Theor. Comput. Sci., 1992)

Structural Analysis of the Complexity of Inverse Functions. - Osamu Watanabe 001; Seinosuke Toda (Math. Syst. Theory, 1993)

Space-Efficient Recognition of Sparse Self-Reducible Languages. - Lane A. Hemaspaandra; Mitsunori Ogihara; Seinosuke Toda (Comput. Complex., 1994)

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

Simple Characterizations of P(#P) and Complete Problems. - Seinosuke Toda (J. Comput. Syst. Sci., 1994)

The Complexity of Selecting Maximal Solutions - Zhi-Zhong Chen; Seinosuke Toda (Inf. Comput., 1995)

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 Power of Generalized MOD-Classes. - Johannes Köbler; Seinosuke Toda (Math. Syst. Theory, 1996)

Some Observations on the Computational Complexity of Graph Accessibility Problem. - Jun Tarui; Seinosuke Toda (COCOON, 1999)

Graph Isomorphism: Its Complexity and Algorithms (Abstract). - Seinosuke Toda (FSTTCS, 1999)

The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs - Mitsunori Ogihara; Seinosuke Toda (Electron. Colloquium Comput. Complex., 2001)

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. - Maciej Liskiewicz; Mitsunori Ogihara; Seinosuke Toda (Theor. Comput. Sci., 2003)

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. - Ryuhei Uehara; Seinosuke Toda; Takayuki Nagoya (Discret. Appl. Math., 2005)

Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size. - Seinosuke Toda (IEICE Trans. Inf. Syst., 2006)

Relating Complete and Partial Solution for Problems Similar to Graph Automorphism. - Takayuki Nagoya; Seinosuke Toda (MFCS, 2007)

Colored Hypergraph Isomorphism is Fixed Parameter Tractable. - Vikraman Arvind; Bireswar Das; Johannes Köbler; Seinosuke Toda (Electron. Colloquium Comput. Complex., 2009)

Computational complexity of computing a partial solution for the Graph Automorphism problems. - Takayuki Nagoya; Seinosuke Toda (Theor. Comput. Sci., 2009)