380 search results - page 60 / 76 » The End of Science Revisited |
164
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We show that the Tile Assembly Model exhibits a strong notion of universality where the goal is to give a single tile assembly system that simulates the behavior of any other tile...
196
click to vote
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
155
click to vote
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
158
click to vote
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
144
click to vote
FOCS
2007
IEEE
16 years 15 days ago
2007
IEEE
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...