WorldCat Identities

Yao, Andrew Chi-Chih

Overview
Works: 57 works in 85 publications in 2 languages and 158 library holdings
Classifications: QA76, 001.6408 S
Publication Timeline
Key
Publications about  Andrew Chi-Chih Yao Publications about Andrew Chi-Chih Yao
Publications by  Andrew Chi-Chih Yao Publications by Andrew Chi-Chih Yao
Most widely held works by Andrew Chi-Chih Yao
A study of concrete computational complexity by Andrew Chi-Chih Yao ( Book )
3 editions published in 1975 in English and held by 12 WorldCat member libraries worldwide
Lower bounds on merging networks by Andrew Chi-Chih Yao ( Book )
1 edition published in 1974 in English and held by 6 WorldCat member libraries worldwide
Should tables be sorted? by Andrew Chi-Chih Yao ( Book )
4 editions published in 1979 in English and Undetermined and held by 6 WorldCat member libraries worldwide
On computing the rank function for a set of vectors by Andrew Chi-Chih Yao ( Book )
1 edition published in 1975 in English and held by 6 WorldCat member libraries worldwide
K+1 heads are better than K by Andrew Chi-Chih Yao ( Book )
1 edition published in 1976 in English and held by 5 WorldCat member libraries worldwide
There are languages which can be recognized by a deterministic (k+1)-headed one-way finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, there is a language accepted by a k-headed nondeterministic finite automaton which is accepted by no k-headed deterministic finite automaton. (Author)
Uniform hashing is optimal by Andrew Chi-Chih Yao ( Book )
2 editions published in 1985 in English and held by 5 WorldCat member libraries worldwide
On the time-space tradeoff for sorting with linear queries by Andrew Chi-Chih Yao ( Book )
4 editions published in 1979 in English and Undetermined and held by 5 WorldCat member libraries worldwide
On the evaluation of powers by Andrew Chi-Chih Yao ( Book )
1 edition published in 1974 in English and held by 5 WorldCat member libraries worldwide
An analysis of (h, k, l)-shellsort by Andrew Chi-Chih Yao ( Book )
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 Chi-Chih Yao ( Book )
1 edition published in 1974 in English and held by 5 WorldCat member libraries worldwide
An O(/E/loglog/V/) algorithm for finding minimum spanning trees by Andrew Chi-Chih Yao ( Book )
2 editions published in 1974 in English and held by 5 WorldCat member libraries worldwide
On random 3-2 trees by Andrew Chi-Chih Yao ( Book )
1 edition published in 1974 in English and held by 4 WorldCat member libraries worldwide
Optimal expected-time algorithms for closest-point problems by Jon Louis Bentley ( Book )
1 edition published in 1979 in English and held by 4 WorldCat member libraries worldwide
Geometric closest-point problems deal with the proximity relationships in k-dimensional point sets. Examples of closest-point 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 closest-point problems in optimal worst-case time. In this paper we extend their work by giving optimal expected-time algorithms for solving a number of closest-point 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
The complexity of pattern matching for a random string by Andrew Chi-Chih Yao ( Book )
2 editions published in 1977 in English and held by 4 WorldCat member libraries worldwide
Probabilistic behavior of shortest paths over unbounded regions by Andrew Chi-Chih 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 independently distributed according to P. It is shown that the length of the shortest traveling salesman's tour through v₁, v₂ ..., v[subscript n] is, for large n, almost surely around [alpha][rho]n[superscript (k - 1)/k] for some constant [alpha][rho]. This proves a conjecture of Beardwood, Halton and Hammersley (Proc. Camb. Phil. Soc. 55 (1959, 299-327)."
On the parallel computation for the knapsack problem by Andrew Chi-Chih Yao ( Book )
3 editions published in 1980 in English and held by 4 WorldCat member libraries worldwide
A lower bound to finding convex hulls by Andrew Chi-Chih Yao ( Book )
3 editions published in 1979 in English and held by 4 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
New algorithms in bin packing by Andrew Chi-Chih Yao ( Book )
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 Chi-Chih Yao ( Book )
3 editions published in 1977 in English and Undetermined and held by 3 WorldCat member libraries worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.87 (from 0.47 for Xianggang ... to 0.97 for On a probl ...)
Languages
English (38)
Chinese (1)