288 search results - page 24 / 58 » random 1998 |
105
Voted
FSE
1998
Springer
15 years 4 months ago
1998
Springer
In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, "random" nonces, and other values...
85
Voted
WSC
1998
15 years 1 months ago
1998
A simulation model is composed of inputs and logic; the inputs represent the uncertainty or randomness in the system, while the logic determines how the system reacts to the uncer...
58
Voted
RSA
1998
15 years 2 days ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
108
Voted
SIAMCOMP
1998
15 years 2 days ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
143
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...