335 search results - page 30 / 67 » Compact Proofs of Retrievability |
LPNMR
2001
Springer
14 years 4 days ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
AMAST
2000
Springer
14 years 2 days ago
2000
Springer
The primary objective of this paper is to present the deÿnition of a new dynamic, linear and modal logic for security protocols. The logic is compact, expressive and formal. It a...
ESA
1994
Springer
13 years 11 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
21
Voted
MFCS
1993
Springer
13 years 11 months ago
1993
Springer
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
CCA
2009
Springer
13 years 11 months ago
2009
Springer
We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent u...