- 64. 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.
- 63. 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.
- 62. 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.
- 61. 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.
- 60. 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.
- 59. 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.
- 58. 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.
- 57. 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.
- 56. 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.
- 55. 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.
- 54. Jin-Yi Cai and Pinyan Lu. Bases Collapse in Holographic Algorithms. The 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), pp. 292-304, June 13-16, 2007, San Diego, California, USA.
- 53. Jin-Yi Cai, Vinay Choudhary and Pinyan Lu. On the Theory of Matchgate Computations. The 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), pp. 305-318, June 13-16, 2007, San Diego, California, USA.
- 52. Yingchao Zhao and Shang-Hua Teng. Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimens. The 4th International Conference on Theory and Applications of Models of Computation (TAMC 2007), pp. 554-565, May 22-25, 2007, Shanghai, China.
- 51. Jin-Yi Cai and Pinyan Lu. Holographic Algorithms: The Power of Dimensionality Resolved. The 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), pp. 631-642, July 9-13, 2007, Wroclaw, Poland.
- 50. Jin-Yi Cai and Pinyan Lu. On Block-wise Symmetric Signatures for Matchgates. The 16th International Symposium on Fundamentals of Computation Theory (FCT 2007), pp. 187-198, August 27-30, 2007, Budapest, Hungary.
- 49. Yongxi Cheng, Xi Chen, and Yiqun L. Yin. On Searching a Table Consistent with Division Poset. Theoretical Computer Science, Vol. 370, pp. 240-253, 2007.
- 48. Yongxi Cheng. Lattice grids and Prisms are Antimagic. Theoretical Computer Science,, Vol. 374, pp. 66-73, 2007.
- 47. Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu. Weakening Failure Detectors for k-Set Agreement via the Partition Approach. The 21st International Symposium on Distributed Computing (DISC 2007), pp. 123-138, September 24-26, 2007, Lemesos, Cyprus.
