Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan. Efficiently Testing Sparse GF(2) Polynomials. Algorithmica, 61(3): 580-605, 2011.  


Youming Qiao, Jayalal Sarma M.N. and Bangsheng Tang. On isomorphism testing of groups with normal hall subgroups. The 28th International Symposium on Theoretical Aspect of Computer Science (STACS 2011), pp. 567-578, March 10-12, 2011, Tu Dortmund, Germany.  


Josh Bronson, Ali Juma, and Periklis A. Papakonstantinou. Limits on the Stretch of Non-Adaptive Constructions of Pseudo-Random Generators. The 8th IACR Theory of Cryptography Conference (TCC 2011), pp. 504-521, March 28-30, 2011, Brown University, Providence, Rhode Island, USA.  


Tiancheng Lou, Xiaoming Sun, Christophe Tartary. Bounds and Trade-offs for Double-Base Number Systems. Information Processing Letters, 111(10): 488-493, 2011.  


Haisheng Tan, Tiancheng Lou, Francis C.M. Lau, Yuexuan Wang, Shiteng Chen. Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor Netw. The 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), pp. 520-532, January 22-28, 2011, Novy Smokovec, Slovakia.  


Sebastian Muller, Iddo Tzameret. Average-Case Separation in Proof Complexity: Short Propositional Refutations for. Electronic Colloquium in Computational Complexity, TR11-006, January 2011.  


Joshua Brody, Kevin Matulef, Chenggang Wu. Lower Bounds for Testing Computability by Small Width OBDDs. The 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011), pp. 320-331, May 23-25, 2011, Tokyo, Japan.  


Andrej Bogdanov, Youming Qiao. On the Security of Goldreich’s One-Way Function. Computational Complexity, Accepted.  


Eric Blais, Joshua Brody, Kevin Matulef. Property Testing Lower Bounds via Communication Complexity. The 26th IEEE Conference on Computational Complexity (CCC 2011), pp. 210-220, June 8-10, 2011, San Jose, California, USA.  


Botao Hu, Yuchen Zhang, Weizhu Chen, Gang Wang, Qiang Yang. Characterizing Search Intent Diversity into Click Models. The 20th International World Wide Web Confernce (WWW 2011), pp. 17-26, March 28-April 1, 2011, Hyderabad, India.  


Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos. How Strong is Nisan’s Pseudo-random Generator?. Information Processing Letters, 111(16): 804-808, 2011.  


Yongcai Wang, Yuexuan Wang, Haisheng Tan, Francis C.M. Lau. Maximizing Network Lifetime Online by a Localized Probabilistic Cost-Balancing A. The 10th International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW 2011), pp. 332-345, July 18-20, 2011, Paderborn, Germany.  


Yu Dongxiao, Yuexuan Wang, Qiang-Sheng Hua, Francis C.M. Lau. Distributed Local Broadcasting Algorithms in the Physical Interference Model. The 7th IEEE International Conference on Distributed Computing in Sensor Systems (IEEE DCOSS '11), June 27-29, 2011, Barcelona, Spain.  


Yuexuan Wang, Yongcai Wang. Distributed Storage and Parallel Processing in Large-Scale Wireless Sensor Netwo. Chapter of “High Performance Scientific Computing with Special Emphasis on Current Capabilities and Future Perspectives”, IOS press, 2011.  


Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Francis C.M. Lau. Exact Parameterized Multilinear Monomial Counting via k-layer Subset Convolution. The 17th Annual International Computing and Combinatorics Conference (COCOON 2011), pp. 74–85, August 14-16, 2011, Dallas, Texas, USA.  


Yevgeniy Dodis, John Steinberger. Domain Extension for MACs Beyond the Birthday Barrier. The 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2011), pp. 323-342, May 15-19, 2011, Tallinn, Estonia.  


Jooyoung Lee, Martijn Stam, John Steinberger. The Collision Security of Tandem-DM in the Ideal Cipher Model. The 31st International Cryptology Conference (CRYPTO 2011), pp. 561–577, Aug. 14-18, 2011, Santa Barbara, California, USA.  


Kai Jin, Kevin Matulef. Finding the Maximum Area Parallelogram in a Convex Polygon. The 23rd Canadian Conference on Computational Geometry (CCCG'11), pp. 111-116, August 10-12, 2011, Toronto, Canada.