I am a Ph.D. student in the Algorithms and Complexity group and the Systems and Networking group in the Computer Science department of the University of California, San Diego. I am advised by Ramamohan Paturi and Stefan Savage. My research interests include stream algorithms and network routing. I have some notes on useful techniques. Only slightly related to my work are the statues of Shannon that I have visited and my public key.

Publications

J. Ma, K. Levchenko, C. Kreibich, S. Savage, and G. M. Voelker. Unexpected Means of Protocol Inference. In Proc. of the 2006 Internet Measurement Conference, 2006.

A. R. Calderbank, A. Gilbert, K. Levchenko, S. Muthukrishnan, and M. Strauss. Improved Range-Summable Random Variable Construction Algorithms. In Proc. of the Sixteenth ACM-SIAM Symposium on Discrete Algorithms, January 2005. Note: There is a significant error in the paper; please see explanation.

K. Levchenko, R. Paturi, and G. Varghese. On the Difficulty of Scalably Detecting Network Attacks. In Proc. of the Eleventh ACM Conference on Computer and Communication Security, October 2004.

A. Gilbert and K. Levchenko. Compressing Network Graphs. Presented at the LinkKDD Workshop at the Tenth ACM Conference on Knowledge Discovery and Data Mining, August 2004.