Nobuki Tokura

According to our database1, Nobuki Tokura
  • authored at least 57 papers between 1967 and 2004.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2004
Scheduling for broadcast operation in heterogeneous parallel computing environments.
Systems and Computers in Japan, 2004

2002
Real-time scheduling algorithms for maximum utilization of secondary battery in portable devices with discrete frequency control.
Systems and Computers in Japan, 2002

2000
An efficient self-simulation algorithm for reconfigurable meshes.
SPAA, 2000

Real-time task scheduling algorithms for maximum utilization of secondary batteries in portable devices.
Proceedings of the 7th International Workshop on Real-Time Computing and Applications Symposium (RTCSA 2000), 2000

Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999
Convex hull problem with imprecise input and its solution.
Systems and Computers in Japan, 1999

Simulating a Mesh with Separable Buses by a Mesh with Partitioned Buses.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1998
Convex Hull Problem with Imprecise Input.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

1997
An Algorithm for Finding the Causal Distributed Breakpoint.
J. Parallel Distrib. Comput., 1997

Integrating System's Functional Model and its Structional Model Toward Denotational Dialogue Specification.
Proceedings of the Design of Computing Systems: Social and Ergonomic Considerations, 1997

1996
Self-stabilizing ring orientation algorithm under the C-Daemon.
Systems and Computers in Japan, 1996

Lecture supporting system by using e-mail and WWW.
Proceedings of the 27th SIGCSE Technical Symposium on Computer Science Education, 1996

1995
A Reorganization Framework of the Object-Oriented Class Hierarchy.
Proceedings of the 2nd Asia-Pacific Software Engineering Conference (APSEC '95), 1995

1994
A distributed shortest-paths algorithm with distance-dependent message complexities.
Systems and Computers in Japan, 1994

1993
An optimal parallel algorithm for finding shortest paths inside simple polygons.
Systems and Computers in Japan, 1993

1992
A complete spanning tree maintenance algorithm and its complexity.
Systems and Computers in Japan, 1992

Efficient distributed algorithm to solve updating minimum spanning tree problem.
Systems and Computers in Japan, 1992

Simple parallel algorithms to compute interval maxima.
Systems and Computers in Japan, 1992

Methods for realizing a priority bus system.
Systems and Computers in Japan, 1992

1991
The complexity measure of program based on the inter-module dependency.
Systems and Computers in Japan, 1991

Efficient distributed algorithms solving problems about the connectivity of network.
Systems and Computers in Japan, 1991

A fault-tolerant algorithm for election in complete networks with a sense of direction.
Systems and Computers in Japan, 1991

1990
A HIGH-Speed LAN Model Using an Information-Updating Algorithm.
Systems and Computers in Japan, 1990

Evaluation of pointing efficiency influenced by the difference of bit-map resolution.
Systems and Computers in Japan, 1990

A pointing method for graphics.
Systems and Computers in Japan, 1990

Distributed Algorithms for Reconstructing MST after Topology Change.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989
An efficient distributed algorithm for constructing a breadth-first search tree.
Systems and Computers in Japan, 1989

Page-number of hypercubes and cube-connected cycles.
Systems and Computers in Japan, 1989

Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction.
Proceedings of the Distributed Algorithms, 1989

1988
Distributed algorithms for fault diagnosis of processors.
Systems and Computers in Japan, 1988

1987
Descriptive power of synchronized shuffle expressions.
Systems and Computers in Japan, 1987

Distributed algorithms tolerant of link failures.
Systems and Computers in Japan, 1987

An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees.
Discrete Applied Mathematics, 1987

1986
Area-time complexity on a vlsi model with boundary layout assumption.
Systems and Computers in Japan, 1986

Embedding area of d-way shuffle graph on a VLSI model.
Systems and Computers in Japan, 1986

Complexity to determine containment among inequality tableau queries.
Systems and Computers in Japan, 1986

Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees.
Systems and Computers in Japan, 1986

Minimum separation layout for cmos circuits realizing tree-shape monotone decreasing logic circuits.
Systems and Computers in Japan, 1986

1985
Real-time shuffle stack automaton.
Systems and Computers in Japan, 1985

Vulnerability of a communication network with a satellite.
Systems and Computers in Japan, 1985

Descriptive powers of synchronized shuffle grammars and synchronized production systems.
Systems and Computers in Japan, 1985

1984
Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model.
IEEE Trans. Computers, 1984

Concurrent C: A Programming Language for Distributed Multiprocessor Systems.
Softw., Pract. Exper., 1984

1982
Effect of Practical Assumption in Area Complexity of VLSI Computation.
Proceedings of the RIMS Symposium on Software Science and Engineering, 1982

An Editor for Documentation in pi-System to Support Software Development and Maintenance.
Proceedings of the Proceedings, 1982

1981
Relations of Flow Languages to Petri Net Languages.
Theor. Comput. Sci., 1981

Flow Languages Equal Recursively Enumerable Languages.
Acta Inf., 1981

1980
Specification of schedulers with algebraic specification techniques.
Proceedings of the Operating Systems Engineering: Proceedings of the 14th IBM Computer SCience Symposium, 1980

1976
On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes
Information and Control, April, 1976

1974
Ianov Schemas Augmented by a Pushdown Memory
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973
On the Capabilities of While, Repeat, and Exit Statements.
Commun. ACM, 1973

1972
Minimal Negative Gate Networks.
IEEE Trans. Computers, 1972

1971
Weight distribution of (128, 64) Reed-Muller code (Corresp.).
IEEE Trans. Information Theory, 1971

Failsafe Logic Nets.
IEEE Trans. Computers, 1971

1970
On the weight structure of Reed-Muller codes.
IEEE Trans. Information Theory, 1970

1969
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes.
IEEE Trans. Information Theory, 1969

1967
A search procedure for finding optimum group codes for the binary symmetric channel.
IEEE Trans. Information Theory, 1967


  Loading...