Terunao Soneoka - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

1996

Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: IITerunao Soneoka, Makoto Imase, Yoshifumi Manabe. DAM, 64(3):267-279, 1996. [doi]

1994

Logically Instantaneous Message Passing in Asynchronous Distributed SystemsTerunao Soneoka, Toshihide Ibaraki. TC, 43(5):513-527, 1994.

1993

Highly multi-tasking real-time systems and their evaluationTerunao Soneoka, Ayaru Oizumi, Koichi Suda. rtss 1993: 249-252 [doi]

1992

Combination of conformance and interoperability testingNoriyasu Arakawa, Marc Phalippou, Nathalie Risser, Terunao Soneoka. forte 1993: 397-412

Super Edge-Connectivity of Dense Digraphs and GraphsTerunao Soneoka. DAM, 37/38:511-523, 1992. [doi]

1991

A Test Case Generation Method for Concurrent ProgramsNoriyasu Arakawa, Terunao Soneoka. pts 1992: 95-106

Global states monitoring algorithm for distributed systemKenji Moriyasu, Terunao Soneoka, Yoshifumi Manabe. scjapan, 22(14):45-56, 1991. [doi]

1990

Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameterTerunao Soneoka, Hiroshi Nakada, Makoto Imase. DAM, 27(3):255-265, 1990. [doi]

1987

Sufficient conditions for maximally connected dense graphsTerunao Soneoka, Hiroshi Nakada, Makoto Imase, Claudine Peyrat. DM, 63(1):53-66, 1987. [doi]

1986

Fault-tolerant processor interconnection networksMakoto Imase, Terunao Soneoka, Keiji Okada. scjapan, 17(8):21-30, 1986. [doi]

1985

Connectivity of Regular Directed Graphs with Small DiametersMakoto Imase, Terunao Soneoka, Keiji Okada. TC, 34(3):267-273, 1985.

Sign in or sign up to see more results.

runs on WebDSL