| On the security of public key protocols D Dolev, A Yao IEEE Transactions on information theory 29 (2), 198-208, 1983 | 7830 | 1983 |
| Protocols for secure computations AC Yao 23rd annual symposium on foundations of computer science (sfcs 1982), 160-164, 1982 | 7068 | 1982 |
| How to generate and exchange secrets ACC Yao 27th annual symposium on foundations of computer science (Sfcs 1986), 162-167, 1986 | 5723 | 1986 |
| Theory and application of trapdoor functions AC Yao 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), 80-91, 1982 | 2471 | 1982 |
| Some complexity questions related to distributive computing (preliminary report) ACC Yao Proceedings of the eleventh annual ACM symposium on Theory of computing, 209-213, 1979 | 1826 | 1979 |
| Probabilistic computations: Toward a unified measure of complexity ACC Yao 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 222-227, 1977 | 1587 | 1977 |
| Quantum circuit complexity ACC Yao Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 352-361, 1993 | 1058 | 1993 |
| On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems ACC Yao SIAM Journal on Computing 11 (4), 721-736, 1982 | 818 | 1982 |
| Separating the polynomial-time hierarchy by oracles ACC Yao 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1-10, 1985 | 803 | 1985 |
| Self testing quantum apparatus D Mayers, A Yao arXiv preprint quant-ph/0307205, 2003 | 539 | 2003 |
| Quantum cryptography with imperfect apparatus D Mayers, A Yao Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998 | 530 | 1998 |
| Resource constrained scheduling as generalized bin packing MR Garey, RL Graham, DS Johnson, ACC Yao Journal of Combinatorial Theory, Series A 21 (3), 257-298, 1976 | 516 | 1976 |
| Should tables be sorted? ACC Yao Journal of the ACM (JACM) 28 (3), 615-628, 1981 | 502 | 1981 |
| Optimal expected-time algorithms for closest point problems JL Bentley, BW Weide, AC Yao ACM Transactions on Mathematical Software (TOMS) 6 (4), 563-580, 1980 | 473 | 1980 |
| New algorithms for bin packing ACC Yao Journal of the ACM (JACM) 27 (2), 207-227, 1980 | 433 | 1980 |
| An almost optimal algorithm for unbounded searching JL Bentley, ACC Yao Information processing letters 5 (SLAC-PUB-1679), 1976 | 429 | 1976 |
| Storing a sparse table RE Tarjan, ACC Yao Communications of the ACM 22 (11), 606-611, 1979 | 383 | 1979 |
| On random 2–3 trees ACC Yao Acta informatica 9 (2), 159-170, 1978 | 343 | 1978 |
| Informational complexity and the direct sum problem for simultaneous message complexity A Chakrabarti, Y Shi, A Wirth, A Yao Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 270-278, 2001 | 313 | 2001 |
| Lower bounds by probabilistic arguments AC Yao 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 420-428, 1983 | 306 | 1983 |
