Home

I graduated from Computer Science Department, Rutgers, The State University of New Jersey, under the supervision of Prof. Eric Allender and Prof. Michael Saks.

I am with Google now.

Education

Doctorate Computer Science Rutgers University
Master of Science Mathematics Rutgers University
Master of Science Computer Science Iowa State University
Bachelor of Sceince Computer Science Nanjing University

Publications

On Circuit Complexity Classes and Iterated Matrix Multiplication, Ph.D. Thesis.
On the Power of Algebraic Branching Programs of Width Two, (with Eric Allender), Proc. 38th International Colloquium on Automata, Languages, and Programming (ICALP), 2011, Lecture Notes in Computer Science 6755, pp. 736-747.
NEXP Does Not Have Non-uniform Quasipolynomial-size ACC Circuits of loglog n Depth, Proc. 8th Annual Conference on Theory and Applications of Models of Computation (TAMC), 2011, Lecture Notes in Computer Science 6648, pp. 164-170.
Extracting Kolmogorov Complexity with Applications to Dimension Zero-one Laws, (with Lance Fortnow, John Hitchcock, Aduri Pavan and N.V. Vinodchandran), Information and Computation 209(4) 627-636, 2011.
Uniform Derandomization from Pathetic Lower Bounds, (with Eric Allender, V Arvind and Rahul Santhanam), Proc. 14th International Workshop on Randomization and Computation (RANDOM/APPROX 2010), Lecture Notes in Computer Science 6302, pp. 380-393, 2010.
Robustness of PSPACE-complete Sets, (with Aduri Pavan), Information Processing Letters 103(3), pp. 102-104, 2007.
Hellinger Volume and Number-on-the-forehead Communication Complexity, (with Troy Lee, Nikos Leonardos, Michael Saks), Manuscript.

Page updated

Google Sites

Report abuse