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 background. 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 increasing subsequences. 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.
Xi Chen, Shang-Hua Teng and Paul Valiant. The Approximation Complexity of Win-Lose Games. The 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 159-168, January 7-9, 2007, Astor Crowne Plaza, New Orleans, Louisiana, USA.
Jing Xiao, Lan Liu, Lirong Xia and Tao Jiang. Fast Elimination of Redundant Linear Equations and Reconstruction of Recombinati. The 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 655-664, January 7-9, 2007, Astor Crowne Plaza, New Orleans, Louisiana, USA.
Zhang J, Jiang B, Li M, Tromp J, Zhang XG and Zhang MQ. Computing exact p-values for DNA motifs (part I). Bioinformatics, Vol. 23, No. 5, pp. 531-537, 2007.
Jin-Yi Cai and Pinyan Lu. On Symmetric Signatures in Holographic Algorithms. The 24th International Symposium on Theoretical Aspects of Computer Science (STACS 2007), pp. 429-440, February 22-24, 2007, Aachen, Germany.
Hongxu Cai, Zhong Shao, and Alexander Vaynberg. Certified Self-Modifying Code. ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation (PLDI’07), pp. 66-77, June 10-13, 2007, San Diego, CA, USA.
Jin-Yi Cai and Pinyan Lu. Holographic Algorithms: From Art to Science. The 39th ACM Symposium on Theory of Computing (STOC 2007), pp. 401 – 410, June 11-13, 2007, San Diego, California, USA.