|
Search the dblp DataBase
Terunao Soneoka:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Noriyasu Arakawa, Marc Phalippou, Nathalie Risser, Terunao Soneoka
Combination of conformance and interoperability testing. [Citation Graph (0, 0)][DBLP] FORTE, 1992, pp:397-412 [Conf]
- Noriyasu Arakawa, Terunao Soneoka
A Test Case Generation Method for Concurrent Programs. [Citation Graph (0, 0)][DBLP] Protocol Test Systems, 1991, pp:95-106 [Conf]
- Terunao Soneoka, Makoto Imase, Yoshifumi Manabe
Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:3, pp:267-279 [Journal]
- Terunao Soneoka
Super Edge-Connectivity of Dense Digraphs and Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:37, n:, pp:511-523 [Journal]
- Makoto Imase, Terunao Soneoka, Keiji Okada
Connectivity of Regular Directed Graphs with Small Diameters. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1985, v:34, n:3, pp:267-273 [Journal]
- Terunao Soneoka, Toshihide Ibaraki
Logically Instantaneous Message Passing in Asynchronous Distributed Systems. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1994, v:43, n:5, pp:513-527 [Journal]
- Terunao Soneoka, Hiroshi Nakada, Makoto Imase, Claudine Peyrat
Sufficient conditions for maximally connected dense graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1987, v:63, n:1, pp:53-66 [Journal]
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|