- 262. Andrej Bogdanov, Periklis A. Papakonstantinou, and Andrew Wan. Pseudorandomness for Linear Length Branching Programs and Stack Machines. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Volume 7408, pp 447-458, 2012.
- 261. Gábor B. Halász and Alioscia Hamma. Probing topological order with Rényi entropy. Physical Review A 86, 062330, Dec.27, 2012.
- 260. Alioscia Hamma, Siddhartha Santra, and Paolo Zanardi. Ensembles of physical states and random quantum circuits on graphs. Physical Review A 86, 052324, Nov.26, 2012.
- 259. Y.-H. Chan, L.-M. Duan. Evidence of spin liquid with hard-core bosons in a square lattice. New Journal of Physics 14, 113039,2012.
- 258. Simcha Korenblit, Dvir Kafri, Wess C. Campbell, Rajibul Islam, Emily E. Edwards, Zhe-Xuan Gong, Guin-Dar Lin, Luming Duan, Jungsang Kim, Kihwan Kim, Chris Monroe. Quantum simulation of spin models on an arbitrary lattice with trapped ions. New Journal of Physics 14, 095024,2012.
- 257. Xiongfeng Ma. Quantum key distribution with delayed privacy amplification and its application to security proof of a two-way deterministic protocol. Physical Review A , 85 (3) ,pp.1178-1187, 2012.
- 256. H. T. Ng. Coherent control of atomic spin currents in a double well. Physical Review A , 85 (2),pp.582-586, 2012.
- 255. G. Chiribella. Optimal Probabilistic Simulation of Quantum Channels from the Future to the Past. Physical Review A , 85 (2) ,pp.5809-5816 , 2012.
- 254. Chen Xue, Hu Guangda, Sun Xiaoming. 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,.
- 253. Amin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi. Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources. IEEE International Symposium on Information Theory - Proceedings, pp.598-602, 2011.
- 252. Xiaoming Sun. An improved lower bound on the sensitivity complexity of graph properties. Theoretical Computer Science, v 412, n 29, p 3524-3529, July 1, 2011.
- 251. Donghyun Kim, Wei Wang, Nassim Sohaee, Changcun Ma, Weili Wu, Wonjun Lee, Senior Member and DingZhu Du. 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.
- 250. Yuexuan Wang, Jie Yin, and Meizhi Hu. A Scheduling Method for Service Chain in Equipment Grid. World Conference on Services-i :38-45 , 2009.
- 249. Feng Zou; Yuexuan Wang; Xiao-Hua Xu; Xianyue Li; Hongwei Du; Pengjun Wan;Weili Wu. New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theoretical Computer Science, 412(3): 198-208, January 2011.
- 248. 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.
- 247. Anke van Zuylen. Deterministic Sampling Algorithms for Network Design. Algorithmica, 60(1): 110-151, May 2011.
- 246. Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao. Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. Algorithmica, 59(4):510-520,2011.
- 245. Decheng Dai, Rong Ge. Another Sub-exponential Algorithm for the Simple Stochastic Game. Algorithmica, Vol. 61, No. 4, pp. 1092-1104, 2011.
