2738 search results - page 494 / 548 » The Frobenius Problem and Its Generalizations |
118
click to vote
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
PKC
2009
Springer
15 years 10 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
164
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
175
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Entity Resolution (ER) is an important real world problem that has attracted significant research interest over the past few years. It deals with determining which object descript...