Andrew Chi-Chih Yao

175 papers A* 49A 6B 8C 4Misc 2Journal 98Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Probing the Lack of Stable Internal Beliefs in LLMs. CoRR Yifan Luo, Kangping Xu, Yanzhen Lu, Yang Yuan, Andrew Chi-Chih Yao
2025	J	`jnl`	Clarifying Before Reasoning: A Coq Prover with Structural Context. CoRR Yanzhen Lu, Hanbin Yang, Xiaodie Wang, Ge Zhang, Biao Li, Chenxu Fu, Chao Li, Yang Yuan, Andrew Chi-Chih Yao
2025	J	`jnl`	Existing LLMs Are Not Self-Consistent For Simple Tasks. CoRR Zhenru Lin, Jiawen Tao, Yang Yuan, Andrew Chi-Chih Yao
2025	J	`jnl`	Group Representational Position Encoding. CoRR Yifan Zhang, Zixiang Chen, Yifeng Liu, Zhen Qin, Huizhuo Yuan, Kangping Xu, Yang Yuan, Quanquan Gu, Andrew Chi-Chih Yao
2025	J	`jnl`	Tensor Product Attention Is All You Need. CoRR Yifan Zhang, Yifeng Liu, Huizhuo Yuan, Zhen Qin, Yang Yuan, Quanquan Gu, Andrew Chi-Chih Yao
2025	J	`jnl`	Towards Automated Formal Verification of Backend Systems with LLMs. CoRR Kangping Xu, Yifan Luo, Yang Yuan, Andrew Chi-Chih Yao
2024	J	`jnl`	Augmenting Math Word Problems via Iterative Question Composing. CoRR Haoxiong Liu, Yifan Zhang, Yifan Luo, Andrew Chi-Chih Yao
2024	J	`jnl`	AutoMathText: Autonomous Data Selection with Language Models for Mathematical Texts. CoRR Yifan Zhang, Yifan Luo, Yang Yuan, Andrew Chi-Chih Yao
2024	J	`jnl`	On the Diagram of Thought. CoRR Yifan Zhang, Yang Yuan, Andrew Chi-Chih Yao
2023	J	`jnl`	Cumulative Reasoning with Large Language Models. CoRR Yifan Zhang, Jingqin Yang, Yang Yuan, Andrew Chi-Chih Yao
2022	J	`jnl`	Perspectives from the second Global Forum on Development of Computer Science. Sci. China Inf. Sci. Andrew Chi-Chih Yao, Xia Yin, Yinqun Liu, Guoliang Li
2022	J	`jnl`	Relaxing the Feature Covariance Assumption: Time-Variant Bounds for Benign Overfitting in Linear Regression. CoRR Jing Xu, Jiaye Teng, Andrew Chi-Chih Yao
2021	J	`jnl`	FedCM: Federated Learning with Client-level Momentum. CoRR Jing Xu, Sen Wang, Liwei Wang, Andrew Chi-Chih Yao
2020	—	`conf`	A Decentralized Blockchain with High Throughput and Fast Confirmation. USENIX ATC Chenxing Li, Peilun Li, Dong Zhou, Zhe Yang, Ming Wu, Guang Yang, Wei Xu, Fan Long, Andrew Chi-Chih Yao
2020	A*	`conf`	An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk). ICALP Andrew Chi-Chih Yao
2020	J	`jnl`	An authenticated and secure accounting system for international emissions trading. CoRR Chenxing Li, Yang Yu, Andrew Chi-Chih Yao, Da Zhang, Xiliang Zhang
2018	J	`jnl`	An Incentive Analysis of some Bitcoin Fee Designs. CoRR Andrew Chi-Chih Yao
2018	B	`conf`	On Revenue Monotonicity in Combinatorial Auctions. SAGT Andrew Chi-Chih Yao
2018	J	`jnl`	Scaling Nakamoto Consensus to Thousands of Transactions per Second. CoRR Chenxing Li, Peilun Li, Wei Xu, Fan Long, Andrew Chi-Chih Yao
2017	A*	`conf`	Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison. EC Andrew Chi-Chih Yao
2017	J	`jnl`	On Revenue Monotonicity in Combinatorial Auctions. CoRR Andrew Chi-Chih Yao
2016	J	`jnl`	Concurrent Knowledge Extraction in Public-Key Models. J. Cryptol. Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao
2016	J	`jnl`	On Solutions for the Maximum Revenue Multi-item Auction under Dominant-Strategy and Bayesian Implementations. CoRR Andrew Chi-Chih Yao
2015	A*	`conf`	An SODA Andrew Chi-Chih Yao
2015	—	`conf`	Interdisciplinarity: A View from Theory of Computation. FCRC Andrew Chi-Chih Yao
2014	J	`jnl`	An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications. CoRR Andrew Chi-Chih Yao
2014	J	`jnl`	Privacy-Preserving Authenticated Key-Exchange Over Internet. IEEE Trans. Inf. Forensics Secur. Andrew Chi-Chih Yao, Yunlei Zhao
2013	A*	`conf`	OAKE: a new family of implicitly authenticated diffie-hellman protocols. CCS Andrew Chi-Chih Yao, Yunlei Zhao
2013	J	`jnl`	On revenue maximization for selling multiple independently distributed items. Proc. Natl. Acad. Sci. USA Xinye Li, Andrew Chi-Chih Yao
2013	J	`jnl`	Online/Offline Signatures for Low-Power Devices. IEEE Trans. Inf. Forensics Secur. Andrew Chi-Chih Yao, Yunlei Zhao
2012	J	`jnl`	Graph Coloring Applied to Secure Computation in Non-Abelian Groups. J. Cryptol. Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Xiaoming Sun, Christophe Tartary, Huaxiong Wang, Andrew Chi-Chih Yao
2012	C	`conf`	Quantum Computing: A Great Science in the Making. TAMC Andrew Chi-Chih Yao
2011	J	`jnl`	Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum Algorithmica Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao
2010	—	`conf`	Concurrent Knowledge Extraction in the Public-Key Model. ICALP (1) Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao
2010	B	`conf`	Deniable Internet Key Exchange. ACNS Andrew Chi-Chih Yao, Yunlei Zhao
2010	A	`ed.`	Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings ICS Andrew Chi-Chih Yao
2009	J	`jnl`	A note on the feasibility of generalised universal composability. Math. Struct. Comput. Sci. Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
2009	J	`jnl`	A note on universal composable zero-knowledge in the common reference string model. Theor. Comput. Sci. Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
2009	J	`jnl`	Adaptive Concurrent Non-Malleability with Bare Public-Keys CoRR Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao
2009	Misc	`conf`	Communication Complexity and Its Applications. FAW Andrew Chi-Chih Yao
2009	J	`jnl`	Concurrent Knowledge-Extraction in the Public-Key Model CoRR Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao
2009	J	`jnl`	On the Quantum Query Complexity of Local Search in Two and Three Dimensions. Algorithmica Xiaoming Sun, Andrew Chi-Chih Yao
2008	A	`conf`	Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. CCC Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao
2008	A	`conf`	Graph Design for Secure Multiparty Computation over Non-Abelian Groups. ASIACRYPT Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tartary
2008	A	`conf`	Some Perspectives on Complexity-Based Cryptography. ASIACRYPT Andrew Chi-Chih Yao
2007	C	`conf`	A Note on Universal Composable Zero Knowledge in Common Reference String Model. TAMC Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
2007	C	`conf`	A Note on the Feasibility of Generalized Universal Composability. TAMC Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
2007	J	`jnl`	Deniable Internet Key-Exchange. IACR Cryptol. ePrint Arch. Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao, Bin B. Zhu
2007	J	`jnl`	Oblivious and Adaptive Strategies for the Majority and Plurality Problems. Algorithmica Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
2006	A*	`conf`	On the Quantum Query Complexity of Local Search in Two and Three Dimensions. FOCS Xiaoming Sun, Andrew Chi-Chih Yao
2006	C	`conf`	Recent Progress in Quantum Computational Complexity. TAMC Andrew Chi-Chih Yao
2005	Misc	`conf`	Oblivious and Adaptive Strategies for the Majority and Plurality Problems. COCOON Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
2005	B	`conf`	On the Communication Complexity of Co-linearity Problems. MFCS Andrew Chi-Chih Yao
2004	A*	`conf`	Dynamic Price Sequence and Incentive Compatibility (Extended Abstract). ICALP Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
2004	A	`conf`	Fisher Equilibrium Price with a Class of Concave Utility Functions. ESA Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
2004	A	`conf`	Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? CCC Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
2004	A*	`conf`	Graph entropy and quantum sorting problems. STOC Andrew Chi-Chih Yao
2004	J	`jnl`	Self testing quantum apparatus. Quantum Inf. Comput. Dominic Mayers, Andrew Chi-Chih Yao
2003	J	`jnl`	Classical physics and the Church-Turing Thesis. J. ACM Andrew Chi-Chih Yao
2003	J	`jnl`	Finding Favorites Electron. Colloquium Comput. Complex. Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
2003	B	`conf`	Interactive Proofs for Quantum Computation. ISAAC Andrew Chi-Chih Yao
2003	A*	`conf`	On the power of quantum fingerprinting. STOC Andrew Chi-Chih Yao
2002	J	`jnl`	Classical Physics and the Church-Turing Thesis Electron. Colloquium Comput. Complex. Andrew Chi-Chih Yao
2002	J	`jnl`	On the Power of Quantum Fingerprinting Electron. Colloquium Comput. Complex. Andrew Chi-Chih Yao
2002	J	`jnl`	Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. Comb. Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao
2001	A*	`conf`	Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. FOCS Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao
2001	A*	`conf`	Some perspective on computational complexity (abstract). STOC Andrew Chi-Chih Yao
2000	A*	`conf`	Quantum bit escrow. STOC Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao
1999	J	`jnl`	NQP Inf. Process. Lett. Tomoyuki Yamakami, Andrew Chi-Chih Yao
1998	J	`jnl`	An exponential lower bound on the size of algebraic decision trees for Max. Comput. Complex. Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao
1998	J	`jnl`	NQP CoRR Tomoyuki Yamakami, Andrew Chi-Chih Yao
1998	J	`jnl`	NQP = co-C Electron. Colloquium Comput. Complex. Tomoyuki Yamakami, Andrew Chi-Chih Yao
1998	A*	`conf`	Quantum Cryptography with Imperfect Apparatus. FOCS Dominic Mayers, Andrew Chi-Chih Yao
1998	J	`jnl`	RAPID: Randomized pharmacophore identification for drug design. Comput. Geom. Paul W. Finn, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian, Andrew Chi-Chih Yao
1997	J	`jnl`	Decision Tree Complexity and Betti Numbers. J. Comput. Syst. Sci. Andrew Chi-Chih Yao
1997	J	`jnl`	Dictionary Look-Up with One Error. J. Algorithms Andrew Chi-Chih Yao, Frances F. Yao
1997	—	`conf`	RAPID: Randomized Pharmacophore Identification for Drug Design. SCG Paul W. Finn, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian, Andrew Chi-Chih Yao
1997	A*	`conf`	Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. STOC Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao
1996	B	`conf`	Hypergraphs and Decision Trees (Abstract). WG Andrew Chi-Chih Yao
1995	J	`jnl`	Algebraic Decision Trees and Euler Characteristics. Theor. Comput. Sci. Andrew Chi-Chih Yao
1995	J	`jnl`	An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX Electron. Colloquium Comput. Complex. Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao
1995	B	`conf`	Dictionary Loop-Up with Small Errors. CPM Andrew Chi-Chih Yao, F. Frances Yao
1995	J	`jnl`	Minimean Optimal Key Arrangements in Hash Tables. Algorithmica Andrew Chi-Chih Yao
1995	J	`jnl`	On Computing Algebraic Functions Using Logarithms and Exponentials. SIAM J. Comput. Dima Grigoriev, Michael F. Singer, Andrew Chi-Chih Yao
1995	J	`jnl`	On the Shrinkage Exponent for Read-Once Formulae. Theor. Comput. Sci. Johan Håstad, Alexander A. Razborov, Andrew Chi-Chih Yao
1995	A*	`conf`	Security of quantum protocols against coherent measurements. STOC Andrew Chi-Chih Yao
1994	A*	`conf`	A Lower Bound for the Monotone Depth of Connectivity FOCS Andrew Chi-Chih Yao
1994	J	`jnl`	A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests. Inf. Process. Lett. Hing-Fung Ting, Andrew Chi-Chih Yao
1994	A*	`conf`	Decision tree complexity and Betti numbers. STOC Andrew Chi-Chih Yao
1994	J	`jnl`	Near-Optimal Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. Andrew Chi-Chih Yao
1993	J	`jnl`	A Circuit-Based Proof of Toda's Theorem Inf. Comput. Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao
1993	B	`conf`	Groups and Algebraic Complexity (Abstract). WADS Andrew Chi-Chih Yao
1993	A*	`conf`	Quantum Circuit Complexity FOCS Andrew Chi-Chih Yao
1993	—	`conf`	Towards Uncheatable benchmarks. SCT Jin-Yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao
1992	A*	`conf`	Algebraic Decision Trees and Euler Characteristics FOCS Andrew Chi-Chih Yao
1992	A*	`conf`	Linear Decision Trees: Volume Estimates and Topological Bounds STOC Anders Björner, László Lovász, Andrew Chi-Chih Yao
1991	J	`jnl`	Lower Bounds for Algebraic Computation Trees with Integer Inputs. SIAM J. Comput. Andrew Chi-Chih Yao
1991	J	`jnl`	Lower Bounds to Randomized Algorithms for Graph Properties. J. Comput. Syst. Sci. Andrew Chi-Chih Yao
1991	A*	`conf`	Program Checkers for Probability Generation. ICALP Sampath Kannan, Andrew Chi-Chih Yao
1991	B	`conf`	Recent Progress in Circuit and Communication Complexity (Abstract). FCT Andrew Chi-Chih Yao
1991	—	`conf`	Weighted Random Assignments with Application to Hashing. ISA Andrew Chi-Chih Yao
1990	A*	`conf`	Coherent Functions and Program Checkers (Extended Abstract) STOC Andrew Chi-Chih Yao
1990	A*	`conf`	On ACC and Threshold Circuits FOCS Andrew Chi-Chih Yao
1990	J	`jnl`	On Evaluating Boolean Functions with Unreliable Tests. Int. J. Found. Comput. Sci. Claire Kenyon, Andrew Chi-Chih Yao
1989	A*	`conf`	Circuits and Local Computation STOC Andrew Chi-Chih Yao
1989	A*	`conf`	Lower Bounds for Algebraic Computation Trees with Integer Inputs FOCS Andrew Chi-Chih Yao
1989	J	`jnl`	On Selecting the k Largest with Median Tests. Algorithmica Andrew Chi-Chih Yao
1989	J	`jnl`	On the Complexity of Partial Order Productions. SIAM J. Comput. Andrew Chi-Chih Yao
1989	A*	`conf`	On the Improbability of Reaching Byzantine Agreements (Preliminary Version) STOC Ronald L. Graham, Andrew Chi-Chih Yao
1988	J	`jnl`	Monotone Bipartite Graph Properties are Evasive. SIAM J. Comput. Andrew Chi-Chih Yao
1988	A*	`conf`	Near-Optimal Time-Space Tradeoff for Element Distinctness FOCS Andrew Chi-Chih Yao
1987	A*	`conf`	Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract) FOCS Andrew Chi-Chih Yao
1986	A*	`conf`	How to Generate and Exchange Secrets (Extended Abstract) FOCS Andrew Chi-Chih Yao
1985	A*	`conf`	A General Approach to d-Dimensional Geometric Queries (Extended Abstract) STOC Andrew Chi-Chih Yao, F. Frances Yao
1985	J	`jnl`	On Fault-Tolerant Networks for Sorting. SIAM J. Comput. Andrew Chi-Chih Yao, F. Frances Yao
1985	J	`jnl`	On Optimal Arrangements of Keys with Double Hashing. J. Algorithms Andrew Chi-Chih Yao
1985	J	`jnl`	On the Complexity of Maintaining Partial Sums. SIAM J. Comput. Andrew Chi-Chih Yao
1985	J	`jnl`	On the Expected Performance of Path Compression Algorithms. SIAM J. Comput. Andrew Chi-Chih Yao
1985	A*	`conf`	Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) FOCS Andrew Chi-Chih Yao
1985	J	`jnl`	Uniform Hashing Is Optimal J. ACM Andrew Chi-Chih Yao
1983	A*	`conf`	Lower Bounds by Probabilistic Arguments (Extended Abstract) FOCS Andrew Chi-Chih Yao
1983	J	`jnl`	On the security of public key protocols. IEEE Trans. Inf. Theory Danny Dolev, Andrew Chi-Chih Yao
1983	A*	`conf`	Strong Signature Schemes STOC Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao
1982	J	`jnl`	Lower Bounds for Algebraic Decision Trees. J. Algorithms J. Michael Steele, Andrew Chi-Chih Yao
1982	J	`jnl`	On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems. SIAM J. Comput. Andrew Chi-Chih Yao
1982	J	`jnl`	On Parallel Computation for the Knapsack Problem. J. ACM Andrew Chi-Chih Yao
1982	A*	`conf`	On Signatures and Authentication. CRYPTO Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao
1982	J	`jnl`	On the Average-Case Complexity of Selecting the kth Best. SIAM J. Comput. Andrew Chi-Chih Yao, F. Frances Yao
1982	J	`jnl`	On the Time-Space Tradeoff for Sorting with Linear Queries. Theor. Comput. Sci. Andrew Chi-Chih Yao
1982	A*	`conf`	Protocols for Secure Computations (Extended Abstract) FOCS Andrew Chi-Chih Yao
1982	A*	`conf`	Space-Time Tradeoff for Answering Range Queries (Extended Abstract) STOC Andrew Chi-Chih Yao
1982	J	`jnl`	The Complexity of Finding Cycles in Periodic Functions. SIAM J. Comput. Robert Sedgewick, Thomas G. Szymanski, Andrew Chi-Chih Yao
1982	A*	`conf`	Theory and Applications of Trapdoor Functions (Extended Abstract) FOCS Andrew Chi-Chih Yao
1981	J	`jnl`	A Lower Bound to Finding Convex Hulls. J. ACM Andrew Chi-Chih Yao
1981	J	`jnl`	An Analysis of a Memory Allocation Scheme for Implementing Stacks. SIAM J. Comput. Andrew Chi-Chih Yao
1981	J	`jnl`	Efficient Searching Using Partial Ordering. Inf. Process. Lett. Allan Borodin, Leonidas J. Guibas, Nancy A. Lynch, Andrew Chi-Chih Yao
1981	A*	`conf`	On the Parallel Computation for the Knapsack Problem STOC Andrew Chi-Chih Yao
1981	A*	`conf`	On the Security of Public Key Protocols (Extended Abstract) FOCS Danny Dolev, Andrew Chi-Chih Yao
1981	J	`jnl`	Should Tables Be Sorted? J. ACM Andrew Chi-Chih Yao
1981	A*	`conf`	The Entropic Limitations on VLSI Computations (Extended Abstract) STOC Andrew Chi-Chih Yao
1980	J	`jnl`	A Note on the Analysis of Extendible Hashing. Inf. Process. Lett. Andrew Chi-Chih Yao
1980	J	`jnl`	A Stochastic Model of Bin-Packing Inf. Control. Edward G. Coffman Jr., Kimming So, Micha Hofri, Andrew Chi-Chih Yao
1980	J	`jnl`	An Analysis of (h, k, 1)-Shellsort. J. Algorithms Andrew Chi-Chih Yao
1980	J	`jnl`	Bounds on Selection Networks. SIAM J. Comput. Andrew Chi-Chih Yao
1980	J	`jnl`	External Hashing Schemes for Collections of Data Structures. J. ACM Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao
1980	J	`jnl`	Information Bounds Are Weak in the Shortest Distance Problem. J. ACM Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao
1980	J	`jnl`	New Algorithms for Bin Packing. J. ACM Andrew Chi-Chih Yao
1980	J	`jnl`	On the Polyhedral Decision Problem. SIAM J. Comput. Andrew Chi-Chih Yao, Ronald L. Rivest
1980	J	`jnl`	Optimal Expected-Time Algorithms for Closest Point Problems. ACM Trans. Math. Softw. Jon Louis Bentley, Bruce W. Weide, Andrew Chi-Chih Yao
1979	J	`jnl`	A Note on a Conjecture of Kam and Ullman Concerning Statistical Databases. Inf. Process. Lett. Andrew Chi-Chih Yao
1979	A*	`conf`	Some Complexity Questions Related to Distributive Computing (Preliminary Report) STOC Andrew Chi-Chih Yao
1979	J	`jnl`	Storing a Sparse Table. Commun. ACM Robert Endre Tarjan, Andrew Chi-Chih Yao
1979	J	`jnl`	The Complexity of Pattern Matching for a Random String. SIAM J. Comput. Andrew Chi-Chih Yao
1978	J	`jnl`	Addition chains with multiplicative cost. Discret. Math. Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao
1978	J	`jnl`	On Random 2-3 Trees. Acta Informatica Andrew Chi-Chih Yao
1978	A*	`conf`	On the Average-case Complexity of Selecting k-th Best FOCS Andrew Chi-Chih Yao, F. Frances Yao
1978	J	`jnl`	On the Loop Switching Addressing Problem. SIAM J. Comput. Andrew Chi-Chih Yao
1978	A*	`conf`	Should Tables Be Sorted? (Extended Abstract) FOCS Andrew Chi-Chih Yao
1978	J	`jnl`	k+1 Heads Are Better than k. J. ACM Andrew Chi-Chih Yao, Ronald L. Rivest
1977	A*	`conf`	An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem STOC Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest
1977	A*	`conf`	Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract) FOCS Andrew Chi-Chih Yao
1976	J	`jnl`	An Almost Optimal Algorithm for Unbounded Searching. Inf. Process. Lett. Jon Louis Bentley, Andrew Chi-Chih Yao
1976	J	`jnl`	Analysis of the subtractive algorithm for greatest common divisors. SIGSAM Bull. Andrew Chi-Chih Yao, Donald E. Knuth
1976	J	`jnl`	Lower Bounds on Merging Networks. J. ACM Andrew Chi-Chih Yao, Foong Frances Yao
1976	J	`jnl`	On a problem of Katona on minimal separating systems. Discret. Math. Andrew Chi-Chih Yao
1976	A*	`conf`	On the Average Behavior of Set Merging Algorithms (Extended Abstract) STOC Andrew Chi-Chih Yao
1976	J	`jnl`	On the Evaluation of Powers. SIAM J. Comput. Andrew Chi-Chih Yao
1976	J	`jnl`	Resource Constrained Scheduling as Generalized Bin Packing. J. Comb. Theory A M. R. Garey, Ronald L. Graham, David S. Johnson, Andrew Chi-Chih Yao
1976	A*	`conf`	The Complexity of Searching an Ordered Random Table (Extended Abstract) FOCS Andrew Chi-Chih Yao, F. Frances Yao
1976	A*	`conf`	k+1 Heads Are Better than k FOCS Andrew Chi-Chih Yao, Ronald L. Rivest
1975	J	`jnl`	An O(\|E\| log log \|V\|) Algorithm for Finding Minimum Spanning Trees. Inf. Process. Lett. Andrew Chi-Chih Yao
1975	A*	`conf`	On Computing the Minima of Quadratic Forms (Preliminary Report) STOC Andrew Chi-Chih Yao
1975	A*	`conf`	On the Complexity of Comparison Problems using Linear Functions (Preliminary Report) FOCS Andrew Chi-Chih Yao
1974	—	`conf`	Bounds on Selection Networks SWAT Andrew Chi-Chih Yao
1974	—	`conf`	Scheduling Unit-Time Tasks with Limited Resources. Sagamore Computer Conference Andrew Chi-Chih Yao