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.
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.
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.
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.
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.
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.
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.
Yongxi Cheng. Lattice grids and Prisms are Antimagic. Theoretical Computer Science, 374 (2007), 66-73, Vol. 374, pp. 66-73, 2007.
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.
Myung-Ah Park, Chen Wang, James Willson, My Thai, Weili Wu, Andras Farago. A dominating and absorbent set in a wireless ad-hoc network with different trans. The 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2007), pp. 22-31, September 9-14, 2007, Montreal, QC, Canada.
Chen Wang, My Thai, Yingshu Li, Feng Wang, Weili Wu. Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks. The 50th IEEE GLOBAL COMMUNICATIONS CONFERENCE (IEEE GLOBECOM 2007), pp. 1118-1123, November 26-30, 2007, Washington, DC, USA.
Lan Liu, Xi Chen, Jing Xiao and Tao Jiang. Complexity and Approximation of the Minimum Recombination Haplotype Configuratio. Theoretical Computer Science, Vol. 378, Issue 3, pp. 316-330, 2007.
Jie Yin, Junwei Cao, Yuexuan Wang, Lianchen Liu, and Cheng Wu. Scheduling remote access to scientific instruments in cyberinfrastructure for ed. The 7th IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2007), pp. 426-436, May 14-17, 2007, Rio de Janeiro, Brazil.