Optimal Unbounded Search Strategies
暂无分享,去创建一个
[1] Joel H. Spencer,et al. Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..
[2] J. Kiefer,et al. Sequential minimax search for a maximum , 1953 .
[3] P. Martin-Löf. Complexity oscillations in infinite binary sequences , 1971 .
[4] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[5] Richard M. Karp,et al. Parallel minimax search for a maximum , 1968 .
[6] Andrew Chi-Chih Yao,et al. An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..
[7] Michael Rodeh,et al. Economical encoding of commas between strings , 1978, CACM.
[8] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.
[9] John Charles Linn,et al. General methods for parallel-searching. , 1973 .
[10] Joel H. Spencer,et al. Coping with errors in binary search procedures (Preliminary Report) , 1978, STOC.
[11] H. T. Kung,et al. Synchronized and asynchronous parallel algorithms for multiprocessors , 1976 .
[12] Howard P. Katseff. From the recursive function theory newsletter , 1978, SIGA.
[13] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.