This paper proposes a novel Nyquist-rate analog-to-digital (A/D) conversion algorithm which achieves exponential accuracy in the bit-rate despite using imperfect components. The p...
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Neural reliability and stochastic synchronization are remarkable features of real neurons with important consequences for neural computation. Both phenomena are general properties...
We describe a simple but general method to analyze networks of coupled identical nonlinear oscillators, and study applications to fast synchronization, locomotion, and schooling. ...