Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton. Breaking the Theta (n log² n) Barrier for Sorting with Faults. J. Comput. Syst. Sci., 54(2):265-304, 1997.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract)Frank Thomson Leighton, Yuan Ma. focs 1993: 734-743 An ::::O::::(::::n:::: ::::log:::: ::::n::::)-Size Fault-Tolerant Sorting Network (Extended Abstract)Yuan Ma. stoc 1996: 266-275 [doi]
The following publications are possibly variants of this publication: