123 search results - page 15 / 25 » Derandomizing from Random Strings |
ALT
2008
Springer
14 years 4 months ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
CC
2007
Springer
13 years 7 months ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
ECCC
2010
13 years 7 months ago
2010
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...
WISEC
2010
ACM
14 years 5 days ago
2010
ACM
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...