On the Average-Case Complexity of Selecting the k th Best
- 期刊名称SIAM Journal on Computing
- 作者Yao, Andrew C.; Yao, F. Frances
- 卷第11卷
- 期第3期
- 印刷ISSN0097-5397
- 电子ISSN1095-7111
- 文件大小1677.64KB
- 发表时间1982-08
- DOI10.1137/0211034
- 页码428-447
On Three-Dimensional PackingLi, Keqin; Cheng, Kam-Hoi · SIAM Journal on Computing · 1990
Priority Search TreesMcCreight, Edward M. · SIAM Journal on Computing · 1985
Scheduling Split IntervalsBar-Yehuda, R.; Halldórsson, M. M.; Naor, J. (S.); Shachnai, H.; Shapira, I. · SIAM Journal on Computing · 2006
Nondeterminism within $P^ * $Buss, Jonathan F.; Goldsmith, Judy · SIAM Journal on Computing · 1993
Optimization of Straight Line ProgramsAho, Alfred V.; Ullman, Jeffrey D. · SIAM Journal on Computing · 1972
Quantum Entanglement and Communication ComplexityBuhrman, Harry; Cleve, Richard; van Dam, Wim · SIAM Journal on Computing · 2001
On Classes of Program SchemataConstable, Robert L.; David, Gries · SIAM Journal on Computing · 1972
Bounded Concurrent Time-StampingDolev, Danny; Shavit, Nir · SIAM Journal on Computing · 1997