尹   一通  Yin,  Yitong  I am a PhD candidate in the Theory Group in the Computer Science Department at Yale. My advisor is James Aspnes. Department of Computer Science Yale University 51 Prospect Street P.O. Box 208285 New Haven, CT 06520-8285

Research Interests

• Data structure lower bounds.
• Random structures and algorithms.
• Theory of distributed computing.
• Theoretical computer science in general.
  

Publications

• Cell-probe proofs and nondeterministic cell-probe complexity. (Lower bounds for nondeterministic data structures.)
  Yitong Yin.
  To appear in ICALP'08.
  
  
• Ranged hash functions and the price of churn.
  James Aspnes, 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.
  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.
  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.

TA

• CPSC 425 Theory of Distributed Computing, this semester.
  
• CPSC 465 Approximation Algorithms, fall 2007.
  
• CPSC 469 Randomized Algorithms, spring 2007.
  
• CPSC 112 Introduction to Programming, fall 2006.
•  CPSC 201 Introduction to Computer Science, spring 2006.
• CPSC 425 Theory of Distributed Systems, fall 2005.
  

Professional activities

Personal