Keyword : communication complexity


Quantum Random Access Coding
Harumichi NISHIMURA Rudy RAYMOND 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/05/01
Vol. E92-A  No. 5 ; pp. 1268-1275
Type of Manuscript:  INVITED PAPER (Special Section on Frontier of Quantum Computing)
Category: 
Keyword: 
quantum informationquantum computingcommunication complexitylocally decodable codesprivate information retrievalfinite automataadvised computationquantum games
 Summary | Full Text:PDF

A Private and Consistent Data Retrieval Scheme with Log-Squared Communication
Satoshi NAKAYAMA Maki YOSHIDA Shingo OKAMURA Toru FUJIWARA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2007/01/01
Vol. E90-A  No. 1 ; pp. 204-215
Type of Manuscript:  Special Section PAPER (Special Section on Cryptography and Information Security)
Category: Application
Keyword: 
data retrievalprivacy of a usersecrecy of the databaseconsistency of answerscommunication complexity
 Summary | Full Text:PDF

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

On Lower Bounds for the Communication Complexity of Private Information Retrieval
Toshiya ITOH 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/01/01
Vol. E84-A  No. 1 ; pp. 157-164
Type of Manuscript:  Special Section PAPER (Special Section on Cryptography and Information Security)
Category: 
Keyword: 
private information retrievalcommunication complexitylinear typemultilinear typeaffine type
 Summary | Full Text:PDF

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

Overlapped Decompositions for Communication Complexity Driven Multilevel Logic Synthesis
Kuo-Hua WANG Ting-Ting HWANG Cheng CHEN 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1993/09/25
Vol. E76-D  No. 9 ; pp. 1075-1084
Type of Manuscript:  Special Section PAPER (Special Issue on Synthesis and Verification of Hardware Design)
Category: Logic Synthesis
Keyword: 
communication complexityfunctional decompositionoverlapped decompositionglobalsDecomposition Don't Cares (DDC).
 Summary | Full Text:PDF

Communication Complexity of Perfect ZKIP for a Promise Problem
Kaoru KUROSAWA Takashi SATOH 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/01/25
Vol. E76-A  No. 1 ; pp. 46-49
Type of Manuscript:  Special Section PAPER (Special Section on Cryptography and Information Security)
Category: 
Keyword: 
communication complexityperfect ZKIP promise problemquadratic residuosity
 Summary | Full Text:PDF