13603 search results - page 2450 / 2721 » On the Complexity of Computing Treelength |
161
click to vote
FOCS
2009
IEEE
16 years 1 months 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...
177
click to vote
FOCS
2009
IEEE
16 years 1 months 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...
212
click to vote
PRDC
2009
IEEE
16 years 1 months ago
2009
IEEE
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
178
click to vote
ICIW
2009
IEEE
16 years 1 months ago
2009
IEEE
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
190
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—While it is a well known result that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its...