769 search results - page 32 / 154 » Where Is the Proof |
ACNS
2009
Springer
13 years 11 months ago
2009
Springer
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicio...
RSA
2010
13 years 6 months ago
2010
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
CONCUR
2005
Springer
14 years 1 months ago
2005
Springer
We propose a formalisation of the notion of transaction, using a variant of CCS, RCCS, that distinguishes reversible and irreversible actions, and incorporates a distributed backtr...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
IPL
2002
13 years 7 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...