| 2011 |
|---|
| 39 | Resource Fairness and Composability of Cryptographic Protocols. Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang. J. Cryptology (24): 615-658 (2011). Web SearchBibTeXDownload |
| 2009 |
|---|
| 38 | Relational query coprocessing on graphics processors. Bingsheng He, Mian Lu, Ke Yang, Rui Fang, Naga K. Govindaraju, Qiong Luo, Pedro V. Sander. ACM Trans. Database Syst. (34) (2009). Web SearchBibTeXDownload |
| 37 | Design of Behavior-Based Modular Decision-Making Control System for Autonomous Underwater Vehicle. Bo He, Bingsen Li, Ke Yao, Jing Luo, Ke Yang. FSKD (4) 2009, 76-80. Web SearchBibTeXDownload |
| 36 | I3DC: Interactive Three-Dimensional Cubes. Ke Yang, Yinan Li, Qiong Luo, Pedro V. Sander, Jiaoying Shi. ICDE 2009, 1475-1478. Web SearchBibTeXDownload |
| 35 | Stack-based parallel recursion on graphics processors. Ke Yang, Bingsheng He, Qiong Luo, Pedro V. Sander, Jiaoying Shi. PPOPP 2009, 299-300. Web SearchBibTeXDownload |
| 2008 |
|---|
| 34 | Relational joins on graphics processors. Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. Govindaraju, Qiong Luo, Pedro V. Sander. SIGMOD Conference 2008, 511-524. Cited by 30Web SearchBibTeXDownload |
| 2007 |
|---|
| 33 | In-memory grid files on graphics processors. Ke Yang, Bingsheng He, Rui Fang, Mian Lu, Naga K. Govindaraju, Qiong Luo, Pedro V. Sander, Jiaoying Shi. DaMoN 2007, 5. Cited by 2Web SearchBibTeXDownload |
| 32 | GPUQP: query co-processing using graphics processors. Rui Fang, Bingsheng He, Mian Lu, Ke Yang, Naga K. Govindaraju, Qiong Luo, Pedro V. Sander. SIGMOD Conference 2007, 1061-1063. Cited by 9Web SearchBibTeXDownload |
| 31 | On the (im)possibility of non-interactive correlation distillation. Ke Yang. Theor. Comput. Sci. (382): 157-166 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 30 | CoarseZ Buffer Bandwidth Model in 3D Rendering Pipeline. Ke Yang, Ke Gao, Jiaoying Shi, Xiaohong Jiang, Hua Xiong. IMSCCS (1) 2006, 737-742. Web SearchBibTeXDownload |
| 29 | Strengthening Zero-Knowledge Protocols Using Signatures. Juan A. Garay, Philip D. MacKenzie, Ke Yang. J. Cryptology (19): 169-209 (2006). Web SearchBibTeXDownload |
| 28 | Resource Fairness and Composability of Cryptographic Protocols. Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang. TCC 2006, 404-428. Web SearchBibTeXDownload |
| 2005 |
|---|
| 27 | Resource Fairness and Composability of Cryptographic Protocols. Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang. IACR Cryptology ePrint Archive (2005): 370 (2005). Web SearchBibTeXDownload |
| 26 | New lower bounds for statistical query learning. Ke Yang. J. Comput. Syst. Sci. (70): 485-509 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 25 | Private Keyword-Based Push and Pull with Applications to Anonymous Communication. Lea Kissner, Alina Oprea, Michael K. Reiter, Dawn Xiaodong Song, Ke Yang. ACNS 2004, 16-30. Web SearchBibTeXDownload |
| 24 | On Simulation-Sound Trapdoor Commitments. Philip D. MacKenzie, Ke Yang. EUROCRYPT 2004, 382-400. Web SearchBibTeXDownload |
| 23 | Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness. Juan A. Garay, Philip D. MacKenzie, Ke Yang. IACR Cryptology ePrint Archive (2004): 9 (2004). Web SearchBibTeXDownload |
| 22 | Efficient and Universally Composable Committed Oblivious Transfer and Applications. Juan A. Garay, Philip D. MacKenzie, Ke Yang. IACR Cryptology ePrint Archive (2004): 53 (2004). Web SearchBibTeXDownload |
| 21 | Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. Andris Ambainis, Ke Yang. IEEE Conference on Computational Complexity 2004, 305-319. Web SearchBibTeXDownload |
| 20 | The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data. Ting Liu, Ke Yang, Andrew W. Moore. KDD 2004, 629-634. Web SearchBibTeXDownload |
| 19 | On the (Im)possibility of Non-interactive Correlation Distillation. Ke Yang. LATIN 2004, 222-231. Web SearchBibTeXDownload |
| 18 | An Investigation of Practical Approximate Nearest Neighbor Algorithms. Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Yang. NIPS 2004. Web SearchBibTeXDownload |
| 17 | Co-Training and Expansion: Towards Bridging Theory and Practice. Maria-Florina Balcan, Avrim Blum, Ke Yang. NIPS 2004. Web SearchBibTeXDownload |
| 16 | The balance problem of min-max systems is co-NP hard. Ke Yang, Qianchuan Zhao. Systems & Control Letters (53): 303-310 (2004). Web SearchBibTeXDownload |
| 15 | Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). Philip D. MacKenzie, Michael K. Reiter, Ke Yang. TCC 2004, 171-190. Web SearchBibTeXDownload |
| 2003 |
|---|
| 14 | On the (Im)possibility of Non-interactive Correlation Distillation. Ke Yang. Electronic Colloquium on Computational Complexity (ECCC) 2003. Web SearchBibTeXDownload |
| 13 | Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. Andris Ambainis, Ke Yang. Electronic Colloquium on Computational Complexity (ECCC) 2003. Web SearchBibTeXDownload |
| 12 | Strengthening Zero-Knowledge Protocols Using Signatures. Juan A. Garay, Philip D. MacKenzie, Ke Yang. EUROCRYPT 2003, 177-194. Web SearchBibTeXDownload |
| 11 | On Simulation-Sound Trapdoor Commitments. Philip D. MacKenzie, Ke Yang. IACR Cryptology ePrint Archive (2003): 252 (2003). Web SearchBibTeXDownload |
| 10 | Strengthening Zero-Knowledge Protocols using Signatures. Juan A. Garay, Philip D. MacKenzie, Ke Yang. IACR Cryptology ePrint Archive (2003): 37 (2003). Web SearchBibTeXDownload |
| 9 | On Statistical Query Sampling and NMR Quantum Computing. Avrim Blum, Ke Yang. IEEE Conference on Computational Complexity (10): 194 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 8 | New Lower Bounds for Statistical Query Learning. Ke Yang. COLT 2002, 229-243. Web SearchBibTeXDownload |
| 7 | Extracting Quantum Entanglement. Andris Ambainis, Adam Smith, Ke Yang. IEEE Conference on Computational Complexity 2002, 103-112. Web SearchBibTeXDownload |
| 2001 |
|---|
| 6 | On Learning Correlated Boolean Functions Using Statistical Queries. Ke Yang. ALT 2001, 59-76. Web SearchBibTeXDownload |
| 5 | On the (Im)possibility of Obfuscating Programs. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang. CRYPTO 2001, 1-18. Web SearchBibTeXDownload |
| 4 | On Learning Correlated Boolean Functions Using Statistical Query. Ke Yang. Electronic Colloquium on Computational Complexity (ECCC) 2001. Web SearchBibTeXDownload |
| 3 | Integer Circuit Evaluation Is PSPACE-Complete. Ke Yang. J. Comput. Syst. Sci. (63): 288-303 (2001). Web SearchBibTeXDownload |
| 2000 |
|---|
| 2 | Integer Circuit Evaluation is PSPACE-complete. Ke Yang. Electronic Colloquium on Computational Complexity (ECCC) (7) (2000). Web SearchBibTeXDownload |
| 1 | Integer Circuit Evaluation is PSPACE-Complete. Ke Yang. IEEE Conference on Computational Complexity 2000, 204. Web SearchBibTeXDownload |
