3852 search results - page 644 / 771 » Construction of Codes for Network Coding |
163
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
169
click to vote
LCPC
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. As parallelism in microprocessors becomes mainstream, new programming languages and environments are emerging to meet the challenges of parallel programming. To support r...
168
Voted
REFLECTION
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Using mobile agent systems, cooperative distributed applications that run over the Internet can be constructed flexibly. However, there are some problems: it is difficul...
170
click to vote
SPDP
1993
IEEE
15 years 10 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
201
click to vote
TIT
2010
15 years 26 days ago
2010
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...