Tsinghua ITCS Theory Day (I)

time: Apr. 11, 2:00-5:00pm

The Institute for Theoretical Computer Science in Tsinghua University has initiated a Theory Day program, a one-day public workshop to be held each semester. This program is intended to communicate some of the exciting latest research results in theoretical computer science, especially those carried out in China. The talks are designed to convey the essence of the work, not only to the experts but also to the computer science community at large. Whether you are a specialist in this area, you will find the program stimulating.

The Theory Day inaugural program will be this Wednesday. Three brilliant young scientists of our institute will share their research results and insights with you. They are Dr. Xiaoming Sun (who graduated from our Institute in 2006), Xi Chen (fourth-year graduate student), and Pinyan Lu (second-year graduate student). Xiaoming’s research interests include quantum computing, quantum information and classical complexity. Xi’s interests lie in characterizing the computational complexity of natural problems in Algorithmic Game Theory and Computational Biology. And Pinyan’s interests are in complexity theory, algorithms design and algorithmic game theory.

Tsinghua ITCS Theory Day (II)

time: Apr. 12, 2:00-5:00pm

The Institute for Theoretical Computer Science in Tsinghua University has initiated a Theory Day program, a one-day public workshop to be held each semester. This program is intended to communicate some of the exciting latest research results in theoretical computer science, especially those carried out in China. The talks are designed to convey the essence of the work, not only to the experts but also to the computer science community at large. Whether you are a specialist in this area, you will find the program stimulating.

The Theory Day program II will be this Thursday. Three scientists will share their research results and insights with you. They are Professor Mike Paterson (who is a Professor of Department of Computer Science, University of Warwick, Coventry, CV4 7AL, United Kingdom), Professor Mario Szegedy (Rutgers University) and Professor Ran Raz (faculty of mathematics and computer science at the Weizmann Institute). Prof. Mike Paterson’s research interests include graph theory. Prof. Mario Szegedy’s interests are in complexity theory, combinatorics, combinatorial geometry and quantum computing. And Prof. Ran Raz’s interests lie in Boolean circuit complexity, Arithmetic circuit complexity, Communication complexity, Propositional proof theory, Probabilistic checkable proofs, Quantum computation and communication and Randomness and derandomization.