Sciweavers

932 search results - page 36 / 187
» Uniform Random Number Generators
Sort
View
ECCC
2010
103views more  ECCC 2010»
14 years 9 months ago
Pseudorandom Generators for Regular Branching Programs
We give new pseudorandom generators for regular read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is either 0 or 2...
Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
HPCA
1997
IEEE
15 years 1 months ago
Global Address Space, Non-Uniform Bandwidth: A Memory System Performance Characterization of Parallel Systems
Many parallel systems offer a simple view of memory: all storage cells are addresseduniformly. Despite a uniform view of the memory, the machines differsignificantly in theirmemo...
Thomas Stricker, Thomas R. Gross
FOCS
2000
IEEE
15 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
CRYPTO
2010
Springer
145views Cryptology» more  CRYPTO 2010»
14 years 10 months ago
Protocols for Multiparty Coin Toss with Dishonest Majority
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC...
Amos Beimel, Eran Omri, Ilan Orlov
CP
2004
Springer
15 years 3 months ago
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoo...