default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiwako Mishima
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Kenta Nakashima, Michiko Harayama, Miwako Mishima:
Detection of BGP Hijacking based on AS Hegemony. ICEIC 2024: 1-4- [c2]Dan Shinato, Michiko Harayama, Miwako Mishima:
Secure V2V Ad Hoc Routing Protocol Using Digital Signatures. ICEIC 2024: 1-4 - 2020
- [j19]Miwako Mishima, Nobuko Miyamoto, Masakazu Jimbo:
Partitions of the lines in PG(2n-1, s) into multifold spreads for s=3, 4. Discret. Math. 343(7): 111867 (2020)
2010 – 2019
- 2019
- [j18]Kohei Yamada, Miwako Mishima, Junya Satoh, Masakazu Jimbo:
Multifold factorizations of cyclic groups into subsets. Finite Fields Their Appl. 56: 131-149 (2019) - 2017
- [j17]Miwako Mishima, Koji Momihara:
A new series of optimal tight conflict-avoiding codes of weight 3. Discret. Math. 340(4): 617-629 (2017) - 2016
- [j16]Yiling Lin, Miwako Mishima, Masakazu Jimbo:
Optimal equi-difference conflict-avoiding codes of weight four. Des. Codes Cryptogr. 78(3): 747-776 (2016) - [j15]Chin-Mei Fu, Kuo-Ching Huang, Miwako Mishima:
Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths. Graphs Comb. 32(4): 1397-1413 (2016) - [c1]Ryosuke Nishimura, Ryo Kurachi, Kazumasa Ito, Takashi Miyasaka, Masaki Yamamoto, Miwako Mishima:
Implementation of the CAN-FD protocol in the fuzzing tool beSTORM. ICVES 2016: 1-6 - 2014
- [j14]Yiling Lin, Miwako Mishima, Junya Satoh, Masakazu Jimbo:
Optimal equi-difference conflict-avoiding codes of odd length and weight three. Finite Fields Their Appl. 26: 49-68 (2014) - 2012
- [j13]Koji Momihara, Miwako Mishima, Masakazu Jimbo:
A decomposition of the 2-design formed by the planes in AG(2n, 3). Finite Fields Their Appl. 18(5): 956-970 (2012) - 2011
- [j12]Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima:
Errata to "Optimal Conflict-Avoiding Codes of Even Length and Weight 3". IEEE Trans. Inf. Theory 57(8): 5572 (2011) - 2010
- [j11]Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima:
Optimal Conflict-Avoiding Codes of Even Length and Weight 3. IEEE Trans. Inf. Theory 56(11): 5747-5756 (2010)
2000 – 2009
- 2009
- [j10]Miwako Mishima, Hung-Lin Fu, Shoichi Uruno:
Optimal conflict-avoiding codes of length n = 0 (mod 16) and weight 3. Des. Codes Cryptogr. 52(3): 275-291 (2009) - [j9]Cunsheng Ding
, Ryoh Fuji-Hara, Yuichiro Fujiwara, Masakazu Jimbo, Miwako Mishima:
Sets of frequency hopping sequences: bounds and optimal constructions. IEEE Trans. Inf. Theory 55(7): 3297-3304 (2009) - 2008
- [j8]Takaaki Hishida, Masakazu Jimbo, Miwako Mishima, Yukiyasu Mutoh, Kazuhiro Ozawa:
Further constructions for BIB designs with nested rows and columns. Ars Comb. 86 (2008) - [j7]Miwako Mishima:
The spectrum of 1-rotational Steiner triple systems over a dicyclic group. Discret. Math. 308(12): 2617-2619 (2008) - 2007
- [j6]Masakazu Jimbo, Miwako Mishima, Susan Janiszewski, Amin Y. Teymorian, Vladimir D. Tonchev:
On Conflict-Avoiding Codes of Length n=4m for Three Active Users. IEEE Trans. Inf. Theory 53(8): 2732-2742 (2007) - 2004
- [j5]Ryoh Fuji-Hara, Ying Miao, Miwako Mishima:
Optimal frequency hopping sequences: a combinatorial approach. IEEE Trans. Inf. Theory 50(10): 2408-2420 (2004) - 2000
- [j4]Miwako Mishima, Masakazu Jimbo:
Recursive constructions for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs. Discret. Math. 211: 135-152 (2000)
1990 – 1999
- 1999
- [j3]Miwako Mishima:
The spectrum of rotational directed triple systems and rotational Mendelsohn triple systems. Australas. J Comb. 20: 181-188 (1999) - 1998
- [j2]Miwako Mishima, Ying Miao, Sanpei Kageyama, Masakazu Jimbo:
Constructions of nested directed BIB designs. Australas. J Comb. 18: 157-172 (1998) - 1996
- [j1]Miwako Mishima, Masakazu Jimbo:
A series of identities for the coefficients of inverse matrices on a Hamming scheme. Discret. Math. 156(1-3): 285-290 (1996)
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-04-25 05:46 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:
