dxiao

English | Français | 中文 | עברית

About Me

Welcome to my home page. I am a graduate student at Princeton in theory of computation, focusing on complexity theory and cryptography. I am co-advised by Boaz Barak and Avi Wigderson (IAS).

Prior to Princeton I studied at Harvard College where I earned AB and SM degrees (2003) in computer science under the supervision of Salil Vadhan, and at Université Paris VI Pierre et Marie Curie where I earned a maîtrise (2004) in pure mathematics.

Here is my CV [PS, PDF].

Publications

Complexity

• "On basing ZK != BPP on the hardness of PAC learning " [PS, PDF]
  D. Xiao. CCC 2009, to appear.
• "On basing lower-bounds for learning on worst-case assumptions" [PS, PDF]
  B. Applebaum, B. Barak, D. Xiao. FOCS 2008
• "Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators and applications" [PS, PDF]
  A. Wigderson and D. Xiao, Theory of Computing, Vol. 4 #3 (2008)
• "A randomness-efficient sampler for matrix-valued functions and applications" [PS, PDF]
  A. Wigderson and D. Xiao, FOCS 2005

Cryptography and Security

• "Path-Quality Monitoring in the Presence of Adversaries" [PS, PDF]
  S. Goldberg, D. Xiao, E. Tromer, B. Barak, and J. Rexford. SIGMETRICS 2008
• "Protocols and Lower Bounds for Failure Localization in the Internet" [PS, PDF]
  B. Barak, S. Goldberg, and D. Xiao. EUROCRYPT 2008

Graph theory

• "The Evolution of Expander Graphs " [PS, PDF]
  D. Xiao, AB thesis, Harvard College 2003

Miscellaneous

• "Estimating and Comparing Entropy Across Written Natural Languages Using PPM Compression", [PS, PDF]
  F. Behr, V. Fossum, M. Mitzenmacher, D. Xiao, Data Compression Conference 2003