I am currently organizing a seminar on Communication Complexity at NJU Summer 2019! Seminar website here
My name is Zelin Lv and my friends know me as Bobby.
I am a senior student majoring in Computer Science (honors) and Mathematics at the University of Wisconsin-Madison, where my advisor is Prof. Dieter Van Melkebeek. I am interested broadly in theoretical computer science, particularly in Communication Complexity, Algebra and Computation, and Circuit Complexity.
Ring Morphism Problems and Circuit Minimization [This work shows that given an oracle of MCSP, deciding if two given rings are isomorphic can be done in RP, and finding automorphism of one ring can be done in ZPP.]
'Canonical' Form and Faster Algorithm of Ribbon Graph [This work mainly deals with problems of computing omputing homology of moduli spaces of curves. By introducing a new concept: 'Canonical form' of ribbon graphs, we manage to reduce the time of comparing isomorphisms between 2 ribbon graphs.][Code]
Online Bipartite Matching [Scribed Lecture Note for Advanced Algorithms]
Non-Uniform ACC Circuit Lower Bounds [Paper reading note]
Super Resolution with Generative Adversarial Networks
Image Style Transfer
Directed Reading Program of the Department of Mathematics, at the University of Wisconsin - Madison: