Sciweavers

13214 search results - page 9 / 2643
» Pseudorandomness for network algorithms
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 11 months ago
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
MOBIHOC
2004
ACM
15 years 11 months ago
Frequency rolling: a cooperative frequency hopping for mutually interfering wpans
A Wireless Personal Area Network (WPAN) provides wireless links among proximate devices, usually carried by an individual. As WPAN gains momentum in ubiquitous usage, the interfer...
Petar Popovski, Hiroyuki Yomo, Sebastien Aprili
90
Voted
EUROCRYPT
1999
Springer
15 years 4 months ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold
86
Voted
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
15 years 1 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
84
Voted
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 5 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith