Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Abstract--In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discretetime stochastic complex networks with randomly occurr...