Yuexuan Wang, Jie Yin, and Meizhi Hu. A Scheduling Method for Service Chain in Equipment Grid. Information Systems Frontiers (Accepted).  


Feng Zou; Yuexuan Wang; Xiao-Hua Xu; Xianyue Li; Hongwei Du; Pengjun Wan;Weili Wu. New Approximations for Minimum-Weighted Dominating Set and Minimum-Weighted Conn. Theoretical Computer Science, 412(3): 198-208, January 2011.  


Deying Li; Yuexuan Wang; Qinghua Zhu; Huiqiang Yang. Fault-tolerant routing: k-inconnected Many-to-One Routing in Wireless Networks. Theoretical Computer Science, 412(3): 209-216, January 2011.  


Anke van Zuylen. Deterministic Sampling Algorithms for Network Design. Algorithmica, 60(1): 110-151, May 2011.  


Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao. Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimu. Algorithmica, 59(4):510-520,2011.  


Decheng Dai, Rong Ge. Another Sub-exponential Algorithm for the Simple Stochastic Game. Algorithmica, Vol. 61, No. 4, pp. 1092-1104, 2011.  


Raghavendra Rao B.V., Jayalal Sarma M.N.. On the Complexity of Matroid Isomorphism Problem. Theory of Computing Systems, 49(2): 246-272, August 2011.  


Maurice Jansen. Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. Theory of Computing Systems, 49(2): 343-354, August 2011.  


Elad Verbin,Wei Yu. The Streaming Complexity of Cycle Counting , Sorting By Reversals, and Other Pro. The 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 11-25, Jan. 23-25, 2011, San Francisco, California, USA.  


Xiaohui Bei, Zhiyi Huang. Bayesian Incentive Compatibility via Fractional Assignments. The 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 720-733, Jan. 23-25, 2011, San Francisco, California, USA.  


Laszlo Babai, Paolo Codenotti, Joshua A. Grochow, Youming Qiao. Code Equivalence and Group Isomorphism. The 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 1395-1408, Jan. 23-25, 2011, San Francisco, California, USA.  


Matei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos. Computationally Limited Randomness. Innovations in Computer Science 2011 (ICS 2011), pp. 522-536, Jan. 6-9, 2011, Beijing, China.  


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.