Search the dblp DataBase
Masafumi Koyama: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Masafumi Koyama, Kazuhiro Morita, Masao Fuketa, Jun-Ichi Aoe
A Fast Retrieving Algorithm of Hierarchical Relationships Using Trie Structures. [Citation Graph (0, 0)][DBLP]
Inf. Process. Manage., 1998, v:34, n:6, pp:761-773 [Journal] - Masami Shishibori, Masafumi Koyama, Makoto Okada, Jun-Ichi Aoe
Two improved access methods on compact binary (CB) trees. [Citation Graph (0, 0)][DBLP]
Inf. Process. Manage., 2000, v:36, n:3, pp:379-399 [Journal] - Ingrid Kirschning, Hideto Tomabechi, Masafumi Koyama, Jun-Ichi Aoe
The Time-Sliced Paradigm - A Connectionist Method for Continous Speech Recognition. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 1996, v:93, n:1, pp:133-158 [Journal] - Masafumi Koyama, Masaki Oono, Kazuhiro Morita, Jun-Ichi Aoe
A fast and compact technique of implementing transition tables for finite state automata. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 2000, v:129, n:1-4, pp:141-154 [Journal] - Hisatoshi Mochizuki, Masafumi Koyama, Masami Shishibori, Jun-Ichi Aoe
A Substring search Algorithm in Extendible Hashing. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 1998, v:108, n:1-4, pp:13-30 [Journal]
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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002