Yuexuan Wang, Meizhi Hu and Jie Yin. A predictive admission control algorithm for user advance reservation in equipme. International Journal of Business Process Integration and Management (IJBPIM), Vol.4,No.4,pp.274-283,2009.  


Changyuan Yu. Truthful mechanisms for two-range-values variant of unrelated scheduling. Theoretical Computer Science, 410(21-23),pp.2196-2206,2009.  


Andrew C.C. Yao, Frances F. Yao, Yunlei Zhao. A Note on the Feasibility of Generalized Universal Composability. Mathematical Structure in Computer Science, Vol.19, pp.193-205, 2009.  


ZHIQIANG ZHANG, YAOYUN SHI. Communication Complexities of Symmetric XOR Functions. Quantum Information & Computation, 9(3&4),pp.255-263,2009.  


XIAOFENG GAO, YUEXUAN WANG, XIANYUE LI, WEILI WU. Analysis on Theoretical Bounds for Approximation Domination Set Problems. Discrete Mathematics, Algorithms and Applications, 1(1),pp.71-84,2009.  


Hong-Bin Chen, Yongxi Cheng, Qian He, and Chongchong Zhong. Transforming an Error-Tolerant Separable Matrix to an Error-Tolerant Disjunct Ma. Discrete Applied Mathematics, Vol.157, pp.387-390,2009.  


Xi Chen and Xiaotie Deng. A Simplicial Approach for Discrete Fixed Point Theorems. Algorithmica, 53(2),pp.250-262,2009.  


Decheng Dai,Changyuan YU. A5+ε-Approximation Algorithm for Minimum Weighted Dominating Set in Unit Disk Gr. Theoretical Computer Science, 410(8-10),pp.756-765,2009.  


Jing Xiao,Lan Liu,Lirong Xia,Tao Jiang. Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigre. SIAM Journal on Computing, 38(6),pp.2198-2219,2009.  


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.  


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.  


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.  


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.  


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.  


Jialin Zhang, Wei Chen. Bounded cost algorithms for multivalued consensus using binary consensus instanc. Information Processing Letters, 109(17),pp.1005-1009,2009.  


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.  


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.  


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.