Connectivity of Regular Directed Graphs with Small Diameters. - Makoto Imase; Terunao Soneoka; Keiji Okada (IEEE Trans. Computers, 1985)

Fault-tolerant processor interconnection networks. - Makoto Imase; Terunao Soneoka; Keiji Okada (Syst. Comput. Jpn., 1986)

Sufficient conditions for maximally connected dense graphs. - Terunao Soneoka; Hiroshi Nakada; Makoto Imase; Claudine Peyrat (Discret. Math., 1987)

Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. - Terunao Soneoka; Hiroshi Nakada; Makoto Imase (Discret. Appl. Math., 1990)

A Test Case Generation Method for Concurrent Programs. - Noriyasu Arakawa; Terunao Soneoka (Protocol Test Systems, 1991)

Global states monitoring algorithm for distributed system. - Kenji Moriyasu; Terunao Soneoka; Yoshifumi Manabe (Syst. Comput. Jpn., 1991)

Combination of conformance and interoperability testing. - Noriyasu Arakawa; Marc Phalippou; Nathalie Risser; Terunao Soneoka (FORTE, 1992)

Super Edge-Connectivity of Dense Digraphs and Graphs. - Terunao Soneoka (Discret. Appl. Math., 1992)

Highly multi-tasking real-time systems and their evaluation. - Terunao Soneoka; Ayaru Oizumi; Koichi Suda (RTSS, 1993)

Logically Instantaneous Message Passing in Asynchronous Distributed Systems. - Terunao Soneoka; Toshihide Ibaraki (IEEE Trans. Computers, 1994)

Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II. - Terunao Soneoka; Makoto Imase; Yoshifumi Manabe (Discret. Appl. Math., 1996)