Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

44

Voted

TCS
2011

favoriteEmaildiscussreport

179views Theoretical Computer Science» more TCS 2011»

Bitonic sorters of minimal depth

13 years 7 months ago

Bitonic sorters of minimal depth

Download www.cs.technion.ac.il

Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .

Tamir Levi, Ami Litman

Real-time Traffic

Bitonic Sorter | Keys | Minimal Depth | TCS 2011 | Theoretical Computer Science |

claim paper

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TCS
Authors	Tamir Levi, Ami Litman

Comments (0)