论文发表

25.

Hongyu Liang, Tiancheng Lou, Haisheng Tan, Yuexuan Wang, and Dongxiao Yu. Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignme. The 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2012), LNCS 7718, pp. 108-119, 2013, Ljubljana, Slovenia.  

24.

Giulio Chiribella. Optimal networks for quantum metrology: semidefinite programs and product rules. New Journal of Physics, Vol. 14, 125008, 2012.  

23.

Feihu Xu, Bing Qi, Xiongfeng Ma, He Xu, Haoxuan Zheng, and Hoi-Kwong Lo. Ultrafast quantum random number generation based on quantum phase fluctuations. Optics Express, Vol. 20, Issue 11, pp. 12366-12377, 2012.  

22.

Xiongfeng Ma, Chi-Hang Fred Fung, and Mohsen Razavi. Statistical fluctuation analysis for measurement-device-independent quantum key. Physical Review A 86, 052305, 2012.  

21.

Xiongfeng Ma and Mohsen Razavi. Alternative schemes for measurement-device-independent quantum key distribution. Physical Review A 86, 062319, 2012.  

20.

Periklis A. Papakonstantinou and Guang Yang. A remark on one-wayness versus pseudorandomness. The 18th Annual International Computing and Combinatorics Conference (COCOON 2012), pp. 482-494, August 20-22, 2012, Sydney, Australia.  

19.

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Xiaoming Sun, Christophe Tartary, Huaxiong Wang, Andrew Chi-Chih Yao. Graph Coloring Applied to Secure Computation in Non-Abelian Groups. Journal of Cryptology, 25 (4): 557-600, 2012.  

18.

Andrew C. Yao and Yunlei Zhao. Computationally-Fair Group and Identity-Based Key-Exchange. The 9th annual conference on Theory and Applications of Models of Computation (TAMC 2012), pp. 237-247, May 16-21 2012, Beijing, China.  

17.

Hongyu Liang. Computational Complexity of the Negative Decision Number of Graphs. Australasian Journal of Combinatorics, Vol. 53, pp. 191-205, 2012.  

16.

Hongyu Liang. The Algorithmic Complexity of k-Domatic Partition of Graphs. The 7th IFIP International Conference on Theoretical Computer Science (TCS 2012), pp. 240-249, September 26-28, 2012, Amsterdam, The Netherlands.  

15.

Hong-Yu Liang, Jing He. Satisfiability with Index Dependency. Journal of Computer Science and Technology, Vol. 27, No. 4, pp. 668-677, 2012.  

14.

Qiao, You-Ming, Sarma, Jayalal M. N., Tang, Bang-Sheng. On Isomorphism Testing of Groups with Normal Hall Subgroups. Journal of Computer Science and Technology, Vol. 27, No. 4, pp. 687-701, 2012.  

13.

Weijie Shi, Qiang-Sheng Hua, Dongxiao Yu, Yuexuan Wang, and Francis C.M. Lau. Efficient information exchange in single-hop multi-channel radio networks. The 7th International Conference on Wireless Algorithms, Systems, and Applications (WASA 2012), pp. 438-449, August 8-10, 2012, Yellow Mountains, China.  

12.

Bangsheng Tang. Some remarks on the incompressibility of width-parameterized SAT instances. FAW-AAIM 2012, pp. 192-198, May 14-16, 2012, Beijing, China.  

11.

John Steinberger. The lowest-degree polynomial with nonnegative coefficients divisible by the n-th cyclotomic polynomial. The Electronic Journal of Combinatorics, 19(4), 2012.  

10.

Edward Bortnikov,Samir Khuller, Jian Li, Yishay Mansour, Joseph Seffi Naor. The load-distance balancing problem. Networks, 59(1): 22–29, 2012.  

9.

Danny Z. Chen, Yan Gu, Jian Li and Haitao Wang. Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. The 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012), pp. 177-188, July 4-6, 2012, Helsinki, Finland.  

8.

Andrej Bogdanov, Periklis A. Papakonstantinou, and Andrew Wan. Pseudorandomness for Linear Length Branching Programs and Stack Machines. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Volume 7408, pp 447-458, 2012.