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

Publications

C. Kanich, C. Kreibich, K. Levchenko, B. Enright, V. Paxson, G. M. Voelker, and S. Savage. Spamalytics: an Empirical Analysis of Spam Marketing Conversion. To be presented at CCS 2008.

K. Levchenko, G. M. Voelker, R. Paturi, and S. Savage. XL: An Efficient Network Routing Algorithm. To be presented at SIGCOMM 2008.

C. Kreibich, C. Kanich, K. Levchenko, B. Enright, G. M. Voelker, V. Paxson, and S. Savage. On The Spam Campaign Trail. LEET 2008 (workshop).

C. Kanich, K. Levchenko, B. Enright, G. M. Voelker, and S. Savage. The Heisenbot Uncertainty Problem: Challenges in Separating Bots from Chaff. LEET 2008 (workshop).

J. Ma, K. Levchenko, C. Kreibich, S. Savage, and G. M. Voelker. Unexpected Means of Protocol Inference. IMC 2006.

A. R. Calderbank, A. Gilbert, K. Levchenko, S. Muthukrishnan, and M. Strauss. Improved Range-Summable Random Variable Construction Algorithms. SODA 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. CCS 2004.

A. Gilbert and K. Levchenko. Compressing Network Graphs. Presented at the LinkKDD 2004 (workshop).