Publications

256.

Chen, X (Chen, Xue)[ 1 ] ; Hu, GD (Hu, Guangda)[ 1 ] ; Sun, XM (Sun, Xiaoming)[ 2,3 ]. A Better Upper Bound on Weights of Exact Threshold Functions. Proceedings of Theory and Applications of Models of Computation - 8th Annual Conference(TAMC 2011), vol.6648 LNCS, pp.124-132, 2011,.  

255.

Gohari, AA (Gohari, Amin Aminzadeh)[ 1 ] ; Yang, SH (Yang, Shenghao)[ 2 ] ; Jaggi, S (Jaggi, Sidharth)[ 3 ]. Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources. IEEE International Symposium on Information Theory - Proceedings, pp.598-602, 2011.  

254.

Sun, XM (Sun, Xiaoming)[ 1,2 ]. An improved lower bound on the sensitivity complexity of graph properties. Theoretical Computer Science, v 412, n 29, p 3524-3529, July 1, 2011.  

253.

Kim, D (Kim, Donghyun)[ 1 ] ; Wang, W (Wang, Wei)[ 2 ] ; Sohaee, N (Sohaee, Nassim)[ 3 ] ; Ma, CC (Ma, Changcun)[ 4 ] ; Wu, WL (Wu, Weili)[ 5 ] ; Lee, W (Lee, Wonjun)[ 6 ] ; Du, DZ (Du, Ding-Zhu)[ 5 ]. Minimum Data-Latency-Bound k-Sink Placement Problem in Wireless Sensor Networks. IEEE/ACM Transactions on Networking, vol.19, n.5, pp.1344-1353, October 2011.  

252.

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

251.

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.  

250.

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.  

249.

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

248.

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.  

247.

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

246.

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.  

245.

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

244.

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.  

243.

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.  

242.

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.  

241.

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.