17541 search results - page 3208 / 3509 » Complexity in scalable computing |
145
click to vote
FOCS
2009
IEEE
15 years 12 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ï...
183
click to vote
PRDC
2009
IEEE
15 years 12 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...
152
click to vote
ICIW
2009
IEEE
15 years 11 months ago
2009
IEEE
BitTorrent and Practical Network Coding are efï¬cient methods for sharing ï¬les in a peer-to-peer network. Both face the problem to distribute a given ï¬le using peers with dif...
156
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
âWhile it is a well known result that network coding achieves optimal ï¬ow rates in multicast sessions, its potential for practical use has remained to be a question, due to its...
168
click to vote
WOLLIC
2009
Springer
15 years 11 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of ï¬nite-valued logics by way of tableaux. The only requisite for applying the method is that the o...