50 search results - page 8 / 10 » focs 2000 |
141
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Shannon [Sha48, Sha49] in celebrated works had shown that n bits of shared key is necessary and suļ¬cient to transmit n-bit classical information in an information-theoretically ...
161
click to vote
FOCS
2009
IEEE
16 years 20 days ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
176
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
157
click to vote
IPL
2000
15 years 5 months ago
2000
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environ...
162
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...