Sciweavers

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

15

STOC
1995
ACM

favoriteEmaildiscussreport

117views Algorithms» more STOC 1995»

Lower bounds for sorting networks

13 years 8 months ago

Lower bounds for sorting networks

Download nkahale.free.fr

Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C.

Real-time Traffic

Algorithms | STOC 1995 |

claim paper

Related Content

» Lower Bounds on Correction Networks

» Hypercubic Sorting Networks

» ComparisonSorting and Selecting in Totally Monotone Matrices

» Lower bounds for sorting with few random accesses to external memory

» Optimal Conclusive Sets for Comparator Networks

» SortingBased Selection Algorithms for Hypercubic Networks

» A Lower Bound on the Transposition Diameter

» Quantum Complexities of Ordered Searching Sorting and Element Distinctness

» Sorting on the OTISMesh

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	STOC
Authors	Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi

Comments (0)