Craig Gentry, Zulfikar Ramzan and David P. Woodruff. Explicit Exclusive Set Systems with Applications to Broadcast Encryption. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 27-38, October 21-24, 2006, Berkeley, California, USA.
David P. Woodruff. Better Approximations for the Minimum Common Integer Partition Problem. The 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006), pp. 248-259, August 28-30, 2006, Barcelona, Spain.
Piotr Indyk and David P. Woodruff. Polylogarithmic Private Approximations and Efficient Matching. The 3rd Theory of Cryptography Conference (TCC 2006), pp. 245-264, March 4-7, 2006,New York, NY, USA.
Piotr Indyk and David P. Woodruff. Fast Algorithms for the Free Riders Problem in Broadcast Encryption. The 26th Annual International Cryptology Conference (CRYPTO 2006), pp. 308-325, August 20-24, 2006, California, USA.
Pinyan Lu, Shanghua Teng, Changyuan Yu. Truthful Auctions with Optimal Profit. The 2nd international Workshop on Internet & Network Economics (WINE 2006), pp. 27-36, December 15 – 17, 2006, Patra, GREECE.
Xi Chen, Xiaotie Deng and Shang-Hua Teng. Sparse Games are Hard. The 2nd international Workshop on Internet & Network Economics (WINE 2006), pp. 262-273, December 15 – 17, 2006, Patra, GREECE.
Xi Chen, Xiaotie Deng and Shang-Hua Teng. Market Equilibria with Hybrid Linear-Leontief Utilities. The 2nd international Workshop on Internet & Network Economics (WINE 2006), pp. 274-285, December 15-17, 2006, Patra, GREECE.
Xi Chen and Xiaotie Deng. A Simplicial Approach for Discrete Fixed Point Theorems. The 12th Annual International Computing and Combinatorics Conference (COCOON 2006), pp. 3-12, August 15-18, 2006, Taipei, Taiwan.
Xi Chen, Xiaotie Deng and Becky Jie Liu. On Incentive Compatible Competitive Selection Protocol. The 12th Annual International Computing and Combinatorics Conference (COCOON 2006), pp. 13-22, August 15-18, 2006, Taipei, Taiwan.
Xi Chen and Xiaotie Deng. On the Complexity of 2D Discrete Fixed Point Problem. The 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), pp. 489-500, July 9–16, 2006, Venice, Italy.
Xi Chen and Xiaotie Deng. Lattice Embedding of Direction-Preserving Correspondence Over Integrally Convex. The 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM 2006), pp. 53-63, June 20-22, 2006, Hong Kong, China.
Jinyi Cai, Pinyan Lu. On Symmetric Signatures in Holographic Algorithms. Electronic Colloquium on Computational Complexity, Report No.135,2006.
Jinyi Cai, Pinyan Lu. Holographic Algorithms: From Art to Science. Electronic Colloquium on Computational Complexity, Report No.145,2006.
Yanhong A. Liu, Chen Wang, Michael Gorbovitski, Tom Rothamel, Yongxi Cheng, Yingchao Zhao, Jing Zhang. Core role-based access control: efficient implementations by transformations. ACM SIGPLAN 2006 Workshop on Partial Evaluation and Program Manipulation (PEPM 2006), pp. 112-120, January 9-10, 2006, Charleston, South Carolina, USA.
Xi Chen and Xiaotie Deng. On Algorithms for Discrete and Approximate Brouwer Fixed Points. The 37th ACM Symposium on Theory of Computing (STOC 2005), pp. 323-330, May 22-24, 2005, Baltimore, MD, USA.
Xiaoming Sun, Runyao Duan, Mingsheng Ying. The Existence of Quantum Entanglement Catalysts. IEEE Transactions on Information Theory, Vol.51,No.1,pp.75-80,2005.
Lan Liu, Xi Chen, Jing Xiao and Tao Jiang. Complexity and Approximation of the Minimum Recombination Haplotype Configuratio. The 16th International Symposium on Algorithms and Computation (ISAAC 2005), pp. 370-379, December 19-21, 2005, Sanya, Hainan, China.
Hongxu CAI, Yingchao Zhao. On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks. Journal of Combinatorial Optimization, Vol.9,pp.243-262,2005.