IEICE SEARCH SYSTEM

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: Special Section PAPER (Special Section on Frontier of Quantum Computing) Category: INVITED Keyword: quantum information, quantum computing, communication complexity, locally decodable codes, private information retrieval, finite automata, advised computation, quantum games,
	Summary \| Full Text:PDF (231.6KB)

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 retrieval, privacy of a user, secrecy of the database, consistency of answers, communication complexity,
	Summary \| Full Text:PDF (413.2KB)

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 algorithms, sorting, time complexity, communication complexity, dynamic sorting, line network,
	Summary \| Full Text:PDF (377.4KB)

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 retrieval, communication complexity, linear type, multilinear type, affine type,
	Summary \| Full Text:PDF (232.5KB)

Efficient Private Information Retrieval Toshiya ITOH
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/01/20 Vol. E82-A No. 1 pp. 11-20 Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security) Category: Keyword: information retrieval, privacy, communication complexity, time complexity, covering codes,
	Summary \| Full Text:PDF (218.9KB)

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/20 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 complexity, functional decomposition, overlapped decomposition, globals, Decomposition Don't Cares (DDC).,
	Summary \| Full Text:PDF (791.9KB)

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/20 Vol. E76-A No. 1 pp. 46-49 Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security) Category: Keyword: communication complexity, perfect ZKIP promise problem, quadratic residuosity,
	Summary \| Full Text:PDF (287.2KB)