## Biography

Krishnamurthy Viswanathan received the B.Tech. degree in electrical engineering from the Indian Institute of Technology, Madras, in 1999, and the M.S. and Ph.D. degress in electrical engineering from University of California, San Diego, in 2001 and 2005 respectively. He is with Hewlett Packard Labs, where he currently works on algorithms and platforms for large scale machine learning.

## Publications

**Selected publications (by research topic) **

Complete list**Estimation over large alphabets**

- A. Orlitsky, N.P. Santhanam, K. Viswanathan and J. Zhang, ``On modeling profiles instead of values,'' in Proceedings of Uncertainty in Artificial Intelligence (UAI), July 2004.
- A. Orlitsky, N.P. Santhanam, K. Viswanathan and J. Zhang, ``Limit results on pattern entropy,'' IEEE Transactions on Information Theory, July 2006

**Denoising and string reconstruction **

- K. Viswanathan and R. Swaminathan, ``Improved string reconstruction over insertion deletion channels," in Proceedings of 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2008.
- K. Viswanathan and E. Ordentlich, ``Lower limits of discrete universal denoising,'' IEEE Transactions on Information Theory, March 2009.
- E. Ordentlich, K. Viswanathan and M.J. Weinberger, ``Twice-universal denoising,'' IEEE Transactions on Information Theory, January 2013.

**Data streams**

- K. Viswanathan, ``On the memory required to compute functions of streaming data,'' in Proceedings of the 2010 IEEE International Symposium on Information Theory (ISIT), June 2010.
- K. Viswanathan, ``Information-theoretic analysis of function computation on streams,'' in Proceedings of the Fort-eighth Annual Allerton Conference on Communication, Control and Computing}, October 2010.
- V. Misra and K. Viswanathan, ``Sequential functional quantization,'' submitted to the 2013 IEEE International Symposium on Information Theory (ISIT), July 2013.

**Data Compression**

- A. Orlitsky and K. Viswanathan, ``Practical protocols for interactive communication,'' in Proceedings of the 2001 IEEE International Symposium on Information Theory (ISIT), June 2001.
- K. Viswanathan and R. Swaminathan, ``Framework and algorithms for collaborative compression,'' in Proceedings of the 2001 IEEE International Symposium on Information Theory (ISIT), July 2008.

**Anomaly detection in data centers**

- K. Viswanathan, C. Lakshminarayan, V. Talwar, C. Wang, G. Macdonald, W. Satterfield, ``Ranking anomalies in data centers,'' in Proceedings of IEEE/IFIP Network Operations and Management Symposium, NOMS 2012, April 2012.

**Error-correcting codes**

- A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang, ``Stopping sets and the girth of Tanner graphs,'' in Proceedings of 2002 IEEE International Symposium on Information Theory (ISIT), June 2002.
- A. Orlitsky, K. Viswanathan and J. Zhang, ``Stopping set distribution of LDPC code ensembles,'' IEEE Transactions on Information Theory, March 2005.
- R.M. Roth and K. Viswanathan, ``On the hardness of decoding the Gale-Berlekamp code,'' IEEE Transactions on

Information Theory, March 2008.