Yao, Andrew ChiChih
Overview
Works:  57 works in 158 publications in 2 languages and 242 library holdings 

Roles:  Author 
Classifications:  QA76, 510.7808 
Publication Timeline
.
Most widely held works about
Andrew ChiChih Yao
Most widely held works by
Andrew ChiChih Yao
A study of concrete computational complexity by
Andrew ChiChih Yao(
Book
)
5 editions published in 1975 in English and held by 17 WorldCat member libraries worldwide
5 editions published in 1975 in English and held by 17 WorldCat member libraries worldwide
On computing the rank function for a set of vectors by
Andrew ChiChih Yao(
Book
)
4 editions published in 1975 in English and held by 10 WorldCat member libraries worldwide
4 editions published in 1975 in English and held by 10 WorldCat member libraries worldwide
Lower bounds on merging networks by
Andrew ChiChih Yao(
Book
)
3 editions published in 1974 in English and held by 9 WorldCat member libraries worldwide
3 editions published in 1974 in English and held by 9 WorldCat member libraries worldwide
An O(/E/loglog/V/) algorithm for finding minimum spanning trees by
Andrew ChiChih Yao(
Book
)
4 editions published in 1974 in English and held by 9 WorldCat member libraries worldwide
4 editions published in 1974 in English and held by 9 WorldCat member libraries worldwide
On the evaluation of powers by
Andrew ChiChih Yao(
Book
)
4 editions published in 1974 in English and held by 8 WorldCat member libraries worldwide
4 editions published in 1974 in English and held by 8 WorldCat member libraries worldwide
On random 32 trees by
Andrew ChiChih Yao(
Book
)
3 editions published in 1974 in English and held by 8 WorldCat member libraries worldwide
3 editions published in 1974 in English and held by 8 WorldCat member libraries worldwide
Uniform hashing is optimal by
Andrew ChiChih Yao(
Book
)
4 editions published between 1985 and 1986 in English and held by 7 WorldCat member libraries worldwide
4 editions published between 1985 and 1986 in English and held by 7 WorldCat member libraries worldwide
On a problem of Katona on minimal separating systems by
Andrew ChiChih Yao(
Book
)
2 editions published in 1974 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1974 in English and held by 7 WorldCat member libraries worldwide
Should tables be sorted? by
Andrew ChiChih Yao(
Book
)
5 editions published in 1979 in English and Undetermined and held by 7 WorldCat member libraries worldwide
5 editions published in 1979 in English and Undetermined and held by 7 WorldCat member libraries worldwide
On the security of public key protocols by
D Dolev(
Book
)
5 editions published in 1981 in English and Undetermined and held by 7 WorldCat member libraries worldwide
5 editions published in 1981 in English and Undetermined and held by 7 WorldCat member libraries worldwide
K+1 heads are better than K by
Andrew ChiChih Yao(
Book
)
3 editions published in 1976 in English and held by 7 WorldCat member libraries worldwide
There are languages which can be recognized by a deterministic (k+1)headed oneway finite automaton but which cannot be recognized by a kheaded oneway (deterministic or nondeterministic) finite automaton. Furthermore, there is a language accepted by a kheaded nondeterministic finite automaton which is accepted by no kheaded deterministic finite automaton. (Author)
3 editions published in 1976 in English and held by 7 WorldCat member libraries worldwide
There are languages which can be recognized by a deterministic (k+1)headed oneway finite automaton but which cannot be recognized by a kheaded oneway (deterministic or nondeterministic) finite automaton. Furthermore, there is a language accepted by a kheaded nondeterministic finite automaton which is accepted by no kheaded deterministic finite automaton. (Author)
On faulttolerant networks for sorting by
Andrew ChiChih Yao(
Book
)
5 editions published in 1979 in English and held by 7 WorldCat member libraries worldwide
5 editions published in 1979 in English and held by 7 WorldCat member libraries worldwide
The complexity of pattern matching for a random string by
Andrew ChiChih Yao(
Book
)
4 editions published in 1977 in English and held by 6 WorldCat member libraries worldwide
4 editions published in 1977 in English and held by 6 WorldCat member libraries worldwide
Lower bounds for algebraic decision trees by
J. Michael Steele(
Book
)
5 editions published in 1980 in English and held by 6 WorldCat member libraries worldwide
A topological method is given for obtaining lower bounds for the height of algebraic decision trees. The method is applied to the knapsack problem where an (Omega) (n squared) bound is obtained for trees with boundeddegree polynomial tests, thus extending the DobkinLipton result for linear trees. Applications to the convex hull problem and the distinct element problem are also indicated. Some open problems are discussed. (Author)
5 editions published in 1980 in English and held by 6 WorldCat member libraries worldwide
A topological method is given for obtaining lower bounds for the height of algebraic decision trees. The method is applied to the knapsack problem where an (Omega) (n squared) bound is obtained for trees with boundeddegree polynomial tests, thus extending the DobkinLipton result for linear trees. Applications to the convex hull problem and the distinct element problem are also indicated. Some open problems are discussed. (Author)
New algorithms in bin packing by
Andrew ChiChih Yao(
Book
)
6 editions published in 1978 in English and Undetermined and held by 6 WorldCat member libraries worldwide
6 editions published in 1978 in English and Undetermined and held by 6 WorldCat member libraries worldwide
Some monotonicity properties of partial orders by
Ronald L Graham(
Book
)
6 editions published between 1979 and 1980 in English and held by 6 WorldCat member libraries worldwide
6 editions published between 1979 and 1980 in English and held by 6 WorldCat member libraries worldwide
An analysis of (h, k, l)shellsort by
Andrew ChiChih Yao(
Book
)
4 editions published in 1979 in English and held by 6 WorldCat member libraries worldwide
4 editions published in 1979 in English and held by 6 WorldCat member libraries worldwide
On the timespace tradeoff for sorting with linear queries by
Andrew ChiChih Yao(
Book
)
5 editions published in 1979 in English and held by 6 WorldCat member libraries worldwide
5 editions published in 1979 in English and held by 6 WorldCat member libraries worldwide
Optimal expectedtime algorithms for closestpoint problems by
Jon Louis Bentley(
Book
)
2 editions published in 1979 in English and held by 5 WorldCat member libraries worldwide
Geometric closestpoint problems deal with the proximity relationships in kdimensional point sets. Examples of closestpoint problems include building minimum spanning trees, nearest neighbor searching, and triangulation construction. Shamos and Hoey (1975) have shown how the Voronoi diagram can be used to solve a number of planar closestpoint problems in optimal worstcase time. In this paper we extend their work by giving optimal expectedtime algorithms for solving a number of closestpoint problems in k space, including nearest neighbor searching, finding all nearest neighbors, and computing planar minimum spanning trees. In addition to establishing theoretical bounds, the algorithms in this paper can be implemented to solve practical problems very efficiently
2 editions published in 1979 in English and held by 5 WorldCat member libraries worldwide
Geometric closestpoint problems deal with the proximity relationships in kdimensional point sets. Examples of closestpoint problems include building minimum spanning trees, nearest neighbor searching, and triangulation construction. Shamos and Hoey (1975) have shown how the Voronoi diagram can be used to solve a number of planar closestpoint problems in optimal worstcase time. In this paper we extend their work by giving optimal expectedtime algorithms for solving a number of closestpoint problems in k space, including nearest neighbor searching, finding all nearest neighbors, and computing planar minimum spanning trees. In addition to establishing theoretical bounds, the algorithms in this paper can be implemented to solve practical problems very efficiently
A lower bound to finding convex hulls by
Andrew ChiChih Yao(
Book
)
4 editions published in 1979 in English and held by 5 WorldCat member libraries worldwide
4 editions published in 1979 in English and held by 5 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Boolean rings Branching processes Chemists China Chinese University of Hong Kong.Shaw College Computational complexity Computer network protocols Computer networksSecurity measures Computer programming ComputersAccess control ComputersAccess controlKeystroke timing authentication Computer scientists Computer security Convex sets Database searching Data encryption (Computer science) Data structures (Computer science) Decision trees Diplomats Errorcorrecting codes (Information theory) Exponents (Algebra)Data processing Faulttolerant computing Geometry Hashing (Computer science) Heuristic programming Information retrieval Linear algebraic groups Linear programming List processing (Electronic computers) Machine theory Maxima and minimaData processing Monotonic functions Partially ordered spaces Pattern recognition systems Physicians Programming languages (Electronic computers) Ramsey theory Robots Scholars Search theory Sequences (Mathematics)Data processing Set theory Sorting (Electronic computers) Stochastic programming Taiwan Trees (Graph theory) Trees (Graph theory)Data processing Vector algebraData processing Zhong, Nanshan
Alternative Names
Andrew ChiChih Yao
Andrew Jao
Andrew Yao Chinees informaticus
Andrew Yao chinesischamerikanischer Informatiker
Andrew Yao Taiwanese American computer scientist
Iâu Kîtì
Ендру Јау
Ендрю Яо
Яо, Эндрю
אנדרו יאו
اندرو یائو
اندرو یائو دانشمند علوم کامپیوتر آمریکایی
অ্যান্ড্রু ইয়াও
앤드루 야오
アンドリュー・チーチー・ヤオ
姚期智
姚期智 美籍华人计算机科学家
Languages