10392 search results - page 441 / 2079 » Introduction to Computer Science |
235
click to vote
FOCS
2002
IEEE
16 years 15 days ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
200
click to vote
FOCS
2002
IEEE
16 years 15 days ago
2002
IEEE
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
177
click to vote
FOCS
1999
IEEE
15 years 12 months ago
1999
IEEE
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose
183
click to vote
RTA
1999
Springer
15 years 11 months ago
1999
Springer
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...