3228 search results - page 396 / 646 » Computationally Sound Proofs |
192
click to vote
ISAAC
2004
Springer
16 years 20 days ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
210
click to vote
TYPES
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
153
click to vote
FOCS
2003
IEEE
16 years 18 days ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
185
click to vote
IPPS
2002
IEEE
16 years 6 days ago
2002
IEEE
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and Chandy [4]. The examples illustrate a new theory for composition proposed by Ch...
191
click to vote
PRDC
2002
IEEE
16 years 6 days ago
2002
IEEE
In this paper, we present a consensus algorithm for synchronous distributed systems using cooperating mobile agents. The algorithm is designed within a framework for mobile agent ...