default search action
Kazumasa Nomura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j19]Kazumasa Nomura, Paul M. Terwilliger:
Spin models and distance-regular graphs of q-Racah type. Eur. J. Comb. 124: 104069 (2025) - 2021
- [j18]Kazumasa Nomura, Paul M. Terwilliger:
Leonard pairs, spin models, and distance-regular graphs. J. Comb. Theory A 177: 105312 (2021)
2010 – 2019
- 2013
- [j17]Takahiro Sasaki, Tomoyuki Nakabayashi, Kazumasa Nomura, Kazuhiko Ohno, Toshio Kondo:
Design and evaluation of fine-grain-mode transition method based on dynamic memory access analysing for variable stages pipeline processor. IET Comput. Digit. Tech. 7(1): 41-47 (2013)
2000 – 2009
- 2005
- [j16]Brian Curtin
, Kazumasa Nomura:
1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs. J. Comb. Theory B 93(2): 279-302 (2005) - 2000
- [j15]Hiroshi Sasaki, Kazumasa Nomura, Hiroshi Nakajima, Koji Kobayashi:
Tracking of Moving Object by Phase-only Correlation. J. Robotics Mechatronics 12(5): 541-544 (2000)
1990 – 1999
- 1999
- [j14]Kazumasa Nomura:
Spin Models and Bose-Mesner Algebras. Eur. J. Comb. 20(7): 691-700 (1999) - [j13]Kazumasa Nomura:
Type II Matrices of Size Five. Graphs Comb. 15(1): 79-92 (1999) - [j12]Brian Curtin
Some Formulas for Spin Models on Distance-Regular Graphs. J. Comb. Theory B 75(2): 206-236 (1999) - 1996
- [j11]Kazumasa Nomura:
Spin Models on Triangle-Free Connected Graphs. J. Comb. Theory B 67(2): 284-295 (1996) - 1995
- [j10]Kazumasa Nomura:
Spin Models with an Eigenvalue of Small Multiplicity. J. Comb. Theory A 71(2): 293-315 (1995) - 1994
- [j9]Kazumasa Nomura:
Homogeneous Graphs and Regular Near Polygons. J. Comb. Theory B 60(1): 63-71 (1994) - 1993
- [j8]Kazumasa Nomura:
Some Inequalities in Distance-Regular Graphs. J. Comb. Theory B 58(2): 243-247 (1993) - 1990
- [j7]Kazumasa Nomura:
Distance-regular graphs of hamming type. J. Comb. Theory B 50(2): 160-167 (1990) - [j6]Kazumasa Nomura:
Intersection diagrams of distance-biregular graphs. J. Comb. Theory B 50(2): 214-221 (1990)
1980 – 1989
- 1989
- [j5]Kazumasa Nomura:
On local structure of a distance-regular graph of Hamming type. J. Comb. Theory B 47(1): 120-123 (1989) - 1988
- [j4]Alan Boshier, Kazumasa Nomura:
A remark on the intersection arrays of distance-regular graphs. J. Comb. Theory B 44(2): 147-153 (1988) - 1987
- [j3]Hikoe Enomoto, Peter Frankl, Noboru Ito, Kazumasa Nomura:
Codes with given distances. Graphs Comb. 3(1): 25-38 (1987) - [j2]Kazumasa Nomura:
An inequality between intersection numbers of a distance-regular graph. J. Comb. Theory B 43(3): 358-359 (1987) - 1984
- [j1]Teluhiko Hilano, Kazumasa Nomura:
Distance degree regular graphs. J. Comb. Theory B 37(1): 96-100 (1984)
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-10-04 20:04 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: