- 128. Andrew C.C. Yao, Frances F. Yao, Yunlei Zhao. A Note on Universal Composable Zero Knowledge in the Common Reference String Mod. Theoretical Computer Science, 410(11),pp.1099-1108,2009.
- 127. Qiang-Sheng Hua, Yuexuan Wang, Dongxiao Yu, Francis C.M. Lau. Set Multi-Covering via Inclusion-Exclusion. Theoretical Computer Science, 410(38-40), pp.3882-3892, 2009.
- 126. Yuexuan Wang, Yin Jie, Meizhi Hu. A Scheduling Method for Service Chain in Equipment Grid. 2009 IEEE Congress on Services, Part I (Services-I 2009), pp. 38-45, July 6-10, 2009, Los Angeles, California, USA.
- 125. Xiaoming Sun, Andrew Chi-Chih Yao. On the Quantum Query Complexity of Local Search in Two and Three Dimensions. Algorithmica, 55(3),pp.576-600,2009.
- 124. WEIWEI LANG, YUEXUAN WANG, JAMES YU, SUOGANG GAO, WEILI WU. Error-Tolerant Trivial Two-Stage Group Testing for Complexies Using Almost Separ. Discrete Mathematics, Algorithms and Applications, 1(2),pp.235-251,2009.
- 123. Jialin Zhang, Wei Chen. Bounded cost algorithms for multivalued consensus using binary consensus instanc. Information Processing Letters, 109(17),pp.1005-1009,2009.
- 122. Raghavendra Rao B.V., Jayalal Sarma M.N.. On the Complexity of Matroid Isomorphism Problems. The 4th International Computer Science Symposium in Russia (CSR 2009), pp. 286-298, August 18-23, 2009, Novosibirsk, Russia.
- 121. Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng. Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Se. The 50th Annual Symposium on Foundations of Computer Science (FOCS 2009), pp. 273-282, October 24-27, 2009, Atlanta, GA.
- 120. Christian Sommer, Elad Verbin and Wei Yu. Distance Oracles for Sparse Graphs. The 50th Annual Symposium on Foundations of Computer Science (FOCS 2009), pp. 703-712, October 24-27, 2009, Atlanta, GA.
- 119. BIN MA AND XIAOMING SUN. MORE EFFICIENT ALGORITHMS FOR CLOSEST STRING AND SUBSTRING PROBLEMS. SIAM Journal on Computing, 39(4),pp.1432-1443,2009.
- 118. Yuexuan Wang, Yongcai Wang, Xiao Qi, Liwen Xu. OPAIMS:Open Architecture Precision Agriculture Information Monitoring System. 2009 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES’09), pp. 233-239, Oct. 11-16, 2009, Grenoble, France.
- 117. Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, and Elad Verbin. Sorting and Selection in Posets. The 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 392-401, January 4-6, 2009, New York, New York.
- 116. Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu. Bounded Budget Betweenness Centrality Game for Strategic Network Formations. The 17th Annual European Symposium on Algorithms (ESA 2009), pp. 227-238, September 7-9, 2009, Copenhagen, Denmark.
- 115. Jing Xiao, Tiancheng Lou, Tao Jiang. An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number. The 17th Annual European Symposium on Algorithms (ESA 2009), pp.392-405, September 7-9, 2009, Copenhagen, Denmark.
- 114. Andrej Bogdanov ,Youming Qiao. On the Security of Goldreich's One-Way Function. The 13th International Workshop on Randomization and Computation (RANDOM 2009), pp. 392-405, August 21-23,2009, UC Berkeley, USA.
- 113. Victor Chen. A Hypergraph Dictatorship Test with Perfect Completeness. The 13th International Workshop on Randomization and Computation (RANDOM 2009), pp. 448-461, August 21-23, 2009, UC Berkeley, USA.
- 112. Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma M. N.. Using Elimination Theory to construct Rigid Matrices. The 29th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), pp. 299-310, December 15-17, 2009, IIT Kanpur, India.
- 111. Hongyi Yao, Elad Verbin. Network Coding is Highly Non-Approximable. The 47th Annual Allerton Conference (Allerton 2009), pp. 209-213, Sept.30-Oct. 2, 2009, Illinois, USA.
