Yitong's Homepage

Image
  Image
Yin,  Yitong 



In September 2009, I joined the LAMDA group in the Department of Computer Science & Technology at Nanjing University.

Before that, I was a PhD candidate in the Theory Group in the Computer Science Department at Yale University, under the supervision of James Aspnes.

I defended my dissertation in June 2009. The title of my thesis is:
          "Hashing, Contention, and Cell-Probe Proofs"
[thesis] [slides]

My Erdős number is 3.
                   theory is (modern) art



Contact

Office: 406, MengMinwei Building,
Main Campus of Nanjing University
Postal Address: Yitong Yin
National Key Laboratory for Novel Software Technology,
Nanjing University, Mailbox 419,
Hankou Road 22,
Nanjing 210093, China
Email:Image

Research Interests

My research area is Theoretical Computer Science. My interests include:
  • Data structure complexity theory.
  • Random structures and randomized algorithms.
  • Theory of parallel and distributed computing.
  • Topics in learning theory.

Teaching

In Spring 2010, I will teach Randomized Algorithms. The course wiki pages are:

Publications

To whom it may concern:
* In computer science area, conference is a more important way of publication than journal.
** In the area of theoretical computer science, authors of a paper are usually sorted alphabetically according to last names.

Assigning Tasks for Efficiency in Hadoop.
Michael J. Fischer, Xueyuan Su, and Yitong Yin.
To appear in Proccedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2010.

Low-Contention Data Structures.
James Aspnes, David Eisenstat, and Yitong Yin.
To appear in Proccedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2010.

Cell-probe proofs.
Yitong Yin.
Accepted to ACM Transactions on Computation Theory.

Cell-probe proofs and nondeterministic cell-probe complexity. [PDF]
Yitong Yin.
In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), July 2008, pages 72–83.

Ranged hash functions and the price of churn. [PDF]
James Aspnes, Shmuel(Muli) Safra, and Yitong Yin.
In Proceedings of the 19th annual ACM-SIAM symposium on Discrete algorithms (SODA), January 2008, pages 1066–1075.

Path-independent load balancing with unreliable machines. [PDF]
James Aspnes, Yang Richard Yang, and Yitong Yin.
In Proceedings of the 18th annual ACM-SIAM symposium on Discrete algorithms (SODA), January 2007, pages 814–823.

Fast construction of overlay networks. [PDF]
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, and Yitong Yin.
In Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), July 2005, pages 145–154.

Personal

I grew up in Dalian, a coastal city in Liaoning Province, China.

From 1999 to 2003, I spent four wonderful years in Nanjing University, where I met my beloved wife Yang Zhang.
In 2009, after six years of studying overseas, we come back and join the faculty of Nanjing University.

Image
  Name Size
- email.png 13.07 KB
- icalp08-cpp.pdf 178.20 KB
- name.png 5.27 KB
- nju.gif 184.09 KB
- slides.pdf 4.67 MB
- soda07-balance.pdf 246.53 KB
- soda08-hash.pdf 248.68 KB
- spaa05-construction.pdf 164.05 KB
- theory.jpg 50.39 KB
- thesis.pdf 1.11 MB

PoweredBy | Designed for FireFox 3+ and IE 7+