| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrew C. Yao, Yunlei Zhao |
Digital Signatures from Challenge-Divided Sigma-Protocols.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Andrew C. Yao, Yunlei Zhao |
Computationally-Fair Group and Identity-Based Key-Exchange. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Quantum Computing: A Great Science in the Making. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew C. Yao, Yunlei Zhao |
A New Family of Practical Non-Malleable Protocols. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew C. Yao, Yunlei Zhao |
A New Family of Practical Non-Malleable Diffie-Hellman Protocols |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao |
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew C. Yao, Moti Yung, Yunlei Zhao |
Adaptive Concurrent Non-Malleability with Bare Public-Keys. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew C. Yao, Moti Yung, Yunlei Zhao |
Concurrent Knowledge Extraction in the Public-Key Model. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert H. Deng, Yingjiu Li, Andrew C. Yao, Moti Yung, Yunlei Zhao |
A New Framework for RFID Privacy. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao |
Concurrent Knowledge Extraction in the Public-Key Model. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao (eds.) |
Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, Yunlei Zhao |
Deniable Internet Key Exchange. |
ACNS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao |
A note on universal composable zero-knowledge in the common reference string model. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao |
A note on the feasibility of generalised universal composability. |
Mathematical Structures in Computer Science |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoming Sun, Andrew Chi-Chih Yao |
On the Quantum Query Complexity of Local Search in Two and Three Dimensions. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Quantum query complexity, Local search |
| 1 | Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao |
Concurrent Knowledge-Extraction in the Public-Key Model |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao |
Adaptive Concurrent Non-Malleability with Bare Public-Keys |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Communication Complexity and Its Applications. |
FAW |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao, Leizhen Cai, Andrew C. Yao |
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Some Perspectives on Complexity-Based Cryptography. |
ASIACRYPT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tartary |
Graph Design for Secure Multiparty Computation over Non-Abelian Groups. |
ASIACRYPT |
2008 |
DBLP DOI BibTeX RDF |
Graph Coloring, Multiparty Computation, Percolation Theory, Non-Abelian Groups, Passive Adversary |
| 1 | Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao |
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
multi-prover interactive proof systems, quantum nonlocality, Tsirelson inequality, entanglement |
| 1 | Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao |
Oblivious and Adaptive Strategies for the Majority and Plurality Problems. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao, Bin Zhu |
Deniable Internet Key-Exchange. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao |
A Note on Universal Composable Zero Knowledge in Common Reference String Model. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao |
A Note on the Feasibility of Generalized Universal Composability. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Recent Progress in Quantum Computational Complexity. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoming Sun, Andrew Chi-Chih Yao |
On the Quantum Query Complexity of Local Search in Two and Three Dimensions. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On the Communication Complexity of Co-linearity Problems. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao |
Oblivious and Adaptive Strategies for the Majority and Plurality Problems. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominic Mayers, Andrew Chi-Chih Yao |
Self testing quantum apparatus. |
Quantum Information & Computation |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao |
Fisher Equilibrium Price with a Class of Concave Utility Functions. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao |
Dynamic Price Sequence and Incentive Compatibility (Extended Abstract). |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang |
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Graph entropy and quantum sorting problems. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
graph entropy, information lower bound, sorting, partial order, quantum algorithms |
| 1 | Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao |
Finding Favorites |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Classical physics and the Church-Turing Thesis. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Interactive Proofs for Quantum Computation. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Classical Physics and the Church-Turing Thesis |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On the Power of Quantum Fingerprinting |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao |
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. |
Combinatorica |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 03F20, 68Q17 |
| 1 | Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao |
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Some perspective on computational complexity (abstract). |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao |
Quantum bit escrow. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
quantum bit commitment, quantum coin tossing, quantum cryptography |
| 1 | Tomoyuki Yamakami, Andrew Chi-Chih Yao |
NQPC = co-C=P. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoyuki Yamakami, Andrew Chi-Chih Yao |
NQP = co-C=P |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao |
An exponential lower bound on the size of algebraic decision trees for Max. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoyuki Yamakami, Andrew Chi-Chih Yao |
NQPC = co-C=P |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Dominic Mayers, Andrew Chi-Chih Yao |
Quantum Cryptography with Imperfect Apparatus. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, Frances F. Yao |
Dictionary Look-Up with One Error. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Decision Tree Complexity and Betti Numbers. |
J. Comput. Syst. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao |
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Hypergraphs and Decision Trees (Abstract). |
WG |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao |
An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Algebraic Decision Trees and Euler Characteristics. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan Håstad, Alexander A. Razborov, Andrew Chi-Chih Yao |
On the Shrinkage Exponent for Read-Once Formulae. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Minimean Optimal Key Arrangements in Hash Tables. |
Algorithmica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dima Grigoriev, Michael F. Singer, Andrew Chi-Chih Yao |
On Computing Algebraic Functions Using Logarithms and Exponentials. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, F. Frances Yao |
Dictionary Loop-Up with Small Errors. |
CPM |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Security of quantum protocols against coherent measurements. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Hing-Fung Ting, Andrew Chi-Chih Yao |
A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Near-Optimal Time-Space Tradeoff for Element Distinctness. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
A Lower Bound for the Monotone Depth of Connectivity |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
monotone depth of connectivity, proof technique, Razborov's approximation method, computational complexity, computational geometry, lower bound, lower bounds, graph connectivity, graph problems, monotone circuit |
| 1 | Andrew Chi-Chih Yao |
Decision tree complexity and Betti numbers. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao |
A Circuit-Based Proof of Toda's Theorem |
Inf. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Groups and Algebraic Complexity (Abstract). |
WADS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Quantum Circuit Complexity |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
quantum communication complexity, quantum circuit complexity, Boolean circuit model, quantum Turing machine, polynomial time |
| 1 | Jin-yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao |
Towards Uncheatable benchmarks. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Algebraic Decision Trees and Euler Characteristics |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
closed polyhedron, algebraic decision trees, membership question, Euler characteristics, algebraic computation tree |
| 1 | Anders Björner, László Lovász, Andrew Chi-Chih Yao |
Linear Decision Trees: Volume Estimates and Topological Bounds |
STOC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Lower Bounds to Randomized Algorithms for Graph Properties. |
J. Comput. Syst. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Lower Bounds for Algebraic Computation Trees with Integer Inputs. |
SIAM J. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Sampath Kannan, Andrew Chi-Chih Yao |
Program Checkers for Probability Generation. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Recent Progress in Circuit and Communication Complexity (Abstract). |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Weighted Random Assignments with Application to Hashing. |
ISA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Kenyon, Andrew Chi-Chih Yao |
On Evaluating Boolean Functions with Unreliable Tests. |
Int. J. Found. Comput. Sci. |
1990 |
DBLP BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On ACC and Threshold Circuits |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
ACC, two-level circuits, symmetric-function gate, depth-3 threshold circuits, language, computing power, threshold circuits, AND gates |
| 1 | Andrew Chi-Chih Yao |
Coherent Functions and Program Checkers (Extended Abstract) |
STOC |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On Selecting the k Largest with Median Tests. |
Algorithmica |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On the Complexity of Partial Order Productions. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Lower Bounds for Algebraic Computation Trees with Integer Inputs |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
integer inputs, topological lower bound, algebraic computation tree model, integral-constrained form, element distinctness, set disjointness, integer max gap, Milnor-Thom techniques, lower bounds, upper bounds, convex hull, Betti numbers, algebraic varieties, algebraic computation trees |
| 1 | Andrew Chi-Chih Yao |
Circuits and Local Computation |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald L. Graham, Andrew Chi-Chih Yao |
On the Improbability of Reaching Byzantine Agreements (Preliminary Version) |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Monotone Bipartite Graph Properties are Evasive. |
SIAM J. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Near-Optimal Time-Space Tradeoff for Element Distinctness |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
comparison-based branching program, near optimal time-space tradeoff, element distinctness |
| 1 | Andrew Chi-Chih Yao |
Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract) |
FOCS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
How to Generate and Exchange Secrets (Extended Abstract) |
FOCS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On Optimal Arrangements of Keys with Double Hashing. |
J. Algorithms |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Uniform Hashing Is Optimal |
J. ACM |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On the Expected Performance of Path Compression Algorithms. |
SIAM J. Comput. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, F. Frances Yao |
On Fault-Tolerant Networks for Sorting. |
SIAM J. Comput. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On the Complexity of Maintaining Partial Sums. |
SIAM J. Comput. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) |
FOCS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao, F. Frances Yao |
A General Approach to d-Dimensional Geometric Queries (Extended Abstract) |
STOC |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dolev, Andrew Chi-Chih Yao |
On the security of public key protocols. |
IEEE Transactions on Information Theory |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Lower Bounds by Probabilistic Arguments (Extended Abstract) |
FOCS |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao |
Strong Signature Schemes |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On the Time-Space Tradeoff for Sorting with Linear Queries. |
Theor. Comput. Sci. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Michael Steele, Andrew Chi-Chih Yao |
Lower Bounds for Algebraic Decision Trees. |
J. Algorithms |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On Parallel Computation for the Knapsack Problem. |
J. ACM |
1982 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")