3228 search results - page 347 / 646 » Computationally Sound Proofs |
130
click to vote
ANTS
2004
Springer
15 years 9 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
137
click to vote
JELIA
2004
Springer
15 years 9 months ago
2004
Springer
We describe ongoing research to support the construction of terminologies with Description Logics. For the explanation of subsumption we search for particular concepts because of t...
132
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
107
click to vote
CRYPTO
2003
Springer
15 years 9 months ago
2003
Springer
In 1992, Dwork and Naor proposed that e-mail messages be accompanied by easy-to-check proofs of computational effort in order to discourage junk e-mail, now known as spam. They pro...
118
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...