- 19. Minming Li, Andrew C. Yao, and Frances F. Yao. Discrete and continuous min-energy schedules for variable voltage processors. Proceedings of the National Academy of Sciences of the United States of America (PNAS), Vol.103,No.11,pp.3983-3987,2006.
- 18. Xi Chen and Xiaotie Deng. Settling the Complexity of 2-Player Nash-Equilibrium. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 261-272, October 21-24, 2006, Berkeley, California, USA.
- 17. Xiaoming Sun, Andrew C. Yao. On the Quantum Query Complexity of Local Search in Two and Three Dimensions. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 429-438, October 21-24, 2006, Berkeley, California, USA.
- 16. Xi Chen, Xiaotie Deng and Shang-Hua Teng. Computing Nash Equilibria: Approximation and Smoothed Complexity. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 603-612, October 21-24, 2006, Berkeley, California, USA.
- 15. David P. Woodruff. Lower Bounds for Additive Spanners, Emulators, and More. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 389-398, October 21-24, 2006, Berkeley, California, USA.
- 14. 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.
- 13. 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.
- 12. 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.
- 11. 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.
- 10. 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.
- 9. 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.
- 8. 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.
- 7. Xi Chen and Xiaotie Deng. A Simplicial Approach for Discrete Fixed Point Theorems. The 12th Annual International Computing and Combinatorics Conference (COCOON'06), pp. 3-12, August 15-18, 2006, Taipei, Taiwan.
- 6. Xi Chen, Xiaotie Deng and Becky Jie Liu. On Incentive Compatible Competitive Selection Protocol. The 12th Annual International Computing and Combinatorics Conference (COCOON'06), pp. 13-22, August 15-18, 2006, Taipei, Taiwan.
- 5. 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.
- 4. 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.
- 3. Jinyi Cai, Pinyan Lu. On Symmetric Signatures in Holographic Algorithms. Electronic Colloquium on Computational Complexity, Report No.135,2006.
- 2. Jinyi Cai, Pinyan Lu. Holographic Algorithms: From Art to Science. Electronic Colloquium on Computational Complexity, Report No.145,2006.
