1. A. Andoni , M. S. Charikar , O. Neiman , and H. L. Nguyen . Near linear lower bound for dimension reduction in ℓ_1 . In Proc.of the 52nd Ann. IEEE Symp. on Foundations of Computer Science , pages 315– 323 , 2011 . A. Andoni, M. S. Charikar, O. Neiman, and H. L. Nguyen. Near linear lower bound for dimension reduction in ℓ_1. In Proc.of the 52nd Ann. IEEE Symp. on Foundations of Computer Science, pages 315–323, 2011.
2. Heat and Dump: competitive distributed paging
3. A Polylogarithmic-Competitive Algorithm for the k-Server Problem
4. A primal-dual randomized algorithm for weighted paging
5. N. Bansal , N. Buchbinder , and J. Naor . Towards the randomized k-server conjecture: A primal-dual approach . In Proc. of the 21st Ann. ACM-SIAM Symp. on Discrete Algorithms , pages 40– 55 , 2010 . N. Bansal, N. Buchbinder, and J. Naor. Towards the randomized k-server conjecture: A primal-dual approach. In Proc. of the 21st Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 40–55, 2010.