3690 search results - page 533 / 738 » Computation with classical sequents |
129
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
174
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
One of the main reasons of the recent success of peer to peer (P2P) file sharing systems such as BitTorrent is its built-in tit-for-tat mechanism. In this paper, we model the band...
164
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
163
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
186
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...