5793 search results - page 435 / 1159 » Individual communication complexity |
211
click to vote
SOFSEM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The increasing complexity of today’s embedded systems applications imposes the requirements and constraints of distributed, heterogeneous subsystem interaction to softw...
203
click to vote
ICDCS
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
214
click to vote
EUROCRYPT
2000
Springer
15 years 11 months ago
2000
Springer
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....
235
click to vote
COCO
2008
Springer
15 years 9 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
240
click to vote
FPL
2008
Springer
15 years 9 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...