The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Seinosuke Toda: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zhi-Zhong Chen, Seinosuke Toda
    The Complexity of Selecting Maximal Solutions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:313-325 [Conf]
  2. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
    Turing Machines with few Accepting Computations and low Sets for PP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:208-215 [Conf]
  3. Johannes Köbler, Seinosuke Toda
    On the Power of Generalized MOD-Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:147-155 [Conf]
  4. 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]
  5. Seinosuke Toda, Mitsunori Ogiwara
    Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:2-12 [Conf]
  6. Jun Tarui, Seinosuke Toda
    Some Observations on the Computational Complexity of Graph Accessibility Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:18-30 [Conf]
  7. Koichi Hori, Seinosuke Toda, Hisashi Yasunaga
    Learning the Space of Word Meanings for Information Retrieval Systems. [Citation Graph (0, 0)][DBLP]
    COLING, 1986, pp:374-379 [Conf]
  8. Seinosuke Toda
    On the Computational Power of PP and +P [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:514-519 [Conf]
  9. Seinosuke Toda
    The Complexity of Finding Medians [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:778-787 [Conf]
  10. Seinosuke Toda
    Graph Isomorphism: Its Complexity and Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:341- [Conf]
  11. Richard Beigel, Jun Tarui, Seinosuke Toda
    On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:420-429 [Conf]
  12. Mitsunori Ogihara, Seinosuke Toda
    The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:585-597 [Conf]
  13. Osamu Watanabe, Seinosuke Toda
    Structural Analyses on the Complexity of Inverting Functions. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:31-38 [Conf]
  14. 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]
  15. Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda
    Space-Efficient Recognition of Sparse Self-Reducible Languages. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:262-296 [Journal]
  16. 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]
  17. Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya
    Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:3, pp:479-482 [Journal]
  18. Mitsunori Ogihara, Seinosuke Toda
    The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:061, pp:- [Journal]
  19. Zhi-Zhong Chen, Seinosuke Toda
    The Complexity of Selecting Maximal Solutions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:119, n:2, pp:231-239 [Journal]
  20. Zhi-Zhong Chen, Seinosuke Toda
    On the Complexity of Computing Optimal Solutions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:3, pp:207-220 [Journal]
  21. Seinosuke Toda
    On the Complexity of Topological Sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:5, pp:229-233 [Journal]
  22. 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]
  23. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
    Turing Machines with Few Accepting Computations and Low Sets for PP. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:272-286 [Journal]
  24. 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]
  25. Seinosuke Toda
    Sigma_2 SPACE(n) is Closed under Complement. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:35, n:2, pp:145-152 [Journal]
  26. Seinosuke Toda
    Simple Characterizations of P(#P) and Complete Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:1, pp:1-17 [Journal]
  27. Johannes Köbler, Seinosuke Toda
    On the Power of Generalized MOD-Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:1, pp:33-46 [Journal]
  28. Osamu Watanabe, Seinosuke Toda
    Structural Analysis of the Complexity of Inverse Functions. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:2, pp:203-214 [Journal]
  29. Seinosuke Toda
    On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:2, pp:68-82 [Journal]
  30. Seinosuke Toda
    PP is as Hard as the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:5, pp:865-877 [Journal]
  31. Seinosuke Toda, Mitsunori Ogiwara
    Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:316-328 [Journal]
  32. Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda
    The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:129-156 [Journal]
  33. Seinosuke Toda
    Positive Relativizations for Log Space Computability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:77, n:3, pp:221-235 [Journal]
  34. Seinosuke Toda
    Restricted Relativizations of Probablistic Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:93, n:2, pp:265-277 [Journal]
  35. Seinosuke Toda, Osamu Watanabe
    Polynomial Time 1-Turing Reductions from #PH to #P. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:100, n:1, pp:205-221 [Journal]
  36. Takayuki Nagoya, Seinosuke Toda
    Relating Complete and Partial Solution for Problems Similar to Graph Automorphism. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:584-595 [Conf]

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002