The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
Dynamic load balancing is a popular recent technique that protects ISP networks from sudden congestion caused by load spikes or link failures. Dynamic load balancing protocols, ho...
Srikanth Kandula, Dina Katabi, Shantanu Sinha, Art...
While the Internet is hardly “broken”, it has proved unable to integrate new ideas, new architectures, and provide paths for future integration of data, voice, rich media and ...
Thrasyvoulos Spyropoulos, Serge Fdida, Scott Kirkp...