default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNobuki Tokura
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j43]Fukuhito Ooshita, Susumu Matsumae
, Toshimitsu Masuzawa, Nobuki Tokura:
Scheduling for broadcast operation in heterogeneous parallel computing environments. Syst. Comput. Jpn. 35(5): 44-54 (2004)- 2002
- [j42]Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura:
Real-time scheduling algorithms for maximum utilization of secondary battery in portable devices with discrete frequency control. Syst. Comput. Jpn. 33(3): 41-51 (2002) - 2000
- [c14]Takayuki Nagai, Nobuki Tokura:
Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates. JCDCG 2000: 252-263 - [c13]Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura:
Real-time task scheduling algorithms for maximum utilization of secondary batteries in portable devices. RTCSA 2000: 347-354 - [c12]Susumu Matsumae, Nobuki Tokura:
An efficient self-simulation algorithm for reconfigurable meshes. SPAA 2000: 216-223
1990 – 1999
- 1999
- [j41]Takayuki Nagai, Seigo Yasutome, Nobuki Tokura:
Convex hull problem with imprecise input and its solution. Syst. Comput. Jpn. 30(3): 31-42 (1999) - [c11]Susumu Matsumae, Nobuki Tokura:
Simulating a Mesh with Separable Buses by a Mesh with Partitioned Buses. ISPAN 1999: 198-203 - 1998
- [c10]Takayuki Nagai, Seigo Yasutome, Nobuki Tokura:
Convex Hull Problem with Imprecise Input. JCDCG 1998: 207-219 - 1997
- [j40]Toshimitsu Masuzawa, Nobuki Tokura:
An Algorithm for Finding the Causal Distributed Breakpoint. J. Parallel Distributed Comput. 42(1): 60-66 (1997) - [c9]K. Matsubayashi, Yoshihiro Tsujino, Nobuki Tokura:
Integrating System's Functional Model and its Structional Model Toward Denotational Dialogue Specification. HCI (2) 1997: 63-66 - 1996
- [j39]Yoshiaki Katayama, Toshimitsu Masuzawa, Nobuki Tokura:
Self-stabilizing ring orientation algorithm under the C-Daemon. Syst. Comput. Jpn. 27(4): 65-74 (1996) - [c8]Tomohiro Nishida, Akinori Saitoh, Yoshihiro Tsujino, Nobuki Tokura:
Lecture supporting system by using e-mail and WWW. SIGCSE 1996: 280-284 - 1995
- [c7]Suk-hyung Hwang, Yoshihiro Tsujino, Nobuki Tokura:
A Reorganization Framework of the Object-Oriented Class Hierarchy. APSEC 1995: 117-126 - 1994
- [j38]Kouji Miura, Toshimitsu Masuzawa, Nobuki Tokura:
A distributed shortest-paths algorithm with distance-dependent message complexities. Syst. Comput. Jpn. 25(9): 53-66 (1994) - 1993
- [j37]Wei Chen, Koji Nakano, Toshimitsu Masuzawa, Yoshihiro Tsujino, Nobuki Tokura:
An optimal parallel algorithm for finding shortest paths inside simple polygons. Syst. Comput. Jpn. 24(1): 1-15 (1993) - 1992
- [j36]Jungho Park, Kenichi Hagihara, Nobuki Tokura, Toshimitsu Masuzawa:
Efficient distributed algorithm to solve updating minimum spanning tree problem. Syst. Comput. Jpn. 23(3): 1-12 (1992) - [j35]Koji Nakano, Nobuki Tokura, Toshimitsu Masuzawa:
Simple parallel algorithms to compute interval maxima. Syst. Comput. Jpn. 23(5): 1-11 (1992) - [j34]Koji Nakano, Toshimitsu Masuzawa, Nobuki Tokura:
Methods for realizing a priority bus system. Syst. Comput. Jpn. 23(5): 24-31 (1992) - [j33]Akinori Saitoh, Yoshihiro Tsujino, Nobuki Tokura:
A complete spanning tree maintenance algorithm and its complexity. Syst. Comput. Jpn. 23(11): 17-28 (1992) - 1991
- [j32]Jungho Park, Nobuki Tokura, Toshimitsu Masuzawa, Kenichi Hagihara:
Efficient distributed algorithms solving problems about the connectivity of network. Syst. Comput. Jpn. 22(8): 1-16 (1991) - [j31]Toshimitsu Masuzawa, Naoki Nishikawa, Kenichi Hagihara, Nobuki Tokura:
A fault-tolerant algorithm for election in complete networks with a sense of direction. Syst. Comput. Jpn. 22(12): 11-23 (1991) - [j30]Haesool Yang, Yoshihiro Tsujino, Nobuki Tokura:
The complexity measure of program based on the inter-module dependency. Syst. Comput. Jpn. 22(13): 10-19 (1991) - 1990
- [j29]Yoshiyuki Nishinaka, Yoshihiro Tsujino, Nobuki Tokura:
A pointing method for graphics. Syst. Comput. Jpn. 21(1): 13-22 (1990) - [j28]Akinori Saitoh, Takeshi Tsushi, Yoshihiro Tsujino, Nobuki Tokura:
A HIGH-Speed LAN Model Using an Information-Updating Algorithm. Syst. Comput. Jpn. 21(3): 47-56 (1990) - [j27]Yoshiyuki Nishinaka, Yoshihiro Tsujino, Nobuki Tokura:
Evaluation of pointing efficiency influenced by the difference of bit-map resolution. Syst. Comput. Jpn. 21(10): 47-55 (1990) - [c6]Jungho Park, Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura:
Distributed Algorithms for Reconstructing MST after Topology Change. WDAG 1990: 122-132
1980 – 1989
- 1989
- [j26]Michiko Konoe, Kenichi Hagihara, Nobuki Tokura:
Page-number of hypercubes and cube-connected cycles. Syst. Comput. Jpn. 20(4): 34-47 (1989) - [j25]Jungho Park, Nobuki Tokura, Toshimitsu Masuzawa, Kenichi Hagihara:
An efficient distributed algorithm for constructing a breadth-first search tree. Syst. Comput. Jpn. 20(10): 15-30 (1989) - [c5]Toshimitsu Masuzawa, Naoki Nishikawa, Kenichi Hagihara, Nobuki Tokura:
Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction. WDAG 1989: 171-182 - 1988
- [j24]Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura:
Distributed algorithms for fault diagnosis of processors. Syst. Comput. Jpn. 19(8): 54-68 (1988) - 1987
- [j23]Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura:
An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees. Discret. Appl. Math. 17(1-2): 67-105 (1987) - [j22]Hirotaka Uoi, Toshiro Araki, Nobuki Tokura:
Descriptive power of synchronized shuffle expressions. Syst. Comput. Jpn. 18(5): 17-25 (1987) - [j21]Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura:
Distributed algorithms tolerant of link failures. Syst. Comput. Jpn. 18(7): 81-94 (1987) - 1986
- [j20]Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura, Koichi Wada:
Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees. Syst. Comput. Jpn. 17(3): 56-65 (1986) - [j19]Koichi Wada, Kenichi Hagihara, Nobuki Tokura:
Embedding area of d-way shuffle graph on a VLSI model. Syst. Comput. Jpn. 17(6): 10-19 (1986) - [j18]Kouichi Wada, Kenichi Hagihara, Nobuki Tokura:
Area-time complexity on a vlsi model with boundary layout assumption. Syst. Comput. Jpn. 17(6): 67-75 (1986) - [j17]Tomoyuki Terada, Kenichi Hagihara, Nobuki Tokura:
Complexity to determine containment among inequality tableau queries. Syst. Comput. Jpn. 17(7): 73-85 (1986) - [j16]Yoshifumi Manabe, Kenichi Hagihara, Nobuki Tokura:
Minimum separation layout for cmos circuits realizing tree-shape monotone decreasing logic circuits. Syst. Comput. Jpn. 17(9): 1-10 (1986) - 1985
- [j15]Shoji Kosai, Yoshihiro Tsujino, Toshiro Araki, Nobuki Tokura:
Real-time shuffle stack automaton. Syst. Comput. Jpn. 16(2): 29-37 (1985) - [j14]Kenichi Hagihara, Toshimitsu Masuzawa, Nobuki Tokura, Mitsuji Ikeda:
Vulnerability of a communication network with a satellite. Syst. Comput. Jpn. 16(4): 19-28 (1985) - [j13]Toshiro Araki, Hirotaka Uoi, Shoji Kosai, Nobuki Tokura:
Descriptive powers of synchronized shuffle grammars and synchronized production systems. Syst. Comput. Jpn. 16(5): 70-78 (1985) - 1984
- [j12]Yoshihiro Tsujino, M. Ando, Toshiro Araki, Nobuki Tokura:
Concurrent C: A Programming Language for Distributed Multiprocessor Systems. Softw. Pract. Exp. 14(11): 1061-1078 (1984) - [j11]Kouichi Wada, Kenichi Hagihara, Nobuki Tokura:
Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model. IEEE Trans. Computers 33(5): 455-462 (1984) - 1982
- [c4]Yukikazu Nakamoto, T. Iwamoto, M. Hori, Kenichi Hagihara, Nobuki Tokura:
An Editor for Documentation in pi-System to Support Software Development and Maintenance. ICSE 1982: 330-339 - [c3]Kenichi Hagihara, Kouichi Wada, Nobuki Tokura:
Effect of Practical Assumption in Area Complexity of VLSI Computation. RIMS Symposium on Software Science and Engineering 1982: 128-146 - 1981
- [j10]Toshiro Araki, Nobuki Tokura:
Flow Languages Equal Recursively Enumerable Languages. Acta Informatica 15: 209-217 (1981) - [j9]Toshiro Araki, Toyohiko Kagimasa, Nobuki Tokura:
Relations of Flow Languages to Petri Net Languages. Theor. Comput. Sci. 15: 51-75 (1981) - 1980
- [c2]Kouichi Wada, Kenichi Hagihara, Toshiro Araki, Nobuki Tokura:
Specification of schedulers with algebraic specification techniques. Operating Systems Engineering 1980: 42-62
1970 – 1979
- 1976
- [j8]Tadao Kasami, Nobuki Tokura, Saburo Azumi:
On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes. Inf. Control. 30(4): 380-395 (1976) - 1974
- [c1]Nobuki Tokura, Tadao Kasami, Shukichi Furuta:
Ianov Schemas Augmented by a Pushdown Memory. SWAT 1974: 84-94 - 1973
- [j7]W. Wesley Peterson, Tadao Kasami, Nobuki Tokura:
On the Capabilities of While, Repeat, and Exit Statements. Commun. ACM 16(8): 503-512 (1973) - 1972
- [j6]Keijiro Nakamura, Nobuki Tokura, Tadao Kasami:
Minimal Negative Gate Networks. IEEE Trans. Computers 21(1): 5-11 (1972) - 1971
- [j5]Nobuki Tokura, Tadao Kasami, Akihiro Hashimoto:
Failsafe Logic Nets. IEEE Trans. Computers 20(3): 323-330 (1971) - [j4]M. Sugino, Y. Ienaga, Nobuki Tokura, Tadao Kasami:
Weight distribution of (128, 64) Reed-Muller code (Corresp.). IEEE Trans. Inf. Theory 17(5): 627-628 (1971) - 1970
- [j3]Tadao Kasami, Nobuki Tokura:
On the weight structure of Reed-Muller codes. IEEE Trans. Inf. Theory 16(6): 752-759 (1970)
1960 – 1969
- 1969
- [j2]Tadao Kasami, Nobuki Tokura:
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes. IEEE Trans. Inf. Theory 15(3): 408-413 (1969) - 1967
- [j1]Nobuki Tokura, Kenichi Taniguchi, Tadao Kasami:
A search procedure for finding optimum group codes for the binary symmetric channel. IEEE Trans. Inf. Theory 13(4): 587-594 (1967)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
