612 search results - page 36 / 123 » Hardness assumptions in the foundations of theoretical compu... |
TCC
2009
Springer
14 years 8 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...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
Past research studying the operations of TCP over wireless/mobile ad hoc networks has shown that TCP cannot be adopted as-is for use in mobile ad hoc networks (MANET) to achieve r...