A search procedure for finding optimum group codes for the binary symmetric channel. - Nobuki Tokura; Kenichi Taniguchi; Tadao Kasami (IEEE Trans. Inf. Theory, 1967)

Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes. - Tadao Kasami; Nobuki Tokura (IEEE Trans. Inf. Theory, 1969)

On the weight structure of Reed-Muller codes. - Tadao Kasami; Nobuki Tokura (IEEE Trans. Inf. Theory, 1970)

Failsafe Logic Nets. - Nobuki Tokura; Tadao Kasami; Akihiro Hashimoto (IEEE Trans. Computers, 1971)

Weight distribution of (128, 64) Reed-Muller code (Corresp.). - M. Sugino; Y. Ienaga; Nobuki Tokura; Tadao Kasami (IEEE Trans. Inf. Theory, 1971)

Minimal Negative Gate Networks. - Keijiro Nakamura; Nobuki Tokura; Tadao Kasami (IEEE Trans. Computers, 1972)

On the Capabilities of While, Repeat, and Exit Statements. - W. Wesley Peterson; Tadao Kasami; Nobuki Tokura (Commun. ACM, 1973)

Ianov Schemas Augmented by a Pushdown Memory - Nobuki Tokura; Tadao Kasami; Shukichi Furuta (SWAT, 1974)

On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes - Tadao Kasami; Nobuki Tokura; Saburo Azumi (Inf. Control., 1976)

Specification of schedulers with algebraic specification techniques. - Kouichi Wada 001; Kenichi Hagihara; Toshiro Araki; Nobuki Tokura (Operating Systems Engineering, 1980)

Flow Languages Equal Recursively Enumerable Languages. - Toshiro Araki; Nobuki Tokura (Acta Informatica, 1981)

Relations of Flow Languages to Petri Net Languages. - Toshiro Araki; Toyohiko Kagimasa; Nobuki Tokura (Theor. Comput. Sci., 1981)

An Editor for Documentation in pi-System to Support Software Development and Maintenance. - Yukikazu Nakamoto; T. Iwamoto; M. Hori; Kenichi Hagihara; Nobuki Tokura (ICSE, 1982)

Effect of Practical Assumption in Area Complexity of VLSI Computation. - Kenichi Hagihara; Kouichi Wada 001; Nobuki Tokura (RIMS Symposium on Software Science and Engineering, 1982)

Concurrent C: A Programming Language for Distributed Multiprocessor Systems. - Yoshihiro Tsujino; M. Ando; Toshiro Araki; Nobuki Tokura (Softw. Pract. Exp., 1984)

Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model. - Kouichi Wada 001; Kenichi Hagihara; Nobuki Tokura (IEEE Trans. Computers, 1984)

Descriptive powers of synchronized shuffle grammars and synchronized production systems. - Toshiro Araki; Hirotaka Uoi; Shoji Kosai; Nobuki Tokura (Syst. Comput. Jpn., 1985)

Vulnerability of a communication network with a satellite. - Kenichi Hagihara; Toshimitsu Masuzawa; Nobuki Tokura; Mitsuji Ikeda (Syst. Comput. Jpn., 1985)

Real-time shuffle stack automaton. - Shoji Kosai; Yoshihiro Tsujino; Toshiro Araki; Nobuki Tokura (Syst. Comput. Jpn., 1985)

Minimum separation layout for cmos circuits realizing tree-shape monotone decreasing logic circuits. - Yoshifumi Manabe; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1986)

Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees. - Toshimitsu Masuzawa; Kenichi Hagihara; Nobuki Tokura; Koichi Wada 001 (Syst. Comput. Jpn., 1986)

Complexity to determine containment among inequality tableau queries. - Tomoyuki Terada; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1986)

Embedding area of d-way shuffle graph on a VLSI model. - Koichi Wada 001; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1986)

Area-time complexity on a vlsi model with boundary layout assumption. - Kouichi Wada 001; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1986)

An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees. - Toshimitsu Masuzawa; Kenichi Hagihara; Nobuki Tokura (Discret. Appl. Math., 1987)

Distributed algorithms tolerant of link failures. - Toshimitsu Masuzawa; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1987)

Descriptive power of synchronized shuffle expressions. - Hirotaka Uoi; Toshiro Araki; Nobuki Tokura (Syst. Comput. Jpn., 1987)

Distributed algorithms for fault diagnosis of processors. - Toshimitsu Masuzawa; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1988)

Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction. - Toshimitsu Masuzawa; Naoki Nishikawa; Kenichi Hagihara; Nobuki Tokura (WDAG, 1989)

Page-number of hypercubes and cube-connected cycles. - Michiko Konoe; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1989)

An efficient distributed algorithm for constructing a breadth-first search tree. - Jungho Park; Nobuki Tokura; Toshimitsu Masuzawa; Kenichi Hagihara (Syst. Comput. Jpn., 1989)

Distributed Algorithms for Reconstructing MST after Topology Change. - Jungho Park; Toshimitsu Masuzawa; Kenichi Hagihara; Nobuki Tokura (WDAG, 1990)

A pointing method for graphics. - Yoshiyuki Nishinaka; Yoshihiro Tsujino; Nobuki Tokura (Syst. Comput. Jpn., 1990)

Evaluation of pointing efficiency influenced by the difference of bit-map resolution. - Yoshiyuki Nishinaka; Yoshihiro Tsujino; Nobuki Tokura (Syst. Comput. Jpn., 1990)

A HIGH-Speed LAN Model Using an Information-Updating Algorithm. - Akinori Saitoh; Takeshi Tsushi; Yoshihiro Tsujino; Nobuki Tokura (Syst. Comput. Jpn., 1990)

A fault-tolerant algorithm for election in complete networks with a sense of direction. - Toshimitsu Masuzawa; Naoki Nishikawa; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1991)

Efficient distributed algorithms solving problems about the connectivity of network. - Jungho Park; Nobuki Tokura; Toshimitsu Masuzawa; Kenichi Hagihara (Syst. Comput. Jpn., 1991)

The complexity measure of program based on the inter-module dependency. - Haesool Yang; Yoshihiro Tsujino; Nobuki Tokura (Syst. Comput. Jpn., 1991)

Methods for realizing a priority bus system. - Koji Nakano; Toshimitsu Masuzawa; Nobuki Tokura (Syst. Comput. Jpn., 1992)

Simple parallel algorithms to compute interval maxima. - Koji Nakano; Nobuki Tokura; Toshimitsu Masuzawa (Syst. Comput. Jpn., 1992)

Efficient distributed algorithm to solve updating minimum spanning tree problem. - Jungho Park; Kenichi Hagihara; Nobuki Tokura; Toshimitsu Masuzawa (Syst. Comput. Jpn., 1992)

A complete spanning tree maintenance algorithm and its complexity. - Akinori Saitoh; Yoshihiro Tsujino; Nobuki Tokura (Syst. Comput. Jpn., 1992)

An optimal parallel algorithm for finding shortest paths inside simple polygons. - Wei Chen 003; Koji Nakano; Toshimitsu Masuzawa; Yoshihiro Tsujino; Nobuki Tokura (Syst. Comput. Jpn., 1993)

A distributed shortest-paths algorithm with distance-dependent message complexities. - Kouji Miura; Toshimitsu Masuzawa; Nobuki Tokura (Syst. Comput. Jpn., 1994)

A Reorganization Framework of the Object-Oriented Class Hierarchy. - Suk-hyung Hwang; Yoshihiro Tsujino; Nobuki Tokura (APSEC, 1995)

Lecture supporting system by using e-mail and WWW. - Tomohiro Nishida; Akinori Saitoh; Yoshihiro Tsujino; Nobuki Tokura (SIGCSE, 1996)

Self-stabilizing ring orientation algorithm under the C-Daemon. - Yoshiaki Katayama; Toshimitsu Masuzawa; Nobuki Tokura (Syst. Comput. Jpn., 1996)

Integrating System's Functional Model and its Structional Model Toward Denotational Dialogue Specification. - K. Matsubayashi; Yoshihiro Tsujino; Nobuki Tokura (HCI (2), 1997)

An Algorithm for Finding the Causal Distributed Breakpoint. - Toshimitsu Masuzawa; Nobuki Tokura (J. Parallel Distributed Comput., 1997)

Convex Hull Problem with Imprecise Input. - Takayuki Nagai; Seigo Yasutome; Nobuki Tokura (JCDCG, 1998)

Simulating a Mesh with Separable Buses by a Mesh with Partitioned Buses. - Susumu Matsumae; Nobuki Tokura (ISPAN, 1999)

Convex hull problem with imprecise input and its solution. - Takayuki Nagai; Seigo Yasutome; Nobuki Tokura (Syst. Comput. Jpn., 1999)

Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates. - Takayuki Nagai; Nobuki Tokura (JCDCG, 2000)

Real-time task scheduling algorithms for maximum utilization of secondary batteries in portable devices. - Yukikazu Nakamoto; Yoshihiro Tsujino; Nobuki Tokura (RTCSA, 2000)

An efficient self-simulation algorithm for reconfigurable meshes. - Susumu Matsumae; Nobuki Tokura (SPAA, 2000)

Real-time scheduling algorithms for maximum utilization of secondary battery in portable devices with discrete frequency control. - Yukikazu Nakamoto; Yoshihiro Tsujino; Nobuki Tokura (Syst. Comput. Jpn., 2002)

Scheduling for broadcast operation in heterogeneous parallel computing environments. - Fukuhito Ooshita; Susumu Matsumae; Toshimitsu Masuzawa; Nobuki Tokura (Syst. Comput. Jpn., 2004)