论文发表

27.

Frans Schalekamp, Michael Yu and Anke van Zuylen. Clustering with or without the Approximation. The 16th Annual International Computing and Combinatorics Conference (COCOON 2010), pp. 70-79, July 19-21, 2010, Nha Trang, Vietnam.  

26.

Elad Verbin, Qin Zhang. The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the Exter. The 42th ACM Symposium on Theory of Computing (STOC 2010), pp.447-456, June 5-8,2010, Cambridge, Massachusetts, USA.  

25.

Henry Lin. A structured Wikipedia for mathematics: Mathematics in a web 2.0 world. The 5th International Conference on Software and Data Technologies (ICSOFT 2010), pp. 279-284, July 22-24, 2010, Athens, Greece.  

24.

Changcun Ma, Donghyun Kim, Yuexuan Wang, Wei Wang, Nassim Sohaee and Weili Wu. Hardness of k-Vertex Connected Subgraph Augmentation Problem. Journal of Combinatorial Optimization (JOCO), Volume 20, Number 3, pp. 249-258, 2010.  

23.

Jun Guo, YuexuanWang, Suogang Gao, Jiangchen Yu, WeiliWu. Constructing error-correcting pooling designs with symplectic space. Journal of Combinatorial Optimization (JOCO), Volume 20, Number 4, pp. 413-421, 2010.  

22.

Hongyi Yao and Sidharth Jaggi and Minghua Chen. Network Coding Tomography for Network Failures. The 29th IEEE Conference on Computer Communications (IEEE INFOCOM 2010), March 14-19,2010, San Diego, CA, USA.  

21.

Yaping Li and Hongyi Yao and Minghua Chen and Sidharth Jaggi and Alon Rosen. RIPPLE Authentication for Network Coding. The 29th IEEE Conference on Computer Communications (IEEE INFOCOM 2010), March 14-19,2010, San Diego, CA, USA.  

20.

Haisheng Tan, Yuexuan Wang, Xiaohong Hao, Qiang-Sheng Hua, Francis C.M. Lau. Arbitrary Obstacles Constrained Full Coverage in Wireless Sensor Networks. The 5th International Conference on Wireless Algorithms, Systems, and Applications (WASA 2010), pp. 1-10, August 15-17, 2010, Beijing, China.  

19.

Jing He, Hongyu Liang, and Jayalal Sarma M.N. Limiting Negations in Bounded Treewidth and Upward Planar Circuits. The 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), pp.417-428, Aug. 23-27, 2010, Brno, Czech Republic.  

18.

Jing He,Ming Zhou, and Long Jiang. Generating Chinese Metrical Poetry by a Statistical MT Approach. Journal of Chinese Information Processing, Vol.24, No.2, pp.96-103, 2010.  

17.

Hongyi Yao and Danilo Silva and Sidharth Jaggi and Michael Lanberger. Network Codes Resilient to Jamming and Eavesdropping. The 2010 IEEE Symposium on Network Coding (NetCod 2010), pp. 31-36, June 9-11, 2010, Toronto, Canada.  

16.

Hongyi Yao,Sidharth Jaggi,Minghua Chen, Tracey Ho. Network RS Codes for Efficient Adversary Localization. The 44th Annual Asilomar Conference on Signals, Systems, and Computers (Asilomar 2010), Nov. 7-10, 2010, Pacific Grove, California.  

15.

Yongcai Wang ,Yuexuan Wang, Xiao Qi, Liwen Xu, Jinbiao Chen, Guanyu Wang. L3SN: a Level-based, Large-scale, Longevous Sensor Network System for Agricultur. Wireless Sensor Network, Vol. 2, pp.655-660, 2010.  

14.

Xiao Qi, Chunjiang Zhao, Yongcai Wang, Yuexuan Wang, Jinbiao Chen. Distributed Energy Efficient Scheduling in Wireless Sensor Network for Agricultu. Journal on Communications, Vol. 31(9A), pp.104-111, 2010.  

13.

Hongyu Liang and Jing He. Satisfiability with Index Dependency. The 21st International Symposium on Algorithms and Computation (ISAAC 2010), pp. 49-60. December 15-17, 2010, Jeju Island, KOREA.  

12.

Jing He and Hongyu Liang. An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs. The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010), pp. 160-169. December 18-20, 2010, Hawaii, USA.  

11.

Maurice Jansen, Youming Qiao, Jayalal Sarma. Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. The 30th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), pp. 296-307, December 15-18, 2010, IMSc, Chennai, India.  

10.

Joshua Brody, Elad Verbin. The Coin Problem, and Pseudorandomness for Branching Programs. The 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 30-39, October 23-26, 2010, Las Vegas, Nevada, USA.