|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 21 occurrences of 20 keywords
|
|
|
|
|
Results
Found 44 publication records. Showing 44 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang |
On the (im)possibility of obfuscating programs.  |
J. ACM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang |
Resource Fairness and Composability of Cryptographic Protocols. |
J. Cryptology |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yang, Yinan Li, Qiong Luo, Pedro V. Sander, Jiaoying Shi |
I3DC: Interactive Three-Dimensional Cubes. |
ICDE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo He, Bingsen Li, Ke Yao, Jing Luo, Ke Yang |
Design of Behavior-Based Modular Decision-Making Control System for Autonomous Underwater Vehicle. |
FSKD |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yang, Bingsheng He, Qiong Luo, Pedro V. Sander, Jiaoying Shi |
Stack-based parallel recursion on graphics processors. |
PPOPP |
2009 |
DBLP DOI BibTeX RDF |
parallel, recursion, stack, graphics processors |
| 1 | Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. Govindaraju, Qiong Luo, Pedro V. Sander |
Relational joins on graphics processors. |
SIGMOD Conference |
2008 |
DBLP DOI BibTeX RDF |
parallel processing, relational database, sort, join, graphics processors, primitive |
| 1 | Ke Yang |
On the (im)possibility of non-interactive correlation distillation. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
query processing, graphics processing units |
| 1 | Juan A. Garay, Philip D. MacKenzie, Ke Yang |
Strengthening Zero-Knowledge Protocols Using Signatures. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
Simulation soundness, Signatures, Zero knowledge, Non-malleability |
| 1 | Ke Yang, Ke Gao, Jiaoying Shi, Xiaohong Jiang, Hua Xiong |
CoarseZ Buffer Bandwidth Model in 3D Rendering Pipeline. |
IMSCCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang |
Resource Fairness and Composability of Cryptographic Protocols. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang |
Resource Fairness and Composability of Cryptographic Protocols. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ke Yang |
New lower bounds for statistical query learning. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Juan A. Garay, Philip D. MacKenzie, Ke Yang |
Efficient and Universally Composable Committed Oblivious Transfer and Applications. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ke Yang, Qianchuan Zhao |
The balance problem of min-max systems is co-NP hard. |
Systems & Control Letters |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yang |
On the (Im)possibility of Non-interactive Correlation Distillation. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip D. MacKenzie, Ke Yang |
On Simulation-Sound Trapdoor Commitments. |
EUROCRYPT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip D. MacKenzie, Michael K. Reiter, Ke Yang |
Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). |
TCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Ke Yang |
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Ke Yang |
Co-Training and Expansion: Towards Bridging Theory and Practice. |
NIPS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Yang |
An Investigation of Practical Approximate Nearest Neighbor Algorithms. |
NIPS |
2004 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ting Liu, Ke Yang, Andrew W. Moore |
The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data. |
KDD |
2004 |
DBLP DOI BibTeX RDF |
metric tree, classification, k nearest neighbor, high dimension |
| 1 | Andris Ambainis, Ke Yang |
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Ke Yang |
On the (Im)possibility of Non-interactive Correlation Distillation |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Ke Yang |
On Statistical Query Sampling and NMR Quantum Computing |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Juan A. Garay, Philip D. MacKenzie, Ke Yang |
Strengthening Zero-Knowledge Protocols using Signatures. |
IACR Cryptology ePrint Archive |
2003 |
DBLP BibTeX RDF |
|
| 1 | Philip D. MacKenzie, Ke Yang |
On Simulation-Sound Trapdoor Commitments. |
IACR Cryptology ePrint Archive |
2003 |
DBLP BibTeX RDF |
|
| 1 | Juan A. Garay, Philip D. MacKenzie, Ke Yang |
Strengthening Zero-Knowledge Protocols Using Signatures. |
EUROCRYPT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yang, Avrim Blum |
On Statistical Query Sampling and NMR Quantum Computing. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yang |
New Lower Bounds for Statistical Query Learning |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Ke Yang |
New Lower Bounds for Statistical Query Learning. |
COLT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Adam Smith, Ke Yang |
Extracting Quantum Entanglement. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Entanglement Purification, General Error Models, Purity-Testing, Quantum Cryptography |
| 1 | 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) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Ke Yang |
On Learning Correlated Boolean Functions Using Statistical Query |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Ke Yang |
Integer Circuit Evaluation Is PSPACE-Complete. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang |
On the (Im)possibility of Obfuscating Programs. |
CRYPTO |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yang |
On Learning Correlated Boolean Functions Using Statistical Queries. |
ALT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yang |
Integer Circuit Evaluation is PSPACE-complete |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Ke Yang |
Integer Circuit Evaluation is PSPACE-Complete. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
Integer Circuit, Chinese Remainder Theorem, PSPACE |
Displaying result #1 - #44 of 44 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")