268 search results - page 12 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
CRYPTO
2000
Springer
15 years 1 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
DSN
2002
IEEE
15 years 2 months ago
2002
IEEE
We present ideas on how to structure software systems for high availability by considering MTTR/MTTF characteristics of components in addition to the traditional criteria, such as...
ISCI
2008
14 years 9 months ago
2008
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
APLAS
2003
ACM
15 years 2 months ago
2003
ACM
This paper introduces a Standard ML realization of the scrap-yourboilerplate generic-programming mechanism (first introduced by Simon Peyton Jones and Ralf Lämmel), which gives ...
160
Voted
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...