Boolean functions are perhaps the most basic objects of study in theoretical computer
science. They also arise in other areas of mathematics, including combinatorics, statistical …

This is a survey of pseudorandomness, the theory of efficiently generating objects that" look
random" despite being constructed using little or no randomness. This theory has …

We show that any distribution on {-1,+1\}^n that is k-wise independent fools any halfspace
(or linear threshold function) h:{-1,+1\}^n→{-1,+1\}, ie, any function of the form …

We present a new approach to constructing pseudorandom generators that fool low-degree
polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain …

Since many existing techniques for exploiting CPU caches in the implementation of B-tree
indexes have not been discussed in the literature, most of them are surveyed. Rather than …

We consider the problem of testing if a given function f: F 2 n→ F 2 is close to any degree d
polynomial in n variables, also known as the Reed-Muller testing problem. Alon et al.[1] …

We prove that the sum of d small-bias generators L: F^ s → F^ n fools degree-d polynomials
in n variables over a field F, for any fixed degree d and field F, including F= F _ 2={0, 1\}. Our …

We construct pseudorandom generators of seed length Õ (log (n)· log (1/є)) that є-fool
ordered read-once branching programs (ROBPs) of width 3 and length n. For unordered …

We present an iterative approach to constructing pseudorandom generators, based on the
repeated application of mild pseudorandom restrictions. We use this template to construct …

Constant parallel-time cryptography allows to perform complex cryptographic tasks at an
ultimate level of parallelism, namely by local functions that each of their output bits depend …