Shengyu Zhang. On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity. The 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), pp. 49-60, July 4-8, 2011, Zürich, Switzerland.
Yang-hao Chan, Yong-jian Han, Luming Duan. Tensor network simulation of phase diagram of frustrated J1-J2 Heisenberg model. Physical Review B, Vol.84, 224407, 2011.
Qiang-Sheng Hua, Yuexuan Wang, Dongxiao Yu, Haisheng Tan. Minimum Latency link Scheduling for Arbitrary Directed Acyclic Networks Under Precedence and sinr Constraints. Journal of Interconnection Networks, Vol. 12, Nos. 1&2, pp. 85-107, 2011.
Christophe Tartary, Huaxiong Wang, San Ling. Authentication of Digital Streams. IEEE Transactions on Information Theory, Vol. 57, No. 9, pp. 6285-6306 , September 2011.
Yun Zhang, Christophe Tartary, Huaxiong Wang. An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem. The 16th Australasian Conference on Information Security and Privacy (ACISP 2011), pp. 259-275, July 11-13, 2011, Melbourne, Australia.
Christophe Tartary, Huaxiong Wang, Yun Zhang. An Efficient and Information Theoretically Secure Rational Secret Sharing Scheme. International Journal of Foundations of Computer Science, Vol. 22, No. 6, pp. 1395-1416, September 2011.
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu. Bounded Budget Betweenness Centrality Game for Strategic Network Formations. Theoretical Computer Science, 412(52): 7147-7168, 2011.
Jing He, Hongyu Liang, Guang Yang. Reversing Longest Previous Factor Tables is Hard. The 12th International Symposium on Algorithms and Data Structures (WADS 2011), pp. 488-499, 15-17 August 2011, Brooklyn, NY, USA.
Joshua Brody and David Woodruff. Streaming Algorithms with One-Sided Estimation. The 15th International Workshop on Randomization and Computation (Random 2011), pp. 436-447, Aug. 17-19, 2011, Princeton University, USA.
Tengyu Ma, Xiaoming Sun, Huacheng Yu. A New Variation of Hat Guessing Games. The 17th Annual International Computing and Combinatorics Conference (COCOON 2011), pp. 616-626, August 14-16, 2011, Dallas, Texas, USA.
Pavel Hrubes, Iddo Tzameret. Short proofs for the determinant identities. Electronic Colloquium in Computational Complexity (ECCC), TR11-174, December 30, 2011.
Jing He, Hongyu Liang, Hao Yuan. Controlling Infection by Blocking Nodes and Links Simultaneously. The 7th Workshop on Internet & Network Economics (WINE 2011), pp. 206-217, December 11-14, 2011, Singapore.
Zi Cai, Lu-Ming Duan, Congjun Wu. Phase-Sensitive Detection for Unconventional Bose-Einstein Condensations. Physical Review A 86, 051601(R),2011.
Leizhen Cai, Yongxi Cheng, Elad Verbin, and Yuan Zhou. SURVIVING RATES OF GRAPHS WITH BOUNDED TREEWIDTH FOR THE FIREFIGHTER PROBLEM. SIAM Journal on Discrete Mathematics, v.24, n.4, pp.1322-1335, 2010.
Andrej Bogdanov, Emanuele Viola. PSEUDORANDOM BITS FOR POLYNOMIALS. Special Section: Foundations of Computer Science,SIAM Journal on Computing, v.39, n.6, pp.2464-2486, 2010.
Chen Victor. Query-Efficient Dictatorship Testing with Perfect Completeness. Property Testing - Current Research and Surveys, v.6390 LNCS, pp.276-279, 2010,.
Arnab Bhattacharyya, Victor Chen, Madhu Sudan and Ning Xie. Testing Linear-Invariant Non-linear Properties: A Short Report. Property Testing - Current Research and Surveys,v.6390 LNCS, pp.260-268, 2010,.
Hongwei Du, Qiang Ye, Jioafei Zhong, Yuexuan Wang, Wonjun Lee, and Haesun Park. PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks. Proceedings of , Combinatorial Optimization and Applications - 4th International Conference(COCOA 2010)v.6508 LNCS, pp.252-259, 2010.