2436 search results - page 14 / 488 » Comonadic Notions of Computation |
CSR
2006
Springer
13 years 11 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
SIAMCOMP
2011
13 years 2 months ago
2011
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
TCC
2012
Springer
12 years 3 months ago
2012
Springer
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
IFIPTCS
2010
13 years 5 months ago
2010
Abstract. We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncom...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...