PhD thesis: "Coordination Mechanisms and Online Algorithms". University of California, Los Angeles. 2004.
BTech thesis: "On k-well-coverability". IIT Bombay. 1997.
"Coordination Mechanisms". George Christodoulou, Elias Koutsoupias, and Akash Nanavati. Theoretical Computer Science, Vol 410, Issue 36, August 2009.
"Minimum failure explanations for path vector routing changes". Mohit Lad, Dan Massey, Adam Meyerson, Akash Nanavati, and Lixia Zhang. Journal of Combinatorial Optimization. September 2006, Volume 12, Issue 1, pp 5-16.
"Randomized Online Algorithms for Minimum Metric Bipartite Matching". Adam Meyerson, Akash Nanavati, and Laura Poplawski. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
"Coordination Mechanisms". George Christodoulou, Elias Koutsoupias, and Akash Nanavati. International Colloquium on Automata, Languages, and Programming (ICALP), July 2004, LNCS 3142, pp. 345-357, Springer-Verlag.
"An Algorithmic Approach to Identifying Link Failures". Mohit Lad, Akash Nanavati, Dan Massey, and Lixia Zhang. Pacific Rim Dependable Computing (PRDC), March 2004, pp. 25-34.
"A Probabilistic Approach to Buffer Insertion". Vishal Khandelwal, Azadeh Davoodi, Akash Nanavati, and Ankur Srivastava. Int'l Conf. Computer Aided Design (ICCAD), November 2003, pp. 560-567. BEST PAPER AWARD NOMINEE.
"The Online Matching Problem On a Line". Elias Koutsoupias and Akash Nanavati. Workshop on Approximation and Online Algorithms (WAOA), September 2003, LNCS 2909, pp. 179-191, Springer-Verlag.