Nobuki Tokura

57 papers A* 1A 1B 2C 1Journal 43Unranked 9
YearRankTypeTitle / Venue / Authors
2004 J jnl
Scheduling for broadcast operation in heterogeneous parallel computing environments.
Syst. Comput. Jpn.
Fukuhito Ooshita, Susumu Matsumae, Toshimitsu Masuzawa, Nobuki Tokura
2002 J jnl
Real-time scheduling algorithms for maximum utilization of secondary battery in portable devices with discrete frequency control.
Syst. Comput. Jpn.
Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura
2000 B conf
An efficient self-simulation algorithm for reconfigurable meshes.
SPAA
Susumu Matsumae, Nobuki Tokura
2000 B conf
Real-time task scheduling algorithms for maximum utilization of secondary batteries in portable devices.
RTCSA
Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura
2000 — conf
Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates.
JCDCG
Takayuki Nagai, Nobuki Tokura
1999 J jnl
Convex hull problem with imprecise input and its solution.
Syst. Comput. Jpn.
Takayuki Nagai, Seigo Yasutome, Nobuki Tokura
1999 — conf
Simulating a Mesh with Separable Buses by a Mesh with Partitioned Buses.
ISPAN
Susumu Matsumae, Nobuki Tokura
1998 — conf
Convex Hull Problem with Imprecise Input.
JCDCG
Takayuki Nagai, Seigo Yasutome, Nobuki Tokura
1997 J jnl
An Algorithm for Finding the Causal Distributed Breakpoint.
J. Parallel Distributed Comput.
Toshimitsu Masuzawa, Nobuki Tokura
1997 — conf
Integrating System's Functional Model and its Structional Model Toward Denotational Dialogue Specification.
HCI (2)
K. Matsubayashi, Yoshihiro Tsujino, Nobuki Tokura
1996 A conf
Lecture supporting system by using e-mail and WWW.
SIGCSE
Tomohiro Nishida, Akinori Saitoh, Yoshihiro Tsujino, Nobuki Tokura
1996 J jnl
Self-stabilizing ring orientation algorithm under the C-Daemon.
Syst. Comput. Jpn.
Yoshiaki Katayama, Toshimitsu Masuzawa, Nobuki Tokura
1995 C conf
A Reorganization Framework of the Object-Oriented Class Hierarchy.
APSEC
Suk-hyung Hwang, Yoshihiro Tsujino, Nobuki Tokura
1994 J jnl
A distributed shortest-paths algorithm with distance-dependent message complexities.
Syst. Comput. Jpn.
Kouji Miura, Toshimitsu Masuzawa, Nobuki Tokura
1993 J jnl
An optimal parallel algorithm for finding shortest paths inside simple polygons.
Syst. Comput. Jpn.
Wei Chen, Koji Nakano, Toshimitsu Masuzawa, Yoshihiro Tsujino, Nobuki Tokura
1992 J jnl
A complete spanning tree maintenance algorithm and its complexity.
Syst. Comput. Jpn.
Akinori Saitoh, Yoshihiro Tsujino, Nobuki Tokura
1992 J jnl
Efficient distributed algorithm to solve updating minimum spanning tree problem.
Syst. Comput. Jpn.
Jungho Park, Kenichi Hagihara, Nobuki Tokura, Toshimitsu Masuzawa
1992 J jnl
Methods for realizing a priority bus system.
Syst. Comput. Jpn.
Koji Nakano, Toshimitsu Masuzawa, Nobuki Tokura
1992 J jnl
Simple parallel algorithms to compute interval maxima.
Syst. Comput. Jpn.
Koji Nakano, Nobuki Tokura, Toshimitsu Masuzawa
1991 J jnl
A fault-tolerant algorithm for election in complete networks with a sense of direction.
Syst. Comput. Jpn.
Toshimitsu Masuzawa, Naoki Nishikawa, Kenichi Hagihara, Nobuki Tokura
1991 J jnl
Efficient distributed algorithms solving problems about the connectivity of network.
Syst. Comput. Jpn.
Jungho Park, Nobuki Tokura, Toshimitsu Masuzawa, Kenichi Hagihara
1991 J jnl
The complexity measure of program based on the inter-module dependency.
Syst. Comput. Jpn.
Haesool Yang, Yoshihiro Tsujino, Nobuki Tokura
1990 J jnl
A HIGH-Speed LAN Model Using an Information-Updating Algorithm.
Syst. Comput. Jpn.
Akinori Saitoh, Takeshi Tsushi, Yoshihiro Tsujino, Nobuki Tokura
1990 J jnl
A pointing method for graphics.
Syst. Comput. Jpn.
Yoshiyuki Nishinaka, Yoshihiro Tsujino, Nobuki Tokura
1990 — conf
Distributed Algorithms for Reconstructing MST after Topology Change.
WDAG
Jungho Park, Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura
1990 J jnl
Evaluation of pointing efficiency influenced by the difference of bit-map resolution.
Syst. Comput. Jpn.
Yoshiyuki Nishinaka, Yoshihiro Tsujino, Nobuki Tokura
1989 J jnl
An efficient distributed algorithm for constructing a breadth-first search tree.
Syst. Comput. Jpn.
Jungho Park, Nobuki Tokura, Toshimitsu Masuzawa, Kenichi Hagihara
1989 — conf
Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction.
WDAG
Toshimitsu Masuzawa, Naoki Nishikawa, Kenichi Hagihara, Nobuki Tokura
1989 J jnl
Page-number of hypercubes and cube-connected cycles.
Syst. Comput. Jpn.
Michiko Konoe, Kenichi Hagihara, Nobuki Tokura
1988 J jnl
Distributed algorithms for fault diagnosis of processors.
Syst. Comput. Jpn.
Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura
1987 J jnl
An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees.
Discret. Appl. Math.
Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura
1987 J jnl
Descriptive power of synchronized shuffle expressions.
Syst. Comput. Jpn.
Hirotaka Uoi, Toshiro Araki, Nobuki Tokura
1987 J jnl
Distributed algorithms tolerant of link failures.
Syst. Comput. Jpn.
Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura
1986 J jnl
Area-time complexity on a vlsi model with boundary layout assumption.
Syst. Comput. Jpn.
Kouichi Wada, Kenichi Hagihara, Nobuki Tokura
1986 J jnl
Complexity to determine containment among inequality tableau queries.
Syst. Comput. Jpn.
Tomoyuki Terada, Kenichi Hagihara, Nobuki Tokura
1986 J jnl
Embedding area of d-way shuffle graph on a VLSI model.
Syst. Comput. Jpn.
Koichi Wada, Kenichi Hagihara, Nobuki Tokura
1986 J jnl
Minimum separation layout for cmos circuits realizing tree-shape monotone decreasing logic circuits.
Syst. Comput. Jpn.
Yoshifumi Manabe, Kenichi Hagihara, Nobuki Tokura
1986 J jnl
Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees.
Syst. Comput. Jpn.
Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura, Koichi Wada
1985 J jnl
Descriptive powers of synchronized shuffle grammars and synchronized production systems.
Syst. Comput. Jpn.
Toshiro Araki, Hirotaka Uoi, Shoji Kosai, Nobuki Tokura
1985 J jnl
Real-time shuffle stack automaton.
Syst. Comput. Jpn.
Shoji Kosai, Yoshihiro Tsujino, Toshiro Araki, Nobuki Tokura
1985 J jnl
Vulnerability of a communication network with a satellite.
Syst. Comput. Jpn.
Kenichi Hagihara, Toshimitsu Masuzawa, Nobuki Tokura, Mitsuji Ikeda
1984 J jnl
Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model.
IEEE Trans. Computers
Kouichi Wada, Kenichi Hagihara, Nobuki Tokura
1984 J jnl
Concurrent C: A Programming Language for Distributed Multiprocessor Systems.
Softw. Pract. Exp.
Yoshihiro Tsujino, M. Ando, Toshiro Araki, Nobuki Tokura
1982 A* conf
An Editor for Documentation in pi-System to Support Software Development and Maintenance.
ICSE
Yukikazu Nakamoto, T. Iwamoto, M. Hori, Kenichi Hagihara, Nobuki Tokura
1982 — conf
Effect of Practical Assumption in Area Complexity of VLSI Computation.
RIMS Symposium on Software Science and Engineering
Kenichi Hagihara, Kouichi Wada, Nobuki Tokura
1981 J jnl
Flow Languages Equal Recursively Enumerable Languages.
Acta Informatica
Toshiro Araki, Nobuki Tokura
1981 J jnl
Relations of Flow Languages to Petri Net Languages.
Theor. Comput. Sci.
Toshiro Araki, Toyohiko Kagimasa, Nobuki Tokura
1980 — conf
Specification of schedulers with algebraic specification techniques.
Operating Systems Engineering
Kouichi Wada, Kenichi Hagihara, Toshiro Araki, Nobuki Tokura
1976 J jnl
On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes
Inf. Control.
Tadao Kasami, Nobuki Tokura, Saburo Azumi
1974 — conf
Ianov Schemas Augmented by a Pushdown Memory
SWAT
Nobuki Tokura, Tadao Kasami, Shukichi Furuta
1973 J jnl
On the Capabilities of While, Repeat, and Exit Statements.
Commun. ACM
W. Wesley Peterson, Tadao Kasami, Nobuki Tokura
1972 J jnl
Minimal Negative Gate Networks.
IEEE Trans. Computers
Keijiro Nakamura, Nobuki Tokura, Tadao Kasami
1971 J jnl
Failsafe Logic Nets.
IEEE Trans. Computers
Nobuki Tokura, Tadao Kasami, Akihiro Hashimoto
1971 J jnl
Weight distribution of (128, 64) Reed-Muller code (Corresp.).
IEEE Trans. Inf. Theory
M. Sugino, Y. Ienaga, Nobuki Tokura, Tadao Kasami
1970 J jnl
On the weight structure of Reed-Muller codes.
IEEE Trans. Inf. Theory
Tadao Kasami, Nobuki Tokura
1969 J jnl
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes.
IEEE Trans. Inf. Theory
Tadao Kasami, Nobuki Tokura
1967 J jnl
A search procedure for finding optimum group codes for the binary symmetric channel.
IEEE Trans. Inf. Theory
Nobuki Tokura, Kenichi Taniguchi, Tadao Kasami