How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
SIAM Journal on Computing
On the power of two-point based sampling
Journal of Complexity
A time-randomness trade-off for oblivious routing
SIAM Journal on Computing
Realistic analysis of some randomized algorithms
Journal of Computer and System Sciences
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Expected time bounds for selection
Communications of the ACM
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm to fill out a bloc with pseudorandom binary data
CEA'10 Proceedings of the 4th WSEAS international conference on Computer engineering and applications
Quasi-random rumor spreading: Reducing randomness can be costly
Information Processing Letters
The power of simple tabulation hashing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Randomized quicksort and the entropy of the random source
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The Power of Simple Tabulation Hashing
Journal of the ACM (JACM)
Golden ratio versus pi as random sequence sources for Monte Carlo integration
Mathematical and Computer Modelling: An International Journal
SIAM Journal on Computing
| Hi-index | 0.01 |