The main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n then n objects can be sorted in r rounds by asking no more than 2r+1n1+1/r(log n)2-2/r/(log log n)(r-1/r questions in each round.
%0 Journal Article
%1 BOLLOBAS198821
%A Bollobás, Béla
%D 1988
%J Discrete Mathematics
%K algorithm sorting
%N 1
%P 21--28
%R 10.1016/0012-365X(88)90190-2
%T Sorting in Rounds
%V 72
%X The main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n then n objects can be sorted in r rounds by asking no more than 2r+1n1+1/r(log n)2-2/r/(log log n)(r-1/r questions in each round.
@article{BOLLOBAS198821,
abstract = {The main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n then n objects can be sorted in r rounds by asking no more than 2r+1n1+1/r(log n)2-2/r/(log log n)(r-1/r questions in each round.},
added-at = {2016-11-08T04:41:39.000+0100},
author = {Bollob\'{a}s, B\'{e}la},
biburl = {https://www.bibsonomy.org/bibtex/26637da608415a80eeca3ea787fa26880/ytyoun},
doi = {10.1016/0012-365X(88)90190-2},
interhash = {27271bbd76a5bb812fcc3f667258d117},
intrahash = {6637da608415a80eeca3ea787fa26880},
issn = {0012-365X},
journal = {Discrete Mathematics},
keywords = {algorithm sorting},
number = 1,
pages = {21--28},
timestamp = {2016-11-08T06:04:51.000+0100},
title = {Sorting in Rounds},
volume = 72,
year = 1988
}