Sciweavers

608 search results - page 20 / 122
» Random Systems with Complete Connections
Sort
View
FOCS
2000
IEEE
14 years 2 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
SIGAL
1990
273views Algorithms» more  SIGAL 1990»
14 years 1 months ago
Randomized Broadcast in Networks
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli ...
CN
2010
121views more  CN 2010»
13 years 6 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
SOUPS
2009
ACM
14 years 4 months ago
Games for extracting randomness
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
Ran Halprin, Moni Naor
WIMOB
2008
IEEE
14 years 4 months ago
Random Beacon for Privacy and Group Security
Abstract—Most contemporary security mechanisms and protocols include exchange of random or time-variant nonces as an essential means of protection against replay and other threat...
Aleksi Saarela, Jan-Erik Ekberg, Kaisa Nyberg