Keyword : time complexity


A Novel Channel Assignment Method to Ensure Deadlock-Freedom for Deterministic Routing
Ryuta KAWANO Hiroshi NAKAHARA Seiichi TADE Ikki FUJIWARA Hiroki MATSUTANI Michihiro KOIBUCHI Hideharu AMANO 
Publication:   
Publication Date: 2017/08/01
Vol. E100-D  No. 8 ; pp. 1798-1806
Type of Manuscript:  PAPER
Category: Computer System
Keyword: 
deadlock-free routinghigh performance computingtime complexity
 Summary | Full Text:PDF(988.8KB)

Study of a Reasonable Initial Center Selection Method Applied to a K-Means Clustering
WonHee LEE Samuel Sangkon LEE Dong-Un AN 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/08/01
Vol. E96-D  No. 8 ; pp. 1727-1733
Type of Manuscript:  PAPER
Category: Artificial Intelligence, Data Mining
Keyword: 
initial center selectionmax average distancetime complexityK-means algorithmdocument clustering
 Summary | Full Text:PDF(1.9MB)

The Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm
Masahiro KIMOTO Tatsuhiro TSUCHIYA Tohru KIKUNO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/10/01
Vol. E93-D  No. 10 ; pp. 2850-2853
Type of Manuscript:  LETTER
Category: Fundamentals of Information Systems
Keyword: 
self-stabilizationmaximal matchingtime complexitystabilization timedistributed computing
 Summary | Full Text:PDF(77.3KB)

General Impossible Differential Attack on 7-Round AES
Meiling ZHANG Weiguo ZHANG Jingmei LIU Xinmei WANG 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2010/01/01
Vol. E93-A  No. 1 ; pp. 327-330
Type of Manuscript:  LETTER
Category: Cryptography and Information Security
Keyword: 
AESgeneral impossible differential attacktime complexitydata complexity
 Summary | Full Text:PDF(352KB)

A Time- and Communication-Optimal Distributed Sorting Algorithm in a Line Network and Its Extension to the Dynamic Sorting Problem
Atsushi SASAKI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/02/01
Vol. E87-A  No. 2 ; pp. 444-453
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
distributed algorithmssortingtime complexitycommunication complexitydynamic sortingline network
 Summary | Full Text:PDF(377.9KB)

A Time-Optimal Distributed Arrangement Selection Algorithm in a Line Network
Atsushi SASAKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/02/01
Vol. E86-D  No. 2 ; pp. 228-237
Type of Manuscript:  Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: Parallel/Distributed Algorithms
Keyword: 
distributed algorithmsk-selectionsortingtime complexityline network
 Summary | Full Text:PDF(511.4KB)

Achieving Higher Success Probability in Time-Memory Trade-Off Cryptanalysis without Increasing Memory Size
Il-Jun KIM Tsutomu MATSUMOTO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/01/25
Vol. E82-A  No. 1 ; pp. 123-129
Type of Manuscript:  Special Section PAPER (Special Section on Cryptography and Information Security)
Category: 
Keyword: 
time-memory trade-offspace complexitysuccess probabilitytime complexity
 Summary | Full Text:PDF(935.8KB)

Efficient Private Information Retrieval
Toshiya ITOH 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/01/25
Vol. E82-A  No. 1 ; pp. 11-20
Type of Manuscript:  Special Section PAPER (Special Section on Cryptography and Information Security)
Category: 
Keyword: 
information retrievalprivacycommunication complexitytime complexitycovering codes
 Summary | Full Text:PDF(215.3KB)

The Firing Squad Synchronization Problem in Defective Cellular Automata
Martin KUTRIB Roland VOLLMAR 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1995/07/25
Vol. E78-D  No. 7 ; pp. 895-900
Type of Manuscript:  PAPER
Category: Automata, Languages and Theory of Computing
Keyword: 
defective cellular automatafiring squad synchronizationfault tolerancetime complexityparallel algorithms
 Summary | Full Text:PDF(536.2KB)

The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets
Toshimasa WATANABE Takenobu TANIDA Masahiro YAMAUCHI Kenji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/10/25
Vol. E75-A  No. 10 ; pp. 1407-1421
Type of Manuscript:  Special Section PAPER (Special Section on Application of Petri Nets to Concurrent System Design)
Category: 
Keyword: 
timed Petri netsschedulingapproximation algorithmstime complexityNP-hardness
 Summary | Full Text:PDF(1.1MB)

Scheduling a Task Graph onto a Message Passing Multiprocessor System
Tsuyoshi KAWAGUCHI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/06/25
Vol. E75-A  No. 6 ; pp. 670-677
Type of Manuscript:  Special Section PAPER (Special Section of Papers Selected from 1991 Joint Technical Conference on Circuits/Systems, Computers and Communications (JTC-CSCC '91))
Category: Combinational/Numerical/Graphic Algorithms
Keyword: 
schedulinga network, a routing algorithman optimization algorithmtime complexity
 Summary | Full Text:PDF(646.2KB)

Leaf Reduction Theorem on Time- and Leaf-Bounded Alternating Turing Machines
Hiroaki YAMAMOTO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/01/25
Vol. E75-D  No. 1 ; pp. 133-140
Type of Manuscript:  Special Section PAPER (Special Section on Theoretical Foundations of Computing)
Category: 
Keyword: 
alternating turing machinesleaf complexitytime complexityreduction theoremspeed-up theorem
 Summary | Full Text:PDF(616.3KB)

Optimal Grain Size Determination for Tree-Structured Parallel Programs
Tsuyoshi KAWAGUCHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/01/25
Vol. E75-D  No. 1 ; pp. 35-43
Type of Manuscript:  Special Section PAPER (Special Section on Theoretical Foundations of Computing)
Category: 
Keyword: 
time complexitymultiprocessorsan optimal schedulecommunication delay
 Summary | Full Text:PDF(656.1KB)