Andrej Bogdanov, Elchanan Mossel and Salil Vadhan. The complexity of distinguishing Markov Random Fields. The 12th International Workshop on Randomization and Computation (RANDOM 2008), pp. 331-342, August 25-27, MIT, USA.
Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang and Changyuan Yu. Effciency, Fairness and Competitiveness in Nash Bargaining Games. The 4th International Workshop On Internet And Network Economics (WINE 2008), pp. 498-505, December 17-20, 2008, Shanghai, China.
Pinyan Lu and Changyuan Yu. Randomized Truthful Mechanisms for Scheduling Unrelated Machines. The 4th International Workshop On Internet And Network Economics (WINE 2008), pp. 402-413, December 17-20, 2008, Shanghai, China.
Pinyan Lu, Changyuan Yu. Worst-Case Nash Equilibria in Restricted Routing. The 4th International Workshop On Internet And Network Economics (WINE 2008), pp. 231-238, December 17-20, 2008, Shanghai, China.
Yingchao Zhao, Wei Chen and Shang-Hua Teng. The Isolation Game: A Game of Distances. The 19th International Symposium on Algorithms and Computation (ISAAC 2008), pp. 148-158, December 15-17, 2008, Surfers Paradise, Gold Coast, Australia.
Xiaoming Sun, Andrew Chi-Chih Yao and Christophe Tartary. Graph Design for Secure Multiparty Computation over Non-Abelian Groups. The 14th Annual International Conference on the Theory and Application of Cryptology & Information Security (Asiacrypt 2008), pp. 37-53, December 7 - 11, 2008, Melbourne, Australia.
Youming Qiao,Christophe Tartary. Counting Method For Multi-Party Computation over Non-Abelian Groups. The 7th International Conference on CRYPTOLOGY AND NETWORK SECURITY (CANS 2008), pp. 162-177, December 2-4, 2008, Hong Kong, China.
Tiancheng Lou,Christophe Tarary. Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes. The 7th International Conference on CRYPTOLOGY AND NETWORK SECURITY (CANS 2008), pp. 196-213, December 2-4, 2008, Hong Kong, China.
Christophe Tartary,Sujing Zhou,Dongdai Lin,Huaxiong Wang and Josef Pieprzyk. Analysis of Bilinear Pairing-based Accumulator for Identity Escrowing. IET Information Security, Vol. 2, No. 4, pp. 99-107, 2008.
Christophe Tartary, Huaxiong Wang and Josef Pieprzyk. A Coding Approach to the Multicast Stream Authentication Problem. International Journal of Information Security, Vol. 7, pp. 265-283, 2008.
Jing Xiao, Lusheng Wang, Xiaowen Liu and Tao Jiang. An Efficient Voting Algorithm for Finding Additive Biclusters With Random backgr. Journal of Computational Biology, Vol. 15, No. 10, pp. 1275-1293, 2008.
Yongxi Cheng, Ker-I Ko, and Weili Wu. On the complexity of non-unique probe selection. Theoretical Computer Science, Vol. 390, pp. 120-125, 2008.
Jin-Yi Cai, Pinyan Lu and Mingji Xia. Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardnes. The 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 644-653, October 26–28, 2008 Philadelphia, Pennsylvania, USA.
Jinyi Cai and Pinyan LU. Bases Collapse in Hologeaphic Algorithms. COMPUTATIONAL COMPLEXITY, Vol. 17, pp. 254-281, 2008.
Yin Jie, Wang Yuexuan, Wu Cheng. A New Method to Build Services in Equipment Grid. International Journal of Computer & Information Service, Vol. 9, No. 2, pp. 36-45, June 2008.
Cai Leizhen ,Verbin Elad ,Yang Lin. Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. Proceedings of 19th International Symposium Algorithms and Computation(ISAAC 2008), v.5369 LNCS, pp.258-269, 2008.
Yao Andrew C.C.,Yao, Frances F. ,Zhao Yunlei. A note on the feasibility of generalized universal composability. Proceedings of 4th International Conference Theory and Applications of Models of Computation(TAMC 2007), v.4484 LNCS, pp.474-485, 2007.
Xiaoming Sun and David Woodruff . The Communication and Streaming Complexity of Computing the Longest Common and I. The 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 336-345, January 7-9, 2007, Astor Crowne Plaza, New Orleans, Louisiana, USA.