- 38. Yongxi Cheng and Ding-Zhu Du. Efficient Constructions of Disjunct Matrices with Applications to DNA Library Sc. Journal of Computational Biology, Vol. 14, No. 9, pp. 1208-1216, 2007.
- 37. C. Tartary, H. Wang and J. Pieprzyk. An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured. The 1st International Conference on Provable Security (ProvSec 2007), pp. 17-34, November 1-2, 2007, Wollongong, Australia.
- 36. Christophe Tartary, Josef Pieprzyk and Huaxiong Wang.. Verifiable Multi-Secret Sharing Schemes for Multiple Threshold Access Structures. The 3rd SKLOIS Conference on Information Security and Cryptology (INSCRYPT 2007), pp. 167-181, August 31 - September 5, 2007, Xining, Qinghai province, China.
- 35. Jing Zhang, Xi Chen, Ming Li. Computing exact p-value for structured motif. The 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), pp. 162-172, July 9-11, 2007, London, Ontario, Canada.
- 34. Rui Wang, Francis C.M. Lau and Yingchao Zhao. Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matr. Discrete Applied Mathematics, Vol. 155, pp. 2312-2320, 2007.
- 33. Xiaoming Sun. Block Sensitivity of Weakly Symmetric Functions. Theoretical Computer Science, Vol. 384, pp. 87-91, 2007.
- 32. Wei Chen, Jialin Zhang, Yu Chen. Failure Detectors and Extended Paxos for k-Set Agreement. The 13th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC’07), pp. 69-76, December 17-19, 2007, Melbourne, Victoria, Australia.
- 31. Ke Xu, Yuexuan Wang, Cheng Wu. Formal verification technique for grid service chain model and its application. Science in China Series F: Information Sciences, vol.50, no.1, pp. 1-20, 2007.
- 30. Minming Li, Andrew C. Yao, and Frances F. Yao. Discrete and continuous min-energy schedules for variable voltage processors. Proceedings of the National Academy of Sciences of the United States of America (PNAS), Vol.103,No.11,pp.3983-3987,2006.
- 29. Xi Chen and Xiaotie Deng. Settling the Complexity of 2-Player Nash-Equilibrium. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 261-272, October 21-24, 2006, Berkeley, California, USA.
- 28. Xiaoming Sun, Andrew C. Yao. On the Quantum Query Complexity of Local Search in Two and Three Dimensions. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 429-438, October 21-24, 2006, Berkeley, California, USA.
- 27. Xi Chen, Xiaotie Deng and Shang-Hua Teng. Computing Nash Equilibria: Approximation and Smoothed Complexity. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 603-612, October 21-24, 2006, Berkeley, California, USA.
- 26. David P. Woodruff. Lower Bounds for Additive Spanners, Emulators, and More. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 389-398, October 21-24, 2006, Berkeley, California, USA.
- 25. Craig Gentry, Zulfikar Ramzan and David P. Woodruff. Explicit Exclusive Set Systems with Applications to Broadcast Encryption. The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 27-38, October 21-24, 2006, Berkeley, California, USA.
- 24. David P. Woodruff. Better Approximations for the Minimum Common Integer Partition Problem. The 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006), pp. 248-259, August 28-30, 2006, Barcelona, Spain.
- 23. Piotr Indyk and David P. Woodruff. Polylogarithmic Private Approximations and Efficient Matching. The 3rd Theory of Cryptography Conference (TCC 2006), pp. 245-264, March 4-7, 2006,New York, NY, USA.
- 22. Piotr Indyk and David P. Woodruff. Fast Algorithms for the Free Riders Problem in Broadcast Encryption. The 26th Annual International Cryptology Conference (CRYPTO 2006), pp. 308-325, August 20-24, 2006, California, USA.
- 21. Pinyan Lu, Shanghua Teng, Changyuan Yu. Truthful Auctions with Optimal Profit. The 2nd international Workshop on Internet & Network Economics (WINE 2006), pp. 27-36, December 15 – 17, 2006, Patra, GREECE.
