9405 search results - page 305 / 1881 » Computing a Model of Set Theory |
198
click to vote
CALCO
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
145
click to vote
CRYPTO
2005
Springer
15 years 10 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
120
click to vote
ITNG
2007
IEEE
15 years 11 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
134
click to vote
PODS
2006
ACM
16 years 5 months ago
2006
ACM
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
110
Voted
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
We sketch how to express typical features of agent communication protocols in a simple temporal logic and show that conformance verification at runtime reduces to a generalised f...