Research
Developing efficient algorithms that power faster, smarter, and more reliable computing across diverse applications.
We present the first non-trivial online algorithms for the classical multi-commodity buy-at-bulk problem. The goal is to provision a low-cost network over time to support bandwidth demands that also arrive over time. Previously, online algorithms…
It is quite easy to believe that the recently proposed approach to machine translation, called neural machine translation, is simply yet another approach to statistical machine translation. This belief may drive research effort toward (incrementally)…
In the setting of cloud computing a user wishes to delegate its data, as well as computations over this data, to a cloud provider. Each computation may read and modify the data, and these modifications…
Interactive proofs have had a dramatic impact on Complexity Theory and Cryptography. In particular, the celebrated IP=PSPACE Theorem [LFKN92,Shamir92] allows an all-powerful but untrusted prover to convince a polynomial-time verifier of the validity of extremely…
Many discrete algorithms for convex optimization and online learning can be interpreted as a discretization of a continuous-time process. Perhaps the simplest and oldest example is gradient descent, which is the discretization of the ODE…
Homomorphic encryption is an encryption function which permits encrypted data to be computed without decryption. It is considered as a solution for protecting privacy information in present situations such as cloud computing and machine communication.…
