论文发表

25.

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.  

24.

Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng. Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. The 50th Annual Symposium on Foundations of Computer Science (FOCS 2009), pp. 273-282, October 24-27, 2009, Atlanta, GA.  

23.

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.  

22.

Bin Ma and Xiaoming Sun. MORE EFFICIENT ALGORITHMS FOR CLOSEST STRING AND SUBSTRING PROBLEMS. SIAM Journal on Computing, 39(4),pp.1432-1443,2009.  

21.

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 2009), pp. 233-239, Oct. 11-16, 2009, Grenoble, France.  

20.

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.  

19.

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.  

18.

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.  

17.

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.  

16.

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.  

15.

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.  

14.

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.  

13.

Jialin Zhang, Wei Chen. Implementing uniform reliable broadcast with binary consensus in systems with fa. Information Processing Letters, 110(1),pp.13-19, 2009.  

12.

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.  

11.

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.  

10.

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.  

9.

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.  

8.

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.