5638 search results - page 90 / 1128 » On presence |
182
click to vote
CRYPTO
1990
Springer
15 years 10 months ago
1990
Springer
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
118
click to vote
PLDI
1990
ACM
15 years 10 months ago
1990
ACM
Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a h...
163
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
