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.
X. Xu, Y. Wang, H. Du, P. J. Wan, F. Zou, X. Li, W. Wu. Approximations for node-weighted Steiner tree in unit disk graphs. Optimization Letters, v 4, n 3, p 405-416, 2010.
Victor Chen, Elena Grigorescu and Ronald De Wolf. Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. The 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), pp. 203-214, March 4-6, 2010, Nancy, France.
Maurice Jansen. WEAKENING ASSUMPTIONS FOR DETERMINISTIC SUBEXPONENTIAL TIME NON-SINGULAR MATRIX COMPLETION. The 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), pp. 465-476, March 4-6, 2010, Nancy, France.
Hongyi Yao, Raymond W.Yeung. Zero-Error Multichannel Source Coding. 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo), January 6-8, Cairo, Egypt.
Qiang Sheng Hua, Yuexuan Wang,Dongxiao Yu; Francis C.M. Lau. Dynamic programming based algorithms for set multicover and multiset multicover problems. Theoretical Computer Science, Vol. 411,Issues 26-28, pp. 2467-2474,2010.
Matei David, Periklis A. Papakonstantinou. Trade-off Lower Bounds for Stack Machines. The 25th IEEE Conference on Computational Complexity (CCC 2010), pp.163-171, June 9-11, 2010, Cambridge, Massachusetts, USA.
John Steinberger. Stam's collision resistance conjecture. The 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2010), pp. 597-615, May 30-June 3, 2010, French Riviera.
Jooyoung Lee, John Steinberger. Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation. The 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2010), pp.573-596, May 30-June 3, 2010, French Riviera.
Andrew C. Yao, Moti Yung, and Yunlei Zhao. Concurrent Knowledge Extraction in the Public-Key Model. The 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), pp.702-714, July 5-10, 2010, Bordeaux, France.
Andrew C. Yao and Yunlei Zhao. Deniable Internet Key Exchange. The 8th International Conference on Applied Cryptography and Network Security (ACNS 2010), pp.329-348, June 22-25, 2010, Beijing, China.
Zhiqiang Zhang, Yaoyun Shi. On the parity complexity measures of Boolean functions. Theoretical Computer Science, Vol. 411,Issues 26-28,pp.2612-2618,2010.
Anke van Zuylen. Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing. The 16th Annual International Computing and Combinatorics Conference (COCOON 2010), pp. 60-69, July 19-21, 2010, Nha Trang, Vietnam.
Maurice Jansen and Jayalal Sarma M.N. Balancing Bounded Treewidth Circuits. The 5th International Computer Science Symposium in Russia (CSR 2010), pp. 228-239, June 16-20, 2010, Kazan, Russia.