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