2 π meson standing wave in ultra-dense matter, (co-authored with R. F. Sawyer), Physical Review, D7 (1973), 1579- 1586.
3 O (|E| log log |V|) algorithm for finding the minimum spanning tree, Information Processing Express, 4 (1975), 2 1-23.
Analysis of subtraction algorithm of greatest common divisor, (co-authored with D. E. Knuth), Journal of National Academy of Sciences, 72 (1975), 4720-4722.
5 On calculating the minimum value of quadratic form, Proceedings of the 7th ACM Symposium on Computing Theory, Albuquerque, New Mexico, May 1975, 23-26.
6 Complexity of non-uniform random number generation (co-authored with D. E. Knuth), in Algorithm and Complexity: New Direction and Latest Results edited by J. F. Traub, Academic Press, 1976, pp. 357-428.
7 on the evaluation of power, Siam J. on calculation, 5 (1976), 100- 103.
8 Resource-constrained scheduling as a generalized packing problem, (co-authored with M. R. Garey, R. L. Graham and D. S. Johnson), Journal of Combinatorial Theory, A2 1 (1976), 257-298.
9 On the Boundaries of Merged Networks (co-authored with Yao Fufeng), chinese journal of computers, 23 (1976), 566-57 1.
10 has an incomparable rectangle mosaic, (co-authored with E. M. Reingold and W. Sanders), Journal of Entertainment Mathematics, 8 (1976),112-/kloc-0.
1 1 combinatorial optimization problems related to data set allocation, (co-authored with C. K. Wong), Journal of Automation, Information and Operation Research, Supplement No.5 (1976), 83-96.
12 on a Kathona problem of minimal separation system, discrete mathematics, 15 (1976), 193- 199.
An almost optimal algorithm for 13 unbounded search, (co-authored with J. Bentley), Information Processing Express, 5 (1976), 82-87.
14 on the average behavior of set merging algorithm, Proceedings of the 8th ACM Symposium on Computing Theory, hershey, Pennsylvania, May 1976, 192- 195.
15 Complexity of Searching Ordered Random Tables, (co-authored with Yao Fufu), Proceedings of the 17th IEEE Symposium on Basic Computer Science, Houston, Texas, 10/0 1976, 222-227.
16 probability calculation: towards a unified measure of complexity, proceedings of the 18th IEEE Symposium on Fundamentals of Computer Science, Providence, Rhode Island,1October1977,222-227.
17 on cyclic switching addressing, SIAM J. on Computing, 7 (1978), 82-87.
18 on random 2-3 trees, Journal of Information Science, 9 (1978), 159- 170.
19 K+1 head ratio k, (with R. L. Rivest), Journal of ACM, 25 (1978), 337-340.
20 Addition Chain with Multiplication Cost, (co-authored with R. L. Graham and F. F. Yao), Discrete Mathematics, 23 (1978),115-1kloc-0/9.
2 1 Complexity of random string pattern matching, SIAM J. on Computing, 8 (1979), 368-387.
22 Notes by Kam and Ullman on a conjecture of statistical database, Information Processing Communication, 9 (1979), 48-50.
23 storing sparse tables, (together with R. E. Tarjan), ACM Communication, 22 (1979), 606-6 1 1.
On some complexity problems in distributed computing, Proceedings of the 11th ACM Symposium on Computing Theory, Atlanta, Georgia, May 1979, 2009-213.
25 External Hash Scheme for Data Structure Sets, (co-authored with R. J. Lipton and A. L. Rosenberg), ACM Magazine, 27 (1980), 8 1-95.
A new algorithm for packing problem, Journal of ACM, 27 (1980), 207-227.
27 The information circle of the shortest distance problem is weak, (co-authored with R. L. Graham and F. F. Yao), Journal of ACM, 27, (1980), 428-444.
28 stochastic model of packing, (with Coffman, Jr., M. Hofri and K. So, for example), information and control, 44 (1980), 105- 1 15.
29 Analysis of Shellsort, Journal of Algorithms, 1 (1980), 14-50.
On polyhedral decision-making, (co-authored with R. L. Rivest), SIAM J. on Computing, 9 (1980), 343-347.
3 1 On the boundary of selecting networks, SIAM J. on Computing, 9 (1980), 566-582.
Some monotonicity properties of partial orders, (co-authored with R. L. Graham and F. F. Yao), Siam J. On Algebra and Discrete Methods, 1 (1980), 25 1-258.
33 A note on the analysis of extensible hash method, Information Processing Express, 1 1 (1980), 84-86.
Optimal expected time algorithm for nearest point problem, (co-authored with J.L. Bentley and B.W. Wade), Journal of American Computer Society. In mathematics. Software, 6 (1980), 56 1-580.
Effective search through partial order, (co-authored with A. Borodin, L. J. Guibas and N. A. Lynch), Information Processing Newsletter, 12 (198 1), 7 1-75.
Analysis of memory allocation scheme of 36 implementation stack, SIAM J. on Computing, 10 (198 1), 398-403.
Should the tables be sorted? Journal of ACM, 28 (198 1), 6 15-628.
Finding a lower bound of convex hull, Journal of ACM, 28 (198 1), 780-787.
Entropy Limitation of VLSI Computing, Proceedings of the 13th ACM Symposium on Computing Theory, Milwaukee, Wisconsin, May 198 1, 308-3 1 1.
40 Choose the k-th best average complexity, (with F. F. Yao), SIAM J. on Computing, 1 1 (1982), 428-447.
4 1 Complexity of finding cycles in periodic functions, (co-authored with R. Sedgewick and T. G. Szymanski), SIAM J. on Computing, 1 1 (1982), 376-390.
42 On the Time-space Trade-off of Ranking by Linear Query, Theoretical Computer Science, 19 (1982), 203-2 18.
Lower bound of algebraic decision tree, (with J. M. Steele, Jr.), Journal of Algorithms, 3 (1982), 1-8.
Parallel computing of knapsack problem, Journal of ACM, 29 (1982), 898-903.
On the construction of minimum spanning tree in k-dimensional space and related problems, SIAM J. on Computing, 1 1 (1982), 72 1-736.
46 "Equality and Justice of Unequal Share of Cake" (co-authored with M. Klawe), National Assembly No.36 (1982), pp. 247-260.
47 Reconfigurable Networks with Finite Depth, (co-authored with N. Pippenger), Siam J. On Algebra and Discrete Methods, 3 (1982), 41-417.
Space-time trade-offs of answering range queries, Proceedings of the 14th ACM Symposium on Computing Theory, San Francisco, California, 1982, 128- 136.
Theory and application of trapdoor function, proceedings of 23rd IEEE Symposium on Fundamentals of Computer Science, Chicago, Illinois, 1 1 month1982,80-91.
50 Secure Computing Protocol, Proceedings of 23rd IEEE Symposium on Fundamentals of Computer Science, Chicago, Illinois, 1 1 month 1982, 160- 164.
5 1 on the security of public key protocols, (co-authored with D. Dolev), IEEE Trans. On information theory, 29 (1983), 198-208.
Top 52 Signature Scheme (co-authored with S. Goldwasser and S. Micali), Proceedings of the 15th ACM Symposium on Computing Theory, Boston, Massachusetts, April1983,431-439.
53 The Lower Limit of Probabilistic Argument, Proceedings of the 24th IEEE Symposium on Fundamentals of Computer Science, Tucson, Arizona,1/month1983,420-428.
54 Context-free Grammar and Random Number Generation, Proceedings of the Seminar on NATO Word Combination Algorithms, Malatai, Italy, July 1984, edited by A. Apostolico and Z. Galil, Academic Press, 357-36 1.
55 Fault-tolerant Network for Sorting, (co-authored with F. F. Yao), SIAM J. on Computing, 14 (1985), 120- 128.
On the expected performance of path compression, SIAM J. on Computing, 14 (1985), 129- 133.
57 On the Optimal Arrangement of Keys with Double Hashes, Journal of Algorithms, 6 (1985), 253-264.
Uniform hash is the best, Journal of American Computer Society, 32 (1985), 687-693.
On the complexity of maintaining partial sums, SIAM J. on Computing, 14 (1985), 253-264.
General method of 60-D geometric query, (co-authored with F. F. Yao), Proceedings of the 17th ACM Symposium on Computing Theory, Providence, Rhode Island, May 1985, 163- 168.
6 1 separating polynomial time hierarchy through Oracles, Proceedings of 26th IEEE Symposium on Basic Computer Science, Eugene, Oregon, 10/985, 1- 10.
How to Generate and Exchange Secrets, Proceedings of 27th IEEE Symposium on Fundamentals of Computer Science, Toronto, Canada, 10/986, 162- 167.
The monotone bipartite graph is evasive, SIAM J. on Computing, 17 (1988), 5 17-520.
Computational information theory, in Complexity in Information Theory, edited by Y. Abu-Mostafa, springer Publishing House, 1988, 1- 15.
Use the median test to select the k largest values, Algorithmica, 4 (1989), 293-300.
On the complexity of partial sequence production, SIAM J. on Computing, 18 (1989), 679-689.
On the possibility of reaching a Byzantine agreement, Proceedings of the 2nd1ACM Symposium on Computing Theory, Seattle, Washington, May 1989, 467-478.
Circuit and Local Computing, Proceedings of the 2nd ACM Symposium on Computing Theory, Seattle, Washington, May 1989, 186- 196.
Calculation of Boolean Function by Unreliable Testing, (with C. Kenyon-Mathieu), International Journal of Basic Computer Science, 1 (1990), 1- 10.
Coherence function and program checker, proceedings of the 22nd ACM conference on computational theory, Baltimore, Maryland, 1990, 84-94.
7 1 On ACC and Threshold Circuits, Proceedings of the 3rd IEEE Symposium on Fundamentals of Computer Science,1October1990,619-627.
Lower bound of randomization algorithm for graph properties, Journal of Computer and System Science, 42 (199 1), 267-287.
Lower bound of algebraic computation tree with integer input, SIAM J. On Computing, 20 (199 1), 655-668.
Program Checker for Probability Generation, Proceedings of the 18th International Symposium on Automata, Language and Programming, Madrid, Spain, July 199 1, 163- 173.
Linear Decision Tree: Volume Estimation and Topological Bounds. Oumlrner and L. Lovász) Proceedings of the 24th ACM Symposium on Computing Theory, May, 1992, 170- 177.
A circuit-based proof of Toda theorem, (with R. Kannan, H. Venkateswaran and V. Vinay) information and calculation, 104 (1993), 27 1-276.
77 Towards an Innovatable Benchmark, Proceedings of the 8th IEEE Annual Complex Structure Conference (co-authored with J. Cai, R. Lipton and R. Sedgewick), San Diego, California, May, 1993, 2- 1 1.
Complexity of Quantum Circuits, Proceedings of the 34th IEEE Symposium on Fundamentals of Computer Science, Palo Alto, California,1/month1993,352-361.
79 Random Algorithm for Maximum Parity Test, (with H. F. Ting), Information Processing Communication, 49 (1994), 39-43.
Near-optimal space-time compromise of 80 element clarity, SIAM J. On Computing, 23 (1994), 966-975.
Lower bound of monotone depth of 8 1 connectivity, Proceedings of the 35th IEEE Symposium on Fundamentals of Computer Science, Santa Fe, New Mexico, 1 1 month1994,302-308.
Calculation of Algebraic Functions by Logarithm and Exponent (with D. grigoriev and M. Singh), Siam Journal of Computing, 24 (1995), 242-246.
Algebraic decision tree and Euler characteristics, theoretical computer science, 14 1 (1995), 133- 150.
On the shrinkage index of one-time reading formula, (co-authored with J. Hastad and A. Razborov), Theoretical Computer Science, 14 1 (1995), 269-282.
Minimum optimal key arrangement in hash table, Algorithmica, 14 (1995), 409-428.
Security of quantum protocol against coherent measurement, proceedings of the 27th ACM conference on computational theory, Las Vegas, Nevada, May 1995, 67-75.
Decision Tree Complexity and Betti Number, Journal of Computer and System Science, 55 (1997), 36-43.
There is an incorrect dictionary lookup, (co-authored with Yao Fufu), Journal of Algorithms, 25 (1997), 194-202.
One-time reading branching program, rectangular proof of pigeon hole principle and crosscutting calculus, (co-authored with A. Razborov and A. Wigderson), Proceedings of the 29th ACM Symposium on Computing Theory, May1997,739-784.
90 RAPID: random pharmacophore identification of drug design, (co-authored with L. Kavraki, J. Latombe, R. Motwani, C. Shelton and S. Venkatasubramanian), 1997 ACM Symposium on Applied Computational Geometry, Nice, France, 1997,324-.
9 1 Lower Bound of Algebraic Decision Tree Size of Maximum Problem, (with D. grigoriev and M. Karpinski), Computational Complexity, 7 (1998), 193-203.
Quantum cryptography with imperfect equipment, (co-authored with D. Mayers), Proceedings of the 39th IEEE Symposium on Fundamentals of Computer Science,1October,1998,503-509.
93 NQP C = co-C = P, (with T. Yamakami), Information Processing Express, 7 1 (1999), 63-69.
Quantum bit hosting (co-authored with A. Aharonov, A. Ta-Shma and U. Vazirani), Proceedings of the 32nd ACM Symposium on Computing Theory, May 2000, 7 15-724.
95 The direct sum of information complexity and simultaneous information complexity, (co-authored with A. Chakrabarti, Y. Shi and A. Wirth), 42nd IEEE Symposium on Basic Computer Science, 200610,5438+0,270-278.
96 Classical Physics and Church-Turing Papers, Journal of American Computer Society, 50 (2003), 100- 105.
On the Power of Quantum Fingerprint, Proceedings of the 35th ACM Symposium on Computing Theory, June 2003, 77-8 1.
Graph properties and cyclic functions: how low can the complexity of quantum query be? (co-authored with X. Sun and S. Zhang), 19 IEEE Conference on Computing Complexity, Amherst, Massachusetts, June 2004, 286-293.
99 Graph Entropy and Quantum Ordering, Proceedings of the 36th ACM Symposium on Computing Theory, June 2004,112-117.
100 incentive-compatible price series in dynamic auction, (co-authored with N. Chen, X. Deng and X. Sun), Proceedings of the 31st International Symposium on Automata, Language and Programming, Turku, Finland, July 2004 (computer science lecture # 3 142, Springer), 320-.
10 1 Fisher Equilibrium Price with a Kind of Concave Utility Function (co-authored with N. Chen, X. Deng and X. Sun), Proceedings of the 12th Annual Conference on European Algorithms, Bergen, Norway, September 2004 (Computer Science Lecture # 322 1, Springer),/kloc.
102 discrete and continuous minimum energy schedule of variable voltage processor, (co-authored with M. Li and F. Yao), Journal of National Academy of Sciences, 103 (2006), 3983-3987.
103 Quantum Query Complexity of 2D and 3D Local Search, (co-authored with Sun Xiaoming), Proceedings of the 47th IEEE Annual Conference on Basic Computer Science, Berkeley, California, 2006 10, 429-438.
104 a note on universal combinable zero knowledge in common reference string model (co-authored with Frances F. Yao and)), the 4th Annual Conference on Computational Model Theory and Application, China, May 2007.
105 a note on generalized universal composability (co-authored with Frances F. Yao and)), the 4th annual conference on computational model theory and application, China, Shanghai, May 2007.
106 graph design of secure multiparty computation on non-Abelian groups
107 generalized Tsirelson inequality, interactive proof system of commutative operator prover and multiple provers
108 Tsuyoshi Ito, Hiroto Kobayashi, Daniel Preda, Sun Xiaoming and Andrew Yao Qizhi generalized the Tsirelson inequality, the interactive proof system of commutative operator prover and multi-prover.
109 Sun Xiaoming, Andrew Yao Qizhi and Christopher Tatar designed secure multiparty computation on non-Abelian groups.
Andrew Yao Qizhi, Sun Xiaoming. On the quantum query complexity of local search in two-dimensional and three-dimensional, published in Algorithmica, Volume 55, No.3 (2009), page 576.
111Andrew C. C. Yao, Frances F. Yao, A Note on Universal Combinable Zero Knowledge Public Reference String Model Theory Computer Science 2009
1 12 Andrew C.C. Yao, Frances F. Yao, A note on the feasibility of generalized universal combinable mathematical structure in computer science 2009.
1 13 Yao, Rong, and, concurrent knowledge extraction in public key model, ICALP 20 10
Yao he. Deniable Internet Key Exchange, ACNS20 10