A. Yao

发表

How to generate and exchange secrets

A. Yao, 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

Protocols for Secure Computations (Extended Abstract)

Andrew Chi-Chih Yao, A. Yao, 1982, FOCS.

Separating the polynomial-time hierarchy by oracles

A. Yao, 1985 .

A general approach to d-dimensional geometric queries

Andrew Chi-Chih Yao, F. Frances Yao, A. Yao, 1985, STOC '85.

Theory and application of trapdoor functions

Andrew Chi-Chih Yao, A. Yao, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

Theory and Applications of Trapdoor Functions (Extended Abstract)

Andrew Chi-Chih Yao, A. Yao, 1982, FOCS.

Some complexity questions related to distributive computing(Preliminary Report)

Andrew Chi-Chih Yao, A. Yao, 1979, STOC.

K + 1 heads are better than K

Andrew Chi-Chih Yao, Ronald L. Rivest, A. Yao, 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

Fisher Equilibrium Price with a Class of Concave Utility Functions

Ning Chen, Xiaotie Deng, Andrew Chi-Chih Yao, 2004, ESA.

The entropic limitations on VLSI computations(Extended Abstract)

Andrew Chi-Chih Yao, A. Yao, 1981, STOC '81.

Informational complexity and the direct sum problem for simultaneous message complexity

Andrew Chi-Chih Yao, Amit Chakrabarti, Anthony Wirth, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus

A. Yao, A. Wigderson, A. Razborov, 2002 .

Probabilistic computations: Toward a unified measure of complexity

Andrew Chi-Chih Yao, A. Yao, 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

Protocols for secure computations

Andrew Chi-Chih Yao, A. Yao, 1982, FOCS 1982.

Rearrangeable Networks with Limited Depth

A. Yao, N. Pippenger, 1982 .

Should tables be sorted?

Andrew Chi-Chih Yao, A. Yao, 1981, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

How to Generate and Exchange Secrets (Extended Abstract)

Andrew Chi-Chih Yao, A. Yao, 1986, FOCS.

Lower Bounds for Algebraic Decision Trees

J. Michael Steele, Andrew Chi-Chih Yao, A. Yao, 1982, J. Algorithms.

An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications pdf

Andrew Chi-Chih Yao, A. Yao, 2014, SODA.

Optimal Expected-Time Algorithms for Closest Point Problems

Bruce W. Weide, Andrew Chi-Chih Yao, Jon Louis Bentley, 1980, TOMS.

Lower bounds by probabilistic arguments

Andrew C. Yao, A. Yao, 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

ON ACC and threshold circuits

Andrew Chi-Chih Yao, A. Yao, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

RAPID: randomized pharmacophore identification for drug design

Lydia E. Kavraki, Rajeev Motwani, Suresh Venkatasubramanian, 1997, SCG '97.

An exponential lower bound on the size of algebraic decision trees for Max

A. Yao, M. Karpinski, D. Grigoriev, 1998, computational complexity.

Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version)

Andrew Chi-Chih Yao, A. Yao, 1985, FOCS.

RAPID: randomized pharmacophore identification for drug design

Lydia E. Kavraki, Rajeev Motwani, Suresh Venkatasubramanian, 1997, SCG '97.

On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems

Andrew Chi-Chih Yao, A. Yao, 1977, SIAM J. Comput..

Graph properties and circular functions: how low can quantum query complexity go?

A. Yao, Xiaoming Sun, Shengyu Zhang, 2004 .

Analysis of the subtractive algorithm for greatest common divisors

A. Yao, D. Knuth, 1975 .

A Lower Bound on the Size of Algebraic Decision Trees for the MAX Problem

A. Yao, M. Karpinski, D. Grigoriev, 1995 .

A lower bound for the monotone depth of connectivity

Andrew Chi-Chih Yao, A. Yao, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

AN ALMOST OPTIMAL ALGORTTHM FOR UNBOUNDED SIZARCHING

A. Yao, J. Bentley, 1975 .

On the Power of Quantum Fingerprinting 1

A. Yao, 2022 .

Coherent Functions and Program Checkers (Extended Abstract)

Andrew Chi-Chih Yao, A. Yao, 1990, STOC 1990.

Digital Signatures from Challenge-Divided Σ-Protocols

A. Yao, Yunlei Zhao, 2012 .

The complexity of nonuniform random number generation

Andrew Chi-Chih Yao, Donald E. Knuth, A. Yao, 1976 .

A an Alternative Private Protocol

A. Yao, D. Knuth, M. Franklin, 1996 .

Proceedings Twenty-Second Annual IEEE Conference on Computational Complexity: Preface

Peter Bro Miltersen, Toniann Pitassi, Subhash Khot, 2007 .

Lower Bounds by Probabilistic Arguments (Extended Abstract)

Andrew Chi-Chih Yao, A. Yao, 1983, FOCS 1983.

A Note on Universal Composable Zero Knowledge in Common Reference String Model

Yunlei Zhao, Andrew Chi-Chih Yao, F. Frances Yao, 2007, TAMC.

Theoretical foundations of the “ x 2 mod N ” generator

A. Yao, 2004 .

Self testing quantum apparatus

A. Yao, D. Mayers, 2003, Quantum Inf. Comput..

Resource Constrained Scheduling as Generalized Bin Packing

Andrew Chi-Chih Yao, Ronald L. Graham, David S. Johnson, 1976, J. Comb. Theory, Ser. A.

Program Checkers for Probability Generation

Sampath Kannan, Andrew Chi-Chih Yao, A. Yao, 1991, ICALP.

Some perspective on computational complexity (abstract).

Andrew Chi-Chih Yao, A. Yao, 2001, STOC 2001.

Quantum bit escrow

A. Yao, U. Vazirani, D. Aharonov, 2000, STOC '00.

Concurrent Knowledge Extraction in Public-Key Models

A. Yao, M. Yung, Yunlei Zhao, 2010, Journal of Cryptology.

A study of concrete computational complexity.

Andrew Chi-Chih Yao, A. Yao, 1975 .

On the Improbability of Reaching Byzantine Agreements (Preliminary Version)

Andrew Chi-Chih Yao, Ronald L. Graham, A. Yao, 1989, STOC 1989.

An Almost Optimal Algorithm for Unbounded Searching

Andrew Chi-Chih Yao, Jon Louis Bentley, A. Yao, 1976, Inf. Process. Lett..

A Note on the Analysis of Extendible Hashing

Andrew Chi-Chih Yao, A. Yao, 1980, Inf. Process. Lett..

On Computing Algebraic Functions Using Logarithms and Exponentials

Dima Grigoriev, Andrew Chi-Chih Yao, Michael F. Singer, 1995, SIAM J. Comput..

When do Models Generalize? A Perspective from Data-Algorithm Compatibility

A. Yao, Yang Yuan, Jiaye Teng, 2022, 2202.06054.

Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings

Andrew Chi-chih Yao, A. Yao, 2010, ICS.

An authenticated and secure accounting system for international emissions trading pdf

Andrew Chi-Chih Yao, Chenxing Li, Yang Yu, 2020, Climate Policy.

Concurrent Knowledge Extraction in the Public-Key Model

Yunlei Zhao, Moti Yung, Andrew C. Yao, 2009, ICALP.

Protocols for secure computations

Andrew Chi-Chih Yao, A. Yao, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

On the security of public key protocols

Danny Dolev, Andrew Chi-Chih Yao, A. Yao, 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

Divergences of Massive Yang-Mills Theories: Higher Groups

A. Yao, S. Glashow, J. Iliopoulos, 1971 .

Interactive Proofs for Quantum Computation

Andrew Chi-Chih Yao, A. Yao, 2003, ISAAC.

Quantum Circuit Complexity

Andrew Chi-Chih Yao, A. Yao, 1993, FOCS.

Some Monotonicity Properties of Partial Orders

Andrew Chi-Chih Yao, F. Frances Yao, Ronald L. Graham, 1979, SIAM J. Algebraic Discret. Methods.

On random 2–3 trees

Andrew Chi-Chih Yao, A. Yao, 1978, Acta Informatica.

New Algorithms for Bin Packing

Andrew Chi-Chih Yao, A. Yao, 1978, JACM.

Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems

Tsuyoshi Ito, Andrew Chi-Chih Yao, Xiaoming Sun, 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.

Oblivious and Adaptive Strategies for the Majority and Plurality Problems

Andrew Chi-Chih Yao, Fan Chung Graham, Ronald L. Graham, 2005, Algorithmica.

Storing a sparse table

Robert E. Tarjan, Andrew Chi-Chih Yao, A. Yao, 1979, CACM.

Quantum cryptography with imperfect apparatus

Andrew Chi-Chih Yao, Dominic Mayers, A. Yao, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Space-time tradeoff for answering range queries (Extended Abstract)

Andrew Chi-Chih Yao, A. Yao, 1982, STOC '82.

Concurrent Knowledge Extraction in Public-Key Models

Yunlei Zhao, Moti Yung, Andrew Chi-Chih Yao, 2014, Journal of Cryptology.

OAKE: a new family of implicitly authenticated diffie-hellman protocols

Yunlei Zhao, Andrew Chi-Chih Yao, A. Yao, 2013, CCS.

A note on the feasibility of generalised universal composability†

Yunlei Zhao, Andrew Chi-Chih Yao, F. Frances Yao, 2009, Mathematical Structures in Computer Science.

On Signatures and Authentication

Silvio Micali, Andrew Chi-Chih Yao, Shafi Goldwasser, 1982, CRYPTO.

On the Average-Case Complexity of Selecting the kth Best

Andrew Chi-Chih Yao, F. Frances Yao, A. Yao, 1982, SIAM J. Comput..

An Analysis of (h, k, 1)-Shellsort

Andrew Chi-Chih Yao, A. Yao, 1979, J. Algorithms.

On the average-case complexity of selecting k-th best

Andrew Chi-Chih Yao, F. Frances Yao, A. Yao, 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

Scheduling Unit-Time Tasks with Limited Resources

Andrew Chi-Chih Yao, A. Yao, 1974, Sagamore Computer Conference.

FedCM: Federated Learning with Client-level Momentum pdf

Andrew Chi-Chih Yao, Jing Xu, Sen Wang, 2021, ArXiv.

Dynamic Price Sequence and Incentive Compatibility (Extended Abstract)

Ning Chen, Xiaotie Deng, Andrew Chi-Chih Yao, 2004, ICALP.

Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison

Andrew Chi-Chih Yao, A. Yao, 2017, EC.

Security of quantum protocols against coherent measurements

Andrew Chi-Chih Yao, A. Yao, 1995, STOC '95.

On the Security of Public Key Protocols (Extended Abstract)

Danny Dolev, Andrew Chi-Chih Yao, A. Yao, 1981, FOCS.

Classical physics and the Church--Turing Thesis

Andrew Chi-Chih Yao, A. Yao, 2003, JACM.

An Incentive Analysis of some Bitcoin Fee Designs pdf

Andrew Chi-Chih Yao, A. Yao, 2018, ICALP.

Scaling Nakamoto Consensus to Thousands of Transactions per Second pdf

Wei Xu, Andrew Chi-Chih Yao, Fan Long, 2018, ArXiv.

A Decentralized Blockchain with High Throughput and Fast Confirmation

Dong Zhou, Andrew Chi-Chih Yao, Fan Long, 2020, USENIX Annual Technical Conference.

On the power of quantum fingerprinting

Andrew Chi-Chih Yao, A. Yao, 2003, STOC '03.

Quantum replication at the Heisenberg limit

Andrew Chi-Chih Yao, Giulio Chiribella, Yuxiang Yang, 2013, Nature Communications.

Coherent functions and program checkers

A. Yao, 1990, STOC '90.

Adaptive Concurrent Non-Malleability with Bare Public-Keys

Yunlei Zhao, Moti Yung, Andrew Chi-Chih Yao, 2009, IACR Cryptol. ePrint Arch..

The Complexity of Pattern Matching for a Random String

Andrew Chi-Chih Yao, A. Yao, 1977, SIAM J. Comput..

Near-optimal time-space tradeoff for element distinctness

Andrew Chi-Chih Yao, A. Yao, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

A Lower Bound to Finding Convex Hulls

Andrew Chi-Chih Yao, A. Yao, 1981, JACM.

Relaxing the Feature Covariance Assumption: Time-Variant Bounds for Benign Overfitting in Linear Regression

A. Yao, Jiaye Teng, Jing Xu, 2022, ArXiv.

On the improbability of reaching Byzantine agreements

Andrew Chi-Chih Yao, Ronald L. Graham, A. Yao, 1989, STOC '89.

Computationally-Fair Group and Identity-Based Key-Exchange

Yunlei Zhao, Andrew Chi-Chih Yao, A. Yao, 2012, TAMC.

Privacy-Preserving Authenticated Key-Exchange Over Internet

Yunlei Zhao, Andrew Chi-Chih Yao, A. Yao, 2014, IEEE Transactions on Information Forensics and Security.

A New Family of Practical Non-Malleable Protocols

Yunlei Zhao, Andrew Chi-Chih Yao, A. Yao, 2011, IACR Cryptol. ePrint Arch..

Online/Offline Signatures for Low-Power Devices

Yunlei Zhao, Andrew Chi-Chih Yao, A. Yao, 2013, IEEE Transactions on Information Forensics and Security.

Cumulative Reasoning with Large Language Models

A. Yao, Yang Yuan, Yifan Zhang, 2023, arXiv.org.

On the Expected Performance of Path Compression Algorithms

Andrew Chi-Chih Yao, A. Yao, 1985, SIAM J. Comput..

Computational information theory

Andrew Chi-Chih Yao, A. Yao, 1988 .

A New Family of Practical Non-Malleable Diffie-Hellman Protocols pdf

Yunlei Zhao, Andrew Chi-Chih Yao, A. Yao, 2011, ArXiv.

Deniable Internet Key Exchange

Yunlei Zhao, Andrew Chi-Chih Yao, A. Yao, 2010, ACNS.

NQPC = co-C=P

Andrew Chi-Chih Yao, Tomoyuki Yamakami, A. Yao, 1999, Inf. Process. Lett..

Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus

Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao, 1997, STOC '97.

Discrete and continuous min-energy schedules for variable voltage processors

Andrew C Yao, Minming Li, Frances F Yao, 2006, Proc. Natl. Acad. Sci. USA.

On the complexity of comparison problems using linear functions

Andrew Chi-Chih Yao, A. Yao, 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

Information Bounds Are Weak in the Shortest Distance Problem

Andrew Chi-Chih Yao, F. Frances Yao, Ronald L. Graham, 1980, JACM.

An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees

Andrew Chi-Chih Yao, A. Yao, 1975, Inf. Process. Lett..

On revenue maximization for selling multiple independently distributed items

Andrew Chi-Chih Yao, Xinye Li, A. Yao, 2013, Proceedings of the National Academy of Sciences.

Analysis of the subtractive algorithm for greatest common divisors

Andrew Chi-Chih Yao, Donald E. Knuth, A. Yao, 1975, SIGS.

NQP_{C} = co-C_{=}P

Tomoyuki Yamakami, Andrew C. Yao, A. Yao, 1998, quant-ph/9812032.

NQP = co-C=P

Andrew Chi-Chih Yao, Tomoyuki Yamakami, A. Yao, 1998, Electron. Colloquium Comput. Complex..

Cumulative Reasoning with Large Language Models

A. Yao, Yang Yuan, Yifan Zhang, 2023, arXiv.org.

External Hashing Schemes for Collections of Data Structures

Arnold L. Rosenberg, Richard J. Lipton, Andrew Chi-Chih Yao, 1980, JACM.

Towards Data-Algorithm Dependent Generalization: a Case Study on Overparameterized Linear Regression

A. Yao, Yang Yuan, Jiaye Teng, 2022, 2202.06054.

On the Polyhedral Decision Problem

Andrew Chi-Chih Yao, Ronald L. Rivest, A. Yao, 1980, SIAM J. Comput..

An Ω(n2 log n) lower bound to the shortest paths problem

Ronald L. Rivest, Andrew C. Yao, David M. Avis, 1977, STOC '77.

Linear decision trees: volume estimates and topological bounds

László Lovász, Andrew Chi-Chih Yao, Anders Björner, 1992, STOC '92.

On the parallel computation for the knapsack problem

Andrew Chi-Chih Yao, A. Yao, 1981, STOC '81.

On the Evaluation of Powers

Andrew Chi-Chih Yao, A. Yao, 1976, SIAM J. Comput..