Andrew Yao computer scientist and computational theorist
Yao, Andrew Chi-Chih
Yao, Andrew
VIAF ID: 17919428 (Personal)
Permalink: http://viaf.org/viaf/17919428
Preferred Forms
4xx's: Alternate Name Forms (32)
Works
| Title | Sources |
|---|---|
| búsqueda exponencial |
|
| China computer science vision 2020 |
|
| The Complexity of Finding Cycles in Periodic Functions |
|
| exponential search |
|
| Information bounds are weak in the shortest distance problem |
|
| Innovations in Theoretical Computer Science |
|
| Lower bounds for algebraic decision trees, 1980: |
|
| Lower bounds on merging networks |
|
| Managing extreme AI risks amid rapid progress |
|
| An O(/E/loglog/V/) algorithm for finding minimum spanning trees |
|
| Oblivious and Adaptive Strategies for the Majority and Plurality Problems |
|
| On a problem of Katona on minimal separating systems. |
|
| On computing the rank function for a set of vectors |
|
| On random 3-2 trees |
|
| On the evaluation of powers |
|
| On the shrinkage exponent for read-once formulae |
|
| Protocols for secure computations |
|
| Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus |
|
| Resource constrained scheduling as generalized bin packing |
|
| Some monotonicity properties of partial orders |
|
| A study of concrete computational complexity |
|
| Theory and application of trapdoor functions |
|
| Tiling with Incomparable Rectangles / Edward M. Reingold, Andrew C.-C. Yao and Bill Sands. - (1975-76) |
|
| Zhongguo ji suan ji ke xue ji hua 2020 |
|
| экспоненциальный поиск |
|
| חיפוש אקספוננציאלי |
|
| 中国计算机科学计划2020 |
|
