default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShunichi Toida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1969
[b1]Shunichi Toida:
A Characterization of Biplanar Graphs. University of Illinois Urbana-Champaign, USA, 1969
Journal Articles
- 1994
- [j8]Nageswara S. V. Rao
, Shunichi Toida:
On Polynomial-Time Testable Combinational Circuits. IEEE Trans. Computers 43(11): 1298-1308 (1994) - 1982
- [j7]Hideo Fujiwara, Shunichi Toida:
The Complexity of Fault Detection Problems for Combinational Logic Circuits. IEEE Trans. Computers 31(6): 555-560 (1982) - 1981
- [j6]Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida:
On Minimal Test Sets for Locating Single Link Failures in Networks. IEEE Trans. Computers 30(3): 182-190 (1981) - 1977
- [j5]Shunichi Toida:
A note on Ádám's conjecture. J. Comb. Theory B 23(2-3): 239-246 (1977) - 1976
- [j4]Shunichi Toida:
System Diagnosis and Redundant Tests. IEEE Trans. Computers 25(11): 1167-1170 (1976) - 1975
- [j3]Tiko Kameda, Shunichi Toida, F. J. Allan:
A Diagnosing Algorithm for Networks. Inf. Control. 29(2): 141-148 (1975) - [j2]F. J. Allan, Tiko Kameda, Shunichi Toida:
An Approach to the Diagnosability Analysis of a System. IEEE Trans. Computers 24(10): 1040-1042 (1975) - 1973
- [j1]Shunichi Toida:
Generation of all Cutsets of a Bipath Network. IEEE Trans. Commun. 21(12): 1414-1417 (1973)
Conference and Workshop Papers
- 2006
- [c6]Chutima Boonthum, Shunichi Toida, Irwin B. Levinstein:
Preposition Senses: Generalized Disambiguation Model. CICLing 2006: 196-207 - 1993
- [c5]Shunichi Toida:
Revisiting shift register realization for ease of test generation and testing. VTS 1993: 151-153 - 1992
- [c4]Nageswara S. V. Rao, Shunichi Toida:
Computational Complexity of Test-Point Insertions and Decompositions. VLSI Design 1992: 233-238 - [c3]Shunichi Toida, Nageswara S. V. Rao:
On test generation for combinational circuits consisting of AND and EXOR gates. VTS 1992: 113-118 - 1991
- [c2]Nageswara S. V. Rao, Shunichi Toida:
On polynomial-time testable classes of combinational circuits. VTS 1991: 172-177 - 1973
- [c1]Tiko Kameda, Shunichi Toida:
Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract). SWAT 1973: 12-15
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
