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.
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.
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.
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.
Jialin Zhang, Wei Chen. Implementing uniform reliable broadcast with binary consensus in systems with fa. Information Processing Letters, 110(1),pp.13-19, 2009.
Christophe Tartary. Ensuring Authentication of Digital Information using Cryptographic Accumulators. The 8th International Conference on Cryptology And Network Security (CANS 2009), pp. 315-333, December 12-14, 2009 Kanazawa, Ishikawa, Japan.
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang Wang, Dong Wang, Zheng Chen. A General Magnitude-Preserving Boosting Algorithm for Search Ranking. The 18th ACM Conference on Information and Knowledge Management (CIKM 2009), pp. 817-825, November 2-6, 2009, Hong Kong.
Ming Zhou, Long Jiang, and Jing He. Generating Chinese Couplets and Quatrain Using a Statistical Approach. The 23rd Pacific Asia Conference on Language, Information and Computation (PACLIC 2009), pp.43-52, Dec. 3-5, 2009, Hong Kong, China.
Jing He, Hongyu Liang. AN APPROXIMATION ALGORITHM FOR WORD-REPLACEMENT USING A BI-GRAM LANGUAGE MODEL. The 1st IEEE Youth Conference on Information, Computing and Telecommunications (YC-ICT’09), pp. 27-30, Sep. 20-21, 2009, Beijing, China.
Bin Ma and Hongyi Yao. Seed Optimization for i.i.d Similarities Is No Easier than Optimal Golomb Ruler. Information Processing Letters, Vol.109,Issue 19,pp.1120-1124,2009.
Yang Ye,Yu Liu, Chi Wang, Dapeng Lv, Jianhua Feng. Decomposition:Privacy Preservation for Multiple Sensitive Attributes. The 14th International Conference on Database Systems for Advanced Applications (DASFAA 2009), pp. 486-490, April 21-23, 2009, Brisbane, Australia.
Yuchen Zhang, Xiaoming Sun. The antimagicness of the Cartesian product of graphs. Theoretical Computer Science, Vol.410, pp.727-735, 2009.
Xi Chen, Li-Sha Huang, Shang-Hua Teng. Market equilibria with hybrid linear-Leontief utilities. Theoretical Computer Science, Vol.410, pp.1573-1580, 2009.
Jin-Yi Cai, Vinay Choudhary, Pinyan Lu. On the Theory of Matchgate Computations. Theory of Computing Systems, Vol.45, pp.108-132, 2009.
Xi Chen, Xiaotie Deng. On the Complexity of 2D Discrete Fixed Point Problem. Theoretical Computer Science, Vol.410, pp.4448-4456,2009.
Yingchao Zhao, Shang-hua Teng. Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimens. Theoretical Computer Science, Vol.410, pp.1081-1092,2009.
Decheng Dai, Rong Ge. New Results on Simple Stochastic Games. The 20th International Symposium on Algorithms and Computation (ISAAC 2009), pp. 1014-1023, December 16-18, 2009, Hawaii, USA.
Lu, PY (Lu, Pinyan)[ 1 ] ; Yu, CY (Yu, Changyuan)[ 1 ]. An improved randomized truthful mechanism for scheduling unrelated machines. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science(STACS 2008), pp.527-538, 2008.