PARALLEL SELECTION WITH HIGH PROBABILITY

被引:9
作者
BOLLOBAS, B
BRIGHTWELL, G
机构
关键词
D O I
10.1137/0403003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:21 / 31
页数:11
相关论文
共 14 条
[1]  
AJTAI M, 1986, 18TH P ANN ACM S THE
[2]   THE AVERAGE COMPLEXITY OF DETERMINISTIC AND RANDOMIZED PARALLEL COMPARISON-SORTING ALGORITHMS [J].
ALON, N ;
AZAR, Y .
SIAM JOURNAL ON COMPUTING, 1988, 17 (06) :1178-1192
[3]  
ALON N, 1988, SIAM J DISCRETE MATH, V1, P269
[4]  
BENT SW, 1985, 17TH P ANN ACM S THE, P213
[5]   TRANSITIVE ORIENTATIONS OF GRAPHS [J].
BOLLOBAS, B ;
BRIGHTWELL, G .
SIAM JOURNAL ON COMPUTING, 1988, 17 (06) :1119-1133
[6]  
Bollobas B., 1985, RANDOM GRAPHS
[7]  
CUNTO W, 1984, 16TH P ACM S THEOR C, P369
[8]   EXPECTED TIME BOUNDS FOR SELECTION [J].
FLOYD, RW ;
RIVEST, RL .
COMMUNICATIONS OF THE ACM, 1975, 18 (03) :165-172
[9]   CORRELATION INEQUALITIES ON SOME PARTIALLY ORDERED SETS [J].
FORTUIN, CM ;
KASTELEY.PW ;
GINIBRE, J .
COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1971, 22 (02) :89-&
[10]   SOME MONOTONICITY PROPERTIES OF PARTIAL ORDERS [J].
GRAHAM, RL ;
YAO, AC ;
YAO, FF .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (03) :251-258