352 search results - page 44 / 71 » Proofs as Polynomials |
101
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
77
Voted
ASM
2005
ASM
15 years 3 months ago
2005
ASM
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
93
Voted
TCC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
CRYPTO
2003
Springer
15 years 3 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...