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

Roles:  Author 
Classifications:  QA76, 001.6408 S 
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
)
3 editions published in 1975 in English and held by 13 WorldCat member libraries worldwide
3 editions published in 1975 in English and held by 13 WorldCat member libraries worldwide
Lower bounds on merging networks by
Andrew ChiChih Yao(
Book
)
2 editions published in 1974 in English and held by 6 WorldCat member libraries worldwide
2 editions published in 1974 in English and held by 6 WorldCat member libraries worldwide
Should tables be sorted? by
Andrew ChiChih Yao(
Book
)
4 editions published in 1979 in English and Undetermined and held by 6 WorldCat member libraries worldwide
4 editions published in 1979 in English and Undetermined and held by 6 WorldCat member libraries worldwide
An O(/E/loglog/V/) algorithm for finding minimum spanning trees by
Andrew ChiChih Yao(
Book
)
3 editions published in 1974 in English and held by 6 WorldCat member libraries worldwide
3 editions published in 1974 in English and held by 6 WorldCat member libraries worldwide
On the evaluation of powers by
Andrew ChiChih Yao(
Book
)
2 editions published in 1974 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1974 in English and held by 5 WorldCat member libraries worldwide
An analysis of (h, k, l) shellsort by
Andrew ChiChih Yao(
Book
)
3 editions published in 1979 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1979 in English and held by 5 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 5 WorldCat member libraries worldwide
2 editions published in 1974 in English and held by 5 WorldCat member libraries worldwide
On the timespace tradeoff for sorting with linear queries by
Andrew ChiChih Yao(
Book
)
4 editions published in 1979 in English and Undetermined and held by 5 WorldCat member libraries worldwide
4 editions published in 1979 in English and Undetermined and held by 5 WorldCat member libraries worldwide
On computing the rank function for a set of vectors by
Andrew ChiChih Yao(
Book
)
2 editions published in 1975 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1975 in English and held by 5 WorldCat member libraries worldwide
On random 32 trees by
Andrew ChiChih Yao(
Book
)
2 editions published in 1974 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1974 in English and held by 4 WorldCat member libraries worldwide
On the parallel computation for the knapsack problem by
Andrew ChiChih Yao(
Book
)
3 editions published in 1980 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1980 in English and held by 4 WorldCat member libraries worldwide
The complexity of pattern matching for a random string by
Andrew ChiChih Yao(
Book
)
2 editions published in 1977 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1977 in English and held by 4 WorldCat member libraries worldwide
Optimal expectedtime algorithms for closestpoint problems by
Jon Louis Bentley(
Book
)
1 edition published in 1979 in English and held by 4 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
1 edition published in 1979 in English and held by 4 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
Uniform hashing is optimal by
Andrew ChiChih Yao(
Book
)
1 edition published in 1985 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 4 WorldCat member libraries worldwide
Probabilistic behavior of shortest paths over unbounded regions by
Andrew ChiChih Yao(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Let k> 1 and P be a probability distribution over R[superscript k] with all its absolute [mu]th moments being finite for some [mu]> k/(k  1). Let v₁, v₂ ... be an infinite sequence of random points, each indepdently [sic] distributed according to P. It is shown that the length of the shortest travelingsalesman's tour through v₁, v₂ ... v[subscript n] is, for large n, almost surely around [alpha]pn[superscript (k1)/k] for some constant [alpha]p. This proves a conjecture of Beardwood, Halton and Hammersley (Proc. Camb. Phil. Soc. 55 (1959), 299327)."
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Let k> 1 and P be a probability distribution over R[superscript k] with all its absolute [mu]th moments being finite for some [mu]> k/(k  1). Let v₁, v₂ ... be an infinite sequence of random points, each indepdently [sic] distributed according to P. It is shown that the length of the shortest travelingsalesman's tour through v₁, v₂ ... v[subscript n] is, for large n, almost surely around [alpha]pn[superscript (k1)/k] for some constant [alpha]p. This proves a conjecture of Beardwood, Halton and Hammersley (Proc. Camb. Phil. Soc. 55 (1959), 299327)."
A lower bound to finding convex hulls by
Andrew ChiChih Yao(
Book
)
3 editions published in 1979 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1979 in English and held by 4 WorldCat member libraries worldwide
K+1 Heads are Better than K by
Andrew ChiChih Yao(
Book
)
1 edition published in 1976 in English and held by 3 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)
1 edition published in 1976 in English and held by 3 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)
New algorithms in bin packing by
Andrew ChiChih Yao(
Book
)
3 editions published in 1978 in English and Undetermined and held by 3 WorldCat member libraries worldwide
3 editions published in 1978 in English and Undetermined and held by 3 WorldCat member libraries worldwide
A Lower Bound to Palindrome Recognition by Probabilistic : Turing Machines by
Andrew ChiChih Yao(
Book
)
3 editions published in 1977 in English and Undetermined and held by 3 WorldCat member libraries worldwide
3 editions published in 1977 in English and Undetermined and held by 3 WorldCat member libraries worldwide
On evaluating Boolean functions with unreliable tests by
Claire Kenyon(
Book
)
1 edition published in 1990 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 3 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Stanford University Computer Science Department
 Yao, Foong Frances
 Yao, F. Frances
 Graham, Ronald L. 1935 Author
 Weide, Bruce W.
 Bentley, Jon Louis Author
 Kenyon, Claire Author
 Rivest, Ronald L.
 Grigorʹev, Dima J. Author
 Chinese University of Hong Kong Shaw College Sir Run Run Shaw Distinguished Visiting Scholar (2001/02 : Chinese University of Hong Kong)
Useful Links
Associated Subjects
Algebra, Boolean Algorithms Branch and bound algorithms Branching processes Chemists China Chinese University of Hong Kong.Shaw College Computational complexity Computer programming Computer scientists Convex sets Database searching Data structures (Computer science) Decision trees Diplomats Distribution (Probability theory) Exponents (Algebra)Data processing Geometry Geometry, Differential Hashing (Computer science) Heuristic programming Information retrieval Koh, Tommy T. B.(Tommy Thong Bee), Lee, Yuan Tseh, List processing (Electronic computers) Machine theory Maxima and minimaData processing Operations research Parallel processing (Electronic computers) Pattern recognition systems Physicians Programming languages (Electronic computers) Ramsey theory Robots Scholars Search theory Sequences (Mathematics) Sequences (Mathematics)Data processing Set theory Set theoryData processing Singapore Sorting (Electronic computers) Taiwan Trees (Graph theory) Trees (Graph theory)Data processing Turing machines Vector algebraData processing Yao, Andrew ChiChih Zhong, Nanshan
Alternative Names
Andrew ChiChih Yao
Andrew Jao
Andrew Yao Chinees informaticus
Andrew Yao chinesischamerikanischer Informatiker
Andrew Yao Taiwanese American computer scientist
Ендру Јау
Ендрю Яо
Яо, Эндрю
אנדרו יאו
اندرو یائو دانشمند علوم کامپیوتر آمریکایی
অ্যান্ড্রু ইয়াও
앤드루 야오
アンドリュー・チーチー・ヤオ
姚期智
姚期智 美籍华人计算机科学家
Languages