default search action
Tatsuro Ito
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j17]Jing Xu, Tatsuro Ito, Shuangdong Li:
Irreducible Representations of the Terwilliger Algebra of a Tree. Graphs Comb. 37(5): 1749-1773 (2021) - [j16]Shuangdong Li, Yi-Zheng Fan, Tatsuro Ito, Masoud Karimi, Jing Xu:
The isomorphism problem of trees from the viewpoint of Terwilliger algebras. J. Comb. Theory A 177: 105328 (2021)
2010 – 2019
- 2019
- [j15]Ying-Ying Tan, Yi-Zheng Fan, Tatsuro Ito, Xiaoye Liang:
The Terwilliger algebra of the Johnson scheme J(N, D) revisited from the viewpoint of group representations. Eur. J. Comb. 80: 157-171 (2019) - 2017
- [j14]Xiaoye Liang, Ying-Ying Tan, Tatsuro Ito:
An Observation on Leonard System Parameters for the Terwilliger Algebra of the Johnson Scheme J(N, D). Graphs Comb. 33(1): 149-156 (2017)
2000 – 2009
- 2009
- [j13]Tatsuro Ito, Alexandre A. Ivanov, Akihiro Munemasa:
Preface. Eur. J. Comb. 30(3): 623-624 (2009) - [j12]Tatsuro Ito, Paul M. Terwilliger:
Distance-regular graphs and the q-tetrahedron algebra. Eur. J. Comb. 30(3): 682-697 (2009) - 2004
- [j11]Tatsuro Ito:
Designs in a coset geometry: Delsarte theory revisited. Eur. J. Comb. 25(2): 229-238 (2004) - 2001
- [c2]Kenichiro Tanabe, M. Yoshihara, Hiroshi Kameya, Shunji Mori, Sadao Omata, Tatsuro Ito:
Automatic Signature Verification Based on the Dynamic Feature of Pressure. ICDAR 2001: 1045-1049
1990 – 1999
- 1999
- [j10]Haruo Ishibashi, Tatsuro Ito, Mieko Yamada:
Terwilliger Algebras of Cyclotomic Schemes and Jacobi Sums. Eur. J. Comb. 20(5): 397-410 (1999) - [c1]Tatsuro Ito, Kenichiro Tanabe, Paul M. Terwilliger:
Some algebra related to P- and Q-polynomial association schemes. Codes and Association Schemes 1999: 167-192 - 1991
- [j9]Takuya Ikuta, Tatsuro Ito, Akihiro Munemasa:
On Pseudo-automorphisms and Fusions of an Association Scheme. Eur. J. Comb. 12(4): 317-325 (1991) - [j8]Tatsuro Ito, Akihiro Munemasa, Mieko Yamada:
Amorphous Association Schemes over the Galois Rings of Characteristic 4. Eur. J. Comb. 12(6): 513-526 (1991)
1980 – 1989
- 1989
- [j7]Eiichi Bannai, Tatsuro Ito:
On Distance-regular Graphs with Fixed Valency, IV. Eur. J. Comb. 10(2): 137-148 (1989) - 1988
- [j6]Eiichi Bannai, Tatsuro Ito:
On distance-regular graphs with fixed valency, II. Graphs Comb. 4(1): 219-228 (1988) - 1987
- [j5]Eiichi Bannai, Tatsuro Ito:
On distance-regular graphs with fixed valency. Graphs Comb. 3(1): 95-109 (1987) - 1986
- [j4]Eiichi Bannai, Tatsuro Ito:
Current research on algebraic combinatorics - Supplements to our Book, Algebraic Combinatorics I. Graphs Comb. 2(1): 287-308 (1986) - 1981
- [j3]Eiichi Bannai, Tatsuro Ito:
Regular graphs with excess one. Discret. Math. 37(2-3): 147-158 (1981) - [j2]Tatsuro Ito:
On a graph of O'Keefe and wong. J. Graph Theory 5(1): 87-94 (1981)
1970 – 1979
- 1979
- [j1]Eiichi Bannai, Tatsuro Ito:
On the spectra of certain distance-regular graphs. J. Comb. Theory B 27(3): 274-293 (1979)
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-11-15 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint