7820 search results - page 1180 / 1564 » Formalization of Time and Space |
144
click to vote
CRYPTO
2000
Springer
15 years 11 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...
186
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
175
click to vote
ACISP
2003
Springer
15 years 10 months ago
2003
Springer
In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member may be allowed to generate signatures up to a certain numb...
233
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
195
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we report on an interactive system and the results ofa formal user study that was carried out with the aim of comparing two approaches to estimating users' int...