Zhenming Liu

Ph.D. candidate

Harvard School of Engineering and Applied Science

Maxwell Dworkin 138

33 Oxford Street

Cambridge, MA 02138

Office Phone: 617-496-7007

zliu [at] eecs [dot] Harvard.edu

I am a Ph.D. candidate in Theory of Computation Group at Harvard. I received a B.Eng. from the Hong Kong University of Science and Technology and an S.M from Harvard. My academic advisor is Michael Mitzenmacher.

I am now interning in the Theory group of Microsoft Research Asia (from July 2009 to Dec 2009). See here for my resume.

Research Interests

The design and analysis of algorithms, random process, network analysis, and information theory.

Teaching

Teaching Fellow for CS 222 (Algorithms at the end of the wire) in spring 2009,

Teaching Fellow for CS 226R (Efficient Algorithms) in fall 2008,

Teaching Fellow for AM 21B (Math methods in the Sciences) in spring 2008.

Publications

1. Influence maximization in social networks when negative opinion may emerge and propagate

with W. Chen, A. Collins, R. Cummings, T. Ke, D. Rincon, X. Sun, Y. Wang, W. Wei, Y. Yuan, submitted

2. A game theoretic framework to identify overlapping communities in social network

with W. Chen, X. Sun, and Y. Wang [pdf], submitted

3. Intension-disguised algorithmic trading

with W. Yuen, P. Syverson, and C. Thorp, Financial Cryptograph 2010 (short paper).

4. Testing k-wise independence over streaming data

with K-M Chung and M. Mitzenmacher [pdf] submitted.

5. Designing floating codes for expected performance

with F. Chierichetti, H. Finucane, Z. Liu, M. Mitzenmacher [pdf] to appear in IEEE Transactions on Information Theory. A preliminary version [pdf] appeared in Allerton 2008.

6. Codes for deletion and insertion channels with segmented errors”

with M. Mitzenmacher [ps] to appear in IEEE Transactions on Information Theory; A preliminary version [pdf] appeared in IEEE International Symposium on Information Theory, ISIT’2007.

7. The structure of optimal prefix-free codes in restricted languages: the uniform probability case (extended abstract)

with M. J. Golin, [pdf] in Proceedings of the 2005 Workshop on Algorithms and Data Structures (WADS'05)”. August 2005.

Coursework

· CS 220: Cryptography

· CS 221: Computational Complexity

· CS 222: Algorithms at the Ends of the Wire

· CS 223: Probabilistic Analysis and Algorithms

· CS 225: Pseudorandomness

· CS 228: Computational Learning Theory

· (MIT) 6.854: Advanced Algorithms

· CS 286R: Computational Finance

· CS 286R: Social Computing

· CS 262: Distributed Computing

· Econ 2146: Computational Economics

· STAT 210: Probability Theory

· AM 206: Applied Algebra and Combinatorics

· Math 137: Algebraic Geometry

Personal

I have a Chinese blog and a douban account.

Some random stuff here;

My hometown in 1980.