Ke Yang

Affiliations:
  • Google Inc., Mountain View, CA, USA
  • Carnegie Mellon University, Pittsburgh, PA, USA (former)


According to our database1, Ke Yang authored at least 12 papers between 2001 and 2005.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
New lower bounds for statistical query learning.
J. Comput. Syst. Sci., 2005

2004
The balance problem of min-max systems is co-NP hard.
Syst. Control. Lett., 2004

On the (Im)possibility of Non-interactive Correlation Distillation.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data.
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

On Simulation-Sound Trapdoor Commitments.
Proceedings of the Advances in Cryptology, 2004

Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

Private Keyword-Based Push and Pull with Applications to Anonymous Communication.
Proceedings of the Applied Cryptography and Network Security, 2004

2003
Strengthening Zero-Knowledge Protocols Using Signatures.
Proceedings of the Advances in Cryptology, 2003

2002
Extracting Quantum Entanglement.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001
Integer Circuit Evaluation Is PSPACE-Complete.
J. Comput. Syst. Sci., 2001

On the (Im)possibility of Obfuscating Programs.
Proceedings of the Advances in Cryptology, 2001

On Learning Correlated Boolean Functions Using Statistical Queries.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001


  Loading...