The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ke Yang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lea Kissner, Alina Oprea, Michael K. Reiter, Dawn Xiaodong Song, Ke Yang
    Private Keyword-Based Push and Pull with Applications to Anonymous Communication. [Citation Graph (0, 0)][DBLP]
    ACNS, 2004, pp:16-30 [Conf]
  2. Ke Yang
    On Learning Correlated Boolean Functions Using Statistical Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 2001, pp:59-76 [Conf]
  3. Andris Ambainis, Adam Smith, Ke Yang
    Extracting Quantum Entanglement. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:103-112 [Conf]
  4. Andris Ambainis, Ke Yang
    Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:305-319 [Conf]
  5. Ke Yang
    Integer Circuit Evaluation is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:204-0 [Conf]
  6. Ke Yang, Avrim Blum
    On Statistical Query Sampling and NMR Quantum Computing. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:194-0 [Conf]
  7. Ke Yang
    New Lower Bounds for Statistical Query Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:229-243 [Conf]
  8. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:1-18 [Conf]
  9. Juan A. Garay, Philip D. MacKenzie, Ke Yang
    Strengthening Zero-Knowledge Protocols Using Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:177-194 [Conf]
  10. Philip D. MacKenzie, Ke Yang
    On Simulation-Sound Trapdoor Commitments. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:382-400 [Conf]
  11. Ke Yang, Ke Gao, Jiaoying Shi, Xiaohong Jiang, Hua Xiong
    CoarseZ Buffer Bandwidth Model in 3D Rendering Pipeline. [Citation Graph (0, 0)][DBLP]
    IMSCCS (1), 2006, pp:737-742 [Conf]
  12. Ting Liu, Ke Yang, Andrew W. Moore
    The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data. [Citation Graph (0, 0)][DBLP]
    KDD, 2004, pp:629-634 [Conf]
  13. Ke Yang
    On the (Im)possibility of Non-interactive Correlation Distillation. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:222-231 [Conf]
  14. Maria-Florina Balcan, Avrim Blum, Ke Yang
    Co-Training and Expansion: Towards Bridging Theory and Practice. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  15. Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Yang
    An Investigation of Practical Approximate Nearest Neighbor Algorithms. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  16. Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang
    Resource Fairness and Composability of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:404-428 [Conf]
  17. Philip D. MacKenzie, Michael K. Reiter, Ke Yang
    Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:171-190 [Conf]
  18. Ke Yang
    Integer Circuit Evaluation is PSPACE-complete [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:12, pp:- [Journal]
  19. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:057, pp:- [Journal]
  20. Ke Yang
    On Learning Correlated Boolean Functions Using Statistical Query [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:098, pp:- [Journal]
  21. Ke Yang
    New Lower Bounds for Statistical Query Learning [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:060, pp:- [Journal]
  22. Avrim Blum, Ke Yang
    On Statistical Query Sampling and NMR Quantum Computing [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:014, pp:- [Journal]
  23. Andris Ambainis, Ke Yang
    Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:082, pp:- [Journal]
  24. Ke Yang
    On the (Im)possibility of Non-interactive Correlation Distillation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:085, pp:- [Journal]
  25. Ke Yang
    Integer Circuit Evaluation Is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:2, pp:288-303 [Journal]
  26. Ke Yang
    New lower bounds for statistical query learning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:4, pp:485-509 [Journal]
  27. Juan A. Garay, Philip D. MacKenzie, Ke Yang
    Strengthening Zero-Knowledge Protocols Using Signatures. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:2, pp:169-209 [Journal]
  28. Rui Fang, Bingsheng He, Mian Lu, Ke Yang, Naga K. Govindaraju, Qiong Luo, Pedro V. Sander
    GPUQP: query co-processing using graphics processors. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2007, pp:1061-1063 [Conf]
  29. Ke Yang
    On the (im)possibility of non-interactive correlation distillation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:157-166 [Journal]

  30. In-memory grid files on graphics processors. [Citation Graph (, )][DBLP]


  31. Design of Behavior-Based Modular Decision-Making Control System for Autonomous Underwater Vehicle. [Citation Graph (, )][DBLP]


  32. I3DC: Interactive Three-Dimensional Cubes. [Citation Graph (, )][DBLP]


  33. Stack-based parallel recursion on graphics processors. [Citation Graph (, )][DBLP]


  34. Relational joins on graphics processors. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002