440 search results - page 20 / 88 » On partial randomness |
SIGSOFT
2004
ACM
16 years 14 days ago
2004
ACM
Exploring alternative options is at the heart of the requirements and design processes. Different alternatives contribute to different degrees of achievement of non-functional goa...
80
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
106
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
SODA
2010
ACM
14 years 10 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
114
click to vote
EUROCRYPT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...