We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
Manish Airy, Sandeep Bhadra, Robert W. Heath Jr., ...
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...