Yongxi Cheng and Ding-Zhu Du. New constructions of one and two stage pooling designs. Journal of Computational Biology, Vol. 15, No. 2, pp. 195-205, 2008.  


Yongxi Cheng. A New Class of Antimagic Cartesian Product Graphs. Discrete Mathematics, Vol. 308, pp. 6441-6448, 2008.  


Jing Zhang, Xin Gao, Jinbo Xu, Ming Li. Rapid and Accurate Protein Side Chain Packing using Local Backbone Information. The 12th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2008), pp. 285-299, March 30-April 2, 2008, NUS, Singapore.  


Jing Xiao, Lusheng Wang, Xiaowen Liu and Tao Jiang. Finding additive biclusters with random background. The 19th Annual Symposium on Combinatorial Pattern Matching (CPM 2008), pp. 263-276, June 18-20, 2008, Pisa, Italy.  


Pinyan Lu and Changyuan Yu. An Improveed Randomized Truthful Mechanism for Scheduling Unrelated Machines. The 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp. 527-538, February 21-23, 2008, Bordeaux, France.  


Jie Yin, Yuexuan Wang, Cheng Wu. Predictive Admission Control Algorithm for Advance Reservation in Equipment Grid. The 2008 IEEE International Conference on Services Computing (SCC 2008), pp. 49-56, July 8-11, 2008, Honolulu, Hawaii, USA.  


Bin Ma, Xiaoming Sun. More Efficient Algorithms for Closest String and Substring Problems. The 12th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2008), pp. 396-409, March 30-April 2, 2008, NUS, Singapore.  


Chen Wang, Myung-Ah Park, James Willson, Yongxi Cheng, Andras Farago, Weili Wu. On Approximate Optimal Dual Power Assignment for Biconnectivity and Edge-Biconne. Theoretical Computer Science, Vol. 396, pp. 180-190, 2008.  


Adam Tauman Kalai, Yishay Mansoury and Elad Verbinz. On Agnostic Boosting and Parity Learning. The 40th Annual ACM Symposium on Theory of Computing (STOC 2008), pp. 629-638, May 17-20, 2008, Victoria, British Columbia, Canada.  


Jin-Yi Cai, Pinyan Lu. Holographic Algorithms With Unsymmetric Signatures. The 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 54-63, January 20-22, 2008, San Francisco, California, USA.  


Yongxi Cheng, Xiaoming Sun, and Yiqun L. Yin. Searching Monotone Multi-dimensional Arrays. Discrete Mathematics, Vol. 308, pp. 2213-2221, 2008.  


Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, and Andrew Chi-Chih Yao. Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-Prover. The 23rd IEEE Conference on Computational Complexity (CCC 2008), pp. 187-198, June 22-26, 2008, College Park, MD, USA.  


Qingsong Ye, Huaxiong Wang and Christophe Tartary. Privacy-Preserving Distributed Set Intersection. The 3rd International Conference on Availability, Reliability, and Security (AReS 2008), pp. 1332-1339, March 4-7, 2008, Barcelona, Spain.  


Bin Ma and Hongyi Yao. Seed Optimization Is No Easier than Optimal Golomb Ruler Design. The 6th Asia-Pacific Bioinformatics Conference (APBC 2008), pp. 133-144, Jan. 14-17, 2008, Kyoto, Japan.  


Yang Ye, Dapeng Lv, Yu Liu, Jianhua Feng. Privacy Preservation for Multiple Sensitive Attributes. ACM SIGMOD 2008 (poster), June 9-12, 2008, Vancouver, Canada.  


Yang Ye, Dapeng Lv, Yu Liu, Chi Wang, and Jianhua Feng. BSGI: An Effective Algorithm towards Stronger l-diversity. The 19th International Conference on Database and Expert Systems Applications (DEXA 2008), pp. 19-32, September 1-5, 2008, Turin, Italy.  


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.