Sciweavers

1114 search results - page 104 / 223
» Better Construction with Factories
Sort
View
117
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
A Closer Look at Anonymity and Robustness in Encryption Schemes
Abstract. In this work, we take a closer look at anonymity and robustness in encryption schemes. Roughly speaking, an anonymous encryption scheme hides the identity of the secret-k...
Payman Mohassel
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 1 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
127
Voted
CGO
2008
IEEE
15 years 7 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout
111
Voted
DNA
2004
Springer
132views Bioinformatics» more  DNA 2004»
15 years 6 months ago
Error Free Self-assembly Using Error Prone Tiles
DNA self-assembly is emerging as a key paradigm for nano-technology, nano-computation, and several related disciplines. In nature, DNA self-assembly is often equipped with explicit...
Ho-Lin Chen, Ashish Goel
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 23 days ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett